- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces GRCD for generating signals on a fixed graph. Its graph-dependent forward process becomes isotropic variance-exploding diffusion after an invertible change of coordinates. A Gaussian reference is fitted to the training data in the graph-Fourier basis and propagated to a finite noise level to initialize sampling. The score is decomposed into an analytic Gaussian component and a learned residual, allowing the Gaussian part of the probability-flow equation to be integrated exactly. The clearest result is that fitting the terminal reference improves generation at small sampling budgets under the reported metric. The construction is coherent, and the ablations are informative. My main reservation is whether the experiments isolate the additional benefit of the graph-dependent representation once the fitted reference and finite noise range are shared. I would also like more direct evidence that the model recovers the non-Gaussian structure deliberately included in the synthetic data.
Critical strengths
The main derivations fit together clearly. The graph-filter transformation, residual denoising target, and Gaussian propagator appear internally consistent. The paper also carefully distinguishes the propagated Gaussian reference from the true forward marginal.
The terminal-reference comparison tests a specific mechanism. Section 5.2 holds the score model fixed while changing the sampling initialization. The benefit of fitting the reference is large at finite terminal signal-to-noise ratio and nearly disappears near zero terminal SNR, consistent with the analytic limit. In Table 2, fitting the reference reduces METR-LA averaged maximum mean discrepancy from 0.3722 to 0.0513 at 16 network function evaluations.
The experiments include several useful controls. The Gaussian controls, DPM-Solver++ comparison, training-only covariance fitting, validation-based grid selection, uncertainty estimates, and wall-clock measurements help interpret the results. The authors also report cases where other methods perform better at larger sampling budgets.
Critical weaknesses
1. The practical effect of the terminal approximation remains unclear.
Appendix A.2.3 explicitly acknowledges that the propagated Gaussian reference generally differs from the true forward marginal. The remaining question is how much the approximation affects generation in the finite-SNR regime. Even with the exact score, applying the same invertible probability-flow map over a finite interval to two different initial distributions leaves different output distributions. However, the observation alone does not quantify the effect on aMMD or determine the behavior of the implemented finite-step sampler.
Section 5.2 provides useful evidence that fitting the reference improves initialization relative to a scalar Gaussian. A complementary diagnostic would measure the remaining discrepancy from the true terminal distribution. On the synthetic mixture, the authors could compare the fitted terminal reference with samples obtained by forward-corrupting fresh independent draws from the known data generator. Running both initializations through the same trained model, solver, grid, and NFE would test how sensitive generation is to the terminal approximation. The diagnostic draws should be separate from the final evaluation samples.
The reported low-budget gains remain useful. The proposed check would help assess the distributional cost of the approximation, especially alongside the direct test of the planted mixture requested below.
2. The additional benefit of the graph-dependent representation needs a more direct comparison.
Proposition 1 expresses the graph-dependent process as isotropic VE diffusion under an invertible transformation. The transformation can improve learning or numerical conditioning, and Appendix A.1.2 explains the conditional-SNR result within the graph heat-diffusion family. My concern is whether the experiments separate the benefit of the graph transformation from that of the fitted Gaussian reference and finite noise range.
Let denote the scalar noise level in the conjugate isotropic coordinates. The existing isotropic and preconditioning controls use the noise range , compared with for finite-SNR GRCD. The whitened-score graph-prior control in Appendix A.6.4 shares the fitted covariance and finite noise regime, but retains the conjugate graph forward process. The existing comparisons therefore address parts of the question without fully isolating the graph transformation.
I would like a control that independently trains the same graph backbone directly on isotropically corrupted node signals, using the same fitted graph-spectral Gaussian reference and finite scalar noise range. The control should learn a residual relative to the Gaussian score under its own forward process. Each method should initialize from its corresponding propagated reference, with matched training and sampling budgets and the same protocol for choosing the solver and grid.
Wang and Vastola (2024), already cited by the paper, discuss propagated Gaussian initialization and learning a residual beyond a Gaussian score. A matched comparison would help identify the additional value of the graph-dependent representation. The current results show that the combined method works well under the chosen metric, but leave the size of that additional benefit unclear.
3. The synthetic evaluation does not directly test recovery of the planted non-Gaussian structure.
The reported aMMD compares the distributions of three scalar summaries: quadratic variation, spectral centroid, and degree correlation. These statistics measure useful properties of graph signals, but they do not directly test recovery of the planted bimodality. Appendix A.8.1 acknowledges the limitations of the metric; a direct check of the known synthetic mixture would make the evidence more complete.
The Gaussian controls provide meaningful evidence. In Table 11, GRCD achieves an aMMD of 0.0538 on METR-LA, compared with 0.1921 for the best direct Gaussian control. However, on the stochastic block model setting with spectral concentration parameter , the fitted graph-spectral Gaussian reaches 0.0535, close to GRCD's 0.0497. The small gap under aMMD leaves open whether GRCD recovers the bimodal coefficient distribution in that setting.
Please show the generated coefficient distribution along the Fiedler vector used by the synthetic data generator, with preprocessing handled consistently. A multivariate two-sample comparison on complete graph signals would also help assess joint structure beyond the three summaries. The direct mixture diagnostic is the more immediate request because the non-Gaussian feature is known by construction.
4. The runtime comparison with the strongest matched solver remains incomplete.
Section 5.4 already explains that the exponential-residual solver is competitive with DPM-Solver++ without consistently outperforming it. In Table 3, DPM-Solver++ 2M with power-law grid parameter achieves an aMMD of 0.0523 at four actual NFE, compared with 0.0552 for the proposed solver. The proposed solver has lower means at the other reported budgets.
However, the matched DPM-Solver++ configuration is absent from Figure 2 and Table 12. Its measured runtime under the same model, initialization, and grid would help assess which solver offers the better quality-cost tradeoff. I view the missing runtime comparison as a secondary concern; it does not invalidate the reported speedup over the external baselines and preconditioning controls.
Questions for authors
Q1. On the synthetic mixture, how close is the fitted terminal reference to the true forward marginal? How do generated samples change when the initialization is replaced by forward-corrupted independent synthetic draws, with the trained model, solver, grid, and NFE held fixed?
Q2. How does GRCD compare with isotropic VE diffusion independently trained directly on node signals, using the same fitted Gaussian reference and scalar noise interval, with each terminal reference propagated under its respective forward process? Under matched training and sampling protocols, what additional benefit comes from the graph-transformed representation?
Q3. Does GRCD recover the planted bimodal coefficient distribution along the Fiedler vector used by the synthetic data generator? How do the methods compare under a multivariate two-sample measure on complete graph signals?
Q4. Can the DPM-Solver++ 2M configuration from Table 3, with power-law grid parameter , be included in Figure 2 and Table 12 with measured sampling runtime?
4 comments
Reviewer: Q2. How does GRCD compare with isotropic VE diffusion independently trained directly on node signals, using the same fitted Gaussian reference and scalar noise interval, with each terminal reference propagated under its respective forward process?
We present a table of experimental results in the following. In this table, “Control” means ‘isotropic VE diffusion independently trained directly on node signals, using the same fitted Gaussian reference and scalar noise interval, with each terminal reference propagated under its respective forward process’.
GRCD vs. Control. METR-LA, , converged, mean ± s.d. over 3 seeds. Lower is better.
| Method | NFE 4 | NFE 8 | NFE 16 | NFE 64 |
|---|---|---|---|---|
| GRCD, =3 | 0.0538 ± 0.0037 | 0.0503 ± 0.0028 | 0.0509 ± 0.0015 | 0.0529 ± 0.0028 |
| Control, =3 | 0.0532 ± 0.0041 | 0.0506 ± 0.0061 | 0.0519 ± 0.0033 | 0.0541 ± 0.0046 |
| GRCD, Heun | 0.1618 ± 0.0137 | 0.0622 ± 0.0028 | 0.0537 ± 0.0034 | 0.0531 ± 0.0033 |
| Control, Heun | 0.2239 ± 0.0146 | 0.0678 ± 0.0050 | 0.0551 ± 0.0030 | 0.0545 ± 0.0033 |
Reviewer: Under matched training and sampling protocols, what additional benefit comes from the graph-transformed representation?
In the above table, row 1 and row 2 are very near, which is explainable in a mathematical sense. Rows 1 and 2 are close by construction. Proposition 1 shows that the two forward processes are the same process seen through an invertible rescaling, so with an exact score in continuous time they produce the same distribution. The Control is our own process with the graph shrinkage switched off, and it inherits the same closed-form reference and propagator. What the transformation provides is tractability for a graph-dependent corruption. Diagonalising the graph-dependent dynamics into independent spectral modes is what puts the forward transition, the propagated reference, the score and an exact modewise propagator in closed form for a single process, which is what graph heat diffusion lacks. That closed form is also what makes the mode-dependent SNR visible and controllable, which is why the noise scale is set by a terminal-SNR matching rule.
The Control considered here is distinct from the Isotropic VE baseline in Table 1 (in the paper). The paper’s Isotropic VE is a preconditioning baseline, which lacks the fitted reference, the residual-score parameterization and GRCD’s noise interval. The Control reported here supplies the isolation the question asks for: it is GRCD with only the graph transformation removed, which is why it reaches 0.0532 where the Table 1 baseline reaches 2.7581.
Our stated third contribution derives what happens to the propagated reference as the terminal noise grows, using the transformed representation.
As we can see in the last two table rows in the above table, with a second-order solver on a uniform grid, the graph-transformed process is ahead at every budget level and for every seed at NFE 4 to 16. And because seeds are shared it is lower in all nine seed-budget pairs at NFE 4, 8 and 16 (at NFE 16: 0.0573/0.0578, 0.0507/0.0519, 0.0532/0.0556).
Reviewer: Q3.1 Does GRCD recover the planted bimodal coefficient distribution along the Fiedler vector used by the synthetic data generator?
We interpret "recover" in this context as reproducing two distinct peaks. Indeed, in our experiments GRCD cannot reproduce this shape. The generator places two peaks near +3 and -3, along the Fiedler vector (the eigenvector of the graph Laplacian with the smallest nonzero eigenvalue, which separates the two communities). We project all samples onto it and count those in the gap (gap = 1.0 × component_sd = 0.9659, e.g., |x| < 0.9659, component_sd stands for component's standard deviation). The real data has 1.4% there, while GRCD has 24.0%± 1.1% (NFE 4, , three seeds, 5,000 samples each). This is close to what a single Gaussian of the same width would give (about 24% for that interval), and the standard deviations agree (3.13 against 3.14), as expected because our reference fits the variance.
The mismatch is based mainly on the Gaussian starting distribution, which cannot have two peaks. This explains why aMMD, which relies on second-order statistics, is insensitive to this difference. We add this observation to the limitations in the revised submission. A non-Gaussian reference, such as a Gaussian mixture, is a natural extension, but it would require adapting the exact Gaussian step, which we leave for future work.
Reviewer: Q3.2 How do the methods compare under a multivariate two-sample measure on complete graph signals?
We thank the reviewer for this question as this led us to perform additional experiments, which we describe in the following. We evaluated all methods with the multivariate energy distance V-statistic (Baringhaus and Franz, 2004; Székely and Rizzo, 2013) on complete 32-node graph signals, with n=m=1500, on SBM c = 1. All methods are evaluated in the same space, using per-node z-score normalization with statistics estimated exclusively from the training split, averaged over three seeds. The full Ledoit–Wolf Gaussian is a non-learned control with no sampler, evaluated over three independent draws to estimate sampling variability. The reference row compares two disjoint samples of real data in a single evaluation. The empirical energy distance V-statistic is defined as
\\;-\\; \frac{1}{n^{2}}\sum_{i=1}^{n}\sum_{j=1}^{n}\lVert X_i - X_j\rVert_2 \\;-\\; \frac{1}{m^{2}}\sum_{i=1}^{m}\sum_{j=1}^{m}\lVert Y_i - Y_j\rVert_2 ,$$ | Method | NFE 4 | NFE 16 | NFE 64 | |---|---|---|---| | Two disjoint real-data samples (reference) | 0.0104 | 0.0104 | 0.0104 | | Full Ledoit–Wolf Gaussian (non-learned, 3 draws) | 0.0161 ± 0.0008 | 0.0161 ± 0.0008 | 0.0161 ± 0.0008 | | **GRCD, $\rho = 3$** | **0.0194 ± 0.0068** | **0.0174 ± 0.0013** | 0.0185 ± 0.0008 | | Mode-dependent clock only | 0.0495 ± 0.0017 | 0.0531 ± 0.0017 | 0.0530 ± 0.0017 | | WSD-style, graph prior | 0.4390 ± 0.1361 | 0.7640 ± 0.1223 | 0.2850 ± 0.0487 | | WSD-style, scalar | 0.4754 ± 0.1483 | 1.0755 ± 0.1497 | 0.4417 ± 0.0638 | | Isotropic VE | 46.23 ± 0.07 | 0.0484 ± 0.0020 | **0.0135 ± 0.0009** | | Conjugate precond. | 46.26 ± 0.09 | 0.1640 ± 0.0971 | 0.0915 ± 0.0637 | | Static precond. | 46.32 ± 0.10 | 0.0684 ± 0.0134 | 0.0375 ± 0.0158 | | EDM | 124.32 ± 0.24 | 0.1490 ± 0.0041 | **0.0132 ± 0.0009** | | GAD (matched) | 664.31 ± 3.41 | 52.02 ± 0.11 | 44.37 ± 0.10 | On this metric the non-learned Gaussian is as good as GRCD, so the learned residual brings no measurable gain on SBM c = 1. This matches the remark in the appendix that the fitted Gaussian reaches 0.0535 against GRCD’s 0.0497 at c = 1. Every GRCD variant lands between 0.0166 and 0.0194 at NFE 4, within one seed standard deviation of each other, and all are far below the comparison methods. By NFE 64, EDM and isotropic VE overtake it (0.0132 and 0.0135 against 0.0185), consistent with the reversal we already report on the SBM settings in the main paper. In conclusion, GRCD's advantage lies in the low-budget regime. The synthetic generator is largely Gaussian. In its graph-Fourier basis, 31 of the 32 coefficients are Gaussian, with bimodality only along the Fiedler coefficient. A Euclidean-distance measure on all 32 coordinates dilutes the mismatch in this single direction, so, like aMMD, it is insensitive to the planted structure. The Fiedler projection analysis performed in Q3.1 is a more sensitive test of that structure. References. L. Baringhaus and C. Franz. On a new multivariate two-sample test. Journal of Multivariate Analysis, 88(1):190-206, 2004. G. J. Szekely and M. L. Rizzo. Energy statistics: A class of statistics based on distances. Journal of Statistical Planning and Inference, 143:1249-1272, 2013.Reviewer: Q4. Can the DPM-Solver++ 2M configuration from Table 3, with power-law grid parameter rho=3, be included in Figure 2 and Table 12 with measured sampling runtime?
Thank you for the suggestion. We have added “GRCD with DPM-Solver++ 2M ()” to Figure 2 and Table 15 (in the revised manuscript, it was previously Table 12). It uses the same trained model and forward process, and only the solver differs. Runtimes are measured on the same machine as the other entries ((Apple M5 Pro, MPS backend).
At NFE 4 it costs 0.50 seconds per 1000 samples against 0.52 for our solver, and it is the more accurate of the two there (aMMD 0.0523 ± 0.0010 against 0.0552 ± 0.0024 over three seeds). This configuration was already reported in Table 4 in the revised manuscript.
We thank the reviewer for this valuable suggestion.
We appreciate the time and care the reviewer has devoted to our work. Your comments have helped us refine our ideas and improve the presentation. We have incorporated your suggestions into the revised manuscript, with all changes highlighted in green for ease of review.
By "the synthetic mixture", we assume you mean our stochastic block model (SBM) setting, for which the true forward marginal can be computed because we generated this synthetic dataset. We drew 5,000 samples from the fitted terminal reference and 5,000 samples from the true forward marginal, and compared the two sample sets with the same aMMD the paper uses to compare the results. On SBM c = 1, kappa = 2, the distance between the fitted terminal reference and the true forward marginal is 0.0028 measured in aMMD, which is less than half the seed-to-seed standard deviation on this setting (±0.0062 for GRCD at NFE 4, this number is in the paper in Appendix: Additional Benchmark Results). They do differ in shape, because the true terminal law is a mixture with two peaks, and the bimodal component survives the forward process, while a Gaussian distribution has only one peak.
We thank the reviewer for this valuable question. We conduct this experiment on SBM because its known synthetic generator allows us to draw independent samples from the true forward marginal. For real-world datasets such as METR-LA and Molene, the underlying data distributions are unknown, so initialization from the true forward marginal is not directly feasible. Our fitted Gaussian reference is what makes the method usable without access to the true data distribution. This experiment provides useful insight into the potential improvement from a more accurate terminal reference.
We performed the experiment as suggested by changing the initialization in the sampler. Normally it starts from a sample of our fitted Gaussian reference. We replaced that draw with fresh generator samples, from a stream independent of train, validation and test, pushed forward to the terminal time. Everything else stayed fixed. We then measured the final generated samples against the real test data, on 5,000 generated samples against 5,000 test data. At four network evaluations, aMMD falls from 0.0497 ± 0.0062 to 0.0261 ± 0.0037 (mean ± std over 3 seeds).