- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The authors consider the problem of learning the population dynamics on a graph when only unpaired temporal marginals are provided. Their approach prescribes an undirected, symmetrically weighted state graph with discrete Wasserstein geometry and introduces the continuity equation on that graph. This equation requires a notion akin to a probability mass function (PMF) or density defined on edges rather than vertices, which the authors resolve by introducing mobility , e.g. the mean of the probability mass of the endpoints. Although the continuity equation allows multiple solutions, one can ask, analogous to Action Matching (Neklyudov et al., 2023), for the solution with the minimal kinetic energy, which is unique. The main contribution of the paper is the method that finds this solution, which the authors refer to as Discrete Action Matching (DAM).
The crucial difference with Action Matching in the continuous space is the need to estimate the mobility. This can be done by using the 1-homogeneity of the mobility, which allows theta to be re-written in terms of the ratio of PMFs. The quantities required for the DAM approach can be obtained by sampling these local density ratios. Building on this idea, the paper splits training into two stages: first it fits a scalar field to represent the unnormalized log-density, and then it freezes it and proceeds with fitting the action potential according to the Action Matching method. The fields learned define a graph-supported Markov sampler. Experiments compare against results from free-energy gradient flow (FEGF) (Rancati et al., 2026) on eleven synthetic graph families and mouse gastrulation leave-one-stage-out interpolation, as well as two surface transport mesh problems.
Critical strengths
- Population dynamics is an active area of research in single cell biology and considering the problem on a graph is a valuable contribution to the field
- All underlying theory and methods are carefully reasoned and defended. This is especially notable when certain necessary conditions seem not to be met. The paper is honest about limitations and what it does not establish.
Critical weaknesses
- The paper presents two variants of DAM, one approach using histograms and another using learned ratios. The latter is achieved by training unnormalized PMFs, and this is the variant that the paper seems to present as the main contribution. On the other hand, the histogram approach is emphasized less and not mentioned in the abstract, despite outperforming the learned-ratios variant for the most part. The paper could be greatly strengthened by providing more motivation and support for the learned-ratios approach, including an experiment that demonstrates a way in which the learned-ratios approach is superior.
- In Figure 2, the new method is stated to outperform the baseline of free-energy gradient flow (FEGF) (Rancati et al., 2026). Such figures throughout the paper would be improved if a noise floor was provided, e.g. a Hellinger distance of 0.09. In particular, in Figure 2 DAM appears to be especially superior to FEGF for two graph families, Euclid-MST and Delaunay, and outperform FEGF for the other graph families only slightly. Some discussion of Euclid-MST and Delaunay would help delineate the cases in which this method best demonstrates its usefulness.
- Currently, the contribution of the paper is mostly theoretical. However, more practical experiments on large-scale datasets and in high dimensions would significantly strengthen the submission.
Questions for authors
- What are the reasons for the drastic performance difference on Euclid-MST and Delaunay? Is it related to their sparse connectedness, and would that also explain the difference in performance seen with the sphere and hand transport problems?
- In Appendix A.3 "Relation to the Maas–Rancati parameterization," it is noted that the conductances of DAM are not necessarily equivalent to those of Mass-Rancati as in FEGF. In particular, it is not equivalent for the logarithmic mean and nonuniform pi. Does this affect the comparison between DAM and FEGF, as in Figure 2, where logarithmic mean is displayed? If so, how is it affected?
2 comments
Official Comment by Authors. Part 2
3. "[...] The paper could be greatly strengthened by providing more motivation and support for the learned-ratios approach, including an experiment that demonstrates a way in which the learned-ratios approach is superior. [...] Currently, the contribution of the paper is mostly theoretical. However, more practical experiments on large-scale datasets and in high dimensions would significantly strengthen the submission."
The clearest advantage of learned ratios in our experiments occurs when each snapshot contains relatively few observations. In Appendix D.1, h-DAM and lr-DAM use the same prescribed interpolation, action architecture, and selection criterion. The table gives mean Hellinger distance to held-out simulator marginals for cubic smoothstep interpolation (Eq. 17), using the results in Figure 6.
| Samples per snapshot | Direct interpolation | h-DAM (ours) | lr-DAM (ours) |
|---|---|---|---|
| 128 | 0.1997 | 0.2042 | 0.1660 |
| 1,000 | 0.0688 | 0.0636 | 0.0641 |
At 128 samples per snapshot, learning the ratios reduces mean error from 0.2042 to 0.1660 relative to the histogram estimator. At 1,000 samples, the two estimators are nearly tied. This comparison identifies a setting in which the additional learning step improves prediction and one in which the simpler estimator works equally well.
We also added a downstream generation task on the discretized Swiss roll in Appendix D.3. With 512 training pairs and 32 sampling steps, lr-DAM achieves mean TV 0.2885, compared with 0.2952 for h-DAM and 0.3017 for SEDD [3] (Table 5). The advantage depends on the metric: h-DAM places less mass outside the observed clean reference support than lr-DAM (5.50% versus 6.21%).
The computational motivation for lr-DAM is that its training objective can be evaluated using sampled states and local ratios without constructing a joint histogram. The Swiss-roll state space still permits histogram evaluation, and the revised experiments do not establish an empirical advantage in high dimensions. They demonstrate a benefit under sparse sampling and comparable or modestly better generation accuracy on the tested state space.
4. "In Appendix A.3 "Relation to the Maas–Rancati parameterization," it is noted that the conductances of DAM are not necessarily equivalent to those of Mass-Rancati as in FEGF. In particular, it is not equivalent for the logarithmic mean and nonuniform pi. Does this affect the comparison between DAM and FEGF, as in Figure 2, where logarithmic mean is displayed? If so, how is it affected?"
Yes. In Figure 2, both methods use the logarithmic mean, but they apply it to different quantities. Let be the probability at vertex , let be its stationary probability under the reversible kernel , and write . With denoting the logarithmic mean, the conductances used by the two methods are
=\omega_{ij}\theta_{\log}(p_i,p_j), \qquad c_{ij}^{\mathrm{FEGF}}(p) =\omega_{ij}\theta_{\log}\left(\frac{p_i}{\pi_i},\frac{p_j}{\pi_j}\right).$$ When $\pi$ is uniform, homogeneity of the logarithmic mean makes the two conductances proportional by a single constant. When $\pi$ is nonuniform, the correction generally depends on the edge and the current marginal $p$. As a result, an identical potential difference across an edge can produce a different probability current under the two geometries. Conversely, fitting the same marginal evolution can require different potential differences. Figure 2 therefore compares marginal reconstruction under each method’s own geometry. Its errors quantify how well the complete methods reconstruct the same held-out distributions. They do not determine how much of the gap is due to the conductance choice or whether that choice favors either method on a particular graph. We now state this distinction explicitly in Appendix D.1 and give the conductance formulas in Appendix A.3. --- **Conclusion** Thank you again for prompting us to give h-DAM greater prominence, identify where learning the ratios improves prediction, and clarify how the choice of conductances affects the baseline comparison. We hope the revised manuscript and additional experiments address your concerns, and we would appreciate your reconsideration of the paper in light of these results. **References** [1] Rancati, Dario, et al. “Learning Discrete Diffusion on Graphs via Free-Energy Gradient Flows.” *Proceedings of the 43rd International Conference on Machine Learning*, PMLR, 2026. [2] Neklyudov, Kirill, et al. “Action Matching: Learning Stochastic Dynamics from Samples.” *Proceedings of the 40th International Conference on Machine Learning*, PMLR, 2023. [3] Lou, Aaron, et al. “Discrete Diffusion Modeling by Estimating the Ratios of the Data Distribution.” *Proceedings of the 41st International Conference on Machine Learning*, PMLR, 2024.
Official Comment by Authors. Part 1
Dear Reviewer knx3,
Thank you for recognizing the value of our contribution to learning population dynamics and for your positive assessment of the theory and clarity of the manuscript. We also appreciate your comments on Figure 1. Below, we address each of your concerns in turn.
1. "The paper presents two variants of DAM, one approach using histograms and another using learned ratios. [...] the histogram approach is emphasized less and not mentioned in the abstract, despite outperforming the learned-ratios variant for the most part. [...]"
Thank you for this constructive suggestion. We revised the abstract to describe both ways of estimating the density ratios and now introduce Histogram DAM (h-DAM) and Log-ratio DAM (lr-DAM) explicitly in the contribution statement. We also use these names consistently in the experimental figures and tables.
Both variants learn the action potential from samples. Their difference lies in how they obtain the neighboring density ratios required by the discrete action. h-DAM computes these ratios from interpolated empirical histograms. It is a natural choice when the state space can be enumerated and the snapshot counts are sufficiently informative. lr-DAM learns the ratios from sampled states and their neighbors, then holds the ratio model fixed while learning the action. This gives a sample-based counterpart to continuous Action Matching [2] without requiring a full marginal histogram.
We agree that h-DAM is an important result in its own right. For example, on mouse gastrulation with harmonic mobility, h-DAM achieves lower mean held-out Hellinger error than lr-DAM (0.203 versus 0.220, Table 3). The revised presentation gives both estimators equal prominence and identifies the settings in which each performs better.
2. "[...] In particular, in Figure 2 DAM appears to be especially superior to FEGF for two graph families, Euclid-MST and Delaunay, and outperform FEGF for the other graph families only slightly. Some discussion of Euclid-MST and Delaunay would help delineate the cases in which this method best demonstrates its usefulness. [...] What are the reasons for the drastic performance difference on Euclid-MST and Delaunay? [...]"
Euclid-MST and Delaunay had the smallest spectral gaps among the eleven graph families in Figure 2. This matters because FEGF [1] estimates a velocity target v from the difference between consecutive sampled marginals. It obtains v by first solving for a potential through a weighted graph Laplacian. Along a mode with eigenvalue λk, this solve amplifies sampling error in the corresponding potential coefficient by 1/λk. DAM learns the potential directly from samples and avoids this intermediate velocity estimate.
We tested this explanation by weakening the connection between two graph blocks while keeping the sampled marginals fixed. As the graph spectral gap decreased from 0.2 to 0.002, FEGF’s mean TV error increased by 6.15 percentage points when mass moved across the weak connection and by 5.04 points when it moved within the blocks. This supports poor conditioning as one reason why the FEGF–DAM gap is especially large on Euclid-MST and Delaunay.