Thanks for the follow-up and continued engagement. We are happy to hear that some of your concerns were addressed with the original rebuttal, and we attempt to clarify the remaining questions below:
- **W1**: Yes, the decoder refers to the upscaling stages of the U-Net.
In the case of the 1D and 2D Gaussian experiments, since the input dimension is very small, there is no “encoder” as such. The 3-layer MLP acts as the decoder. We will improve the clarity of the term “decoder” in the revised version.
- **W2.2 and Re3** : Thank you for this suggestion, we will include the limitations of the proposed method in the revised version. We want to highlight that the goal of this work was to identify and discover the phenomenon of mode interpolation, and its intricate relationship with hallucinations, and show promise in detecting this through a simple metric. We absolutely agree that future work should focus on developing improved, and informed metrics for detecting hallucinated samples, especially in real-world datasets.
- **W3.2 and Re4**
- **Ground Truth Score Function:**
We refer you to Figure 4, column 3 where we show how $\hat{x_0}$ is a smooth approximation of the step function (to show the connection between the learned score function, and its effect on the predicted $\hat{x_0}$).
For instance, in the case of a mixture of Gaussians (1D), the score function precisely reflects the boundaries between different Gaussian components. This precision ensures that the score function is sharply defined in regions where the probability density changes abruptly, leading to no oscillations or artifacts between modes---informally, the predicted value snaps back to one of the modes, and is never in the region between modes because the force pulling it to the mode is so high. Essentially, the ground truth score function exactly mirrors the behavior of the true probability distribution, preventing any unintentional mixing or interpolation between modes.
- **Learned Score Function:**
When the model generates samples, it relies on the learned (smoothed) score function to reverse the diffusion process. First, this is smooth and does not show the step-function-like behavior of the true score function. Since the learned score function cannot sharply separate the modes, it creates a smoother gradient between them, effectively leading to oscillations or interpolations between the modes---informally, creating a region of high variance/uncertainty where samples are being pulled to either mode with a high, but finite force. This is why samples can end up in regions where the ground truth distribution has low or even zero probability—these are the regions between the modes.
- **Q1 and Re2**
- **The frequency of interpolated samples is inversely proportional to the number of sampling timesteps T’:** This is because if we have more timesteps, then the update on each $x_{t-1}$ given an $x_{t}$ would be smaller. This means that even when the $x_t$ is in the so-called region of uncertainty, it can quickly latch back to the nearest mode. On the contrary, if the sampling steps were less, each update means a larger step, leading to oscillations within the region of uncertainty, and from one mode to the other. Please note that there is a typo in the paper where we missed writing “inversely” proportional. The corresponding experimental results can be found in case of the VDM model in the **attached PDF**. We will include all of this and the updates in the final draft.
- **The number of interpolated samples also decreases as the distance from the modes increases:** Following the above explanation, if two modes are far apart, we need a larger shift from one $x_{t}$ to the next $x_{t-1}$ to oscillate between modes. This once again means that the models can latch back to the existing mode much more easily.
- **As the number of training samples increases, we observe that the proportion of interpolated samples decreases:** This is primarily because more data enables to learn a better approximation of the score function.
> Additionally, what's the difficulty for supplemental experiments across varying data sizes, and what's the authors' plan to conduct these experiments for the final version?
We note that we have run experiments with varying data sizes in Figure 9 of the paper. If the reviewer is asking about the detection results with varying data sizes, we plan to include the results of detection experiments with Gaussian1D and Gaussian2D across varying data sizes in the revised version. We agree that this would demonstrate the generality of the proposed detection metric.