- Rating
- 2
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
Inferring the continuous latent states of latent stochastic differential equations (SDEs) is very challenging for high-dimensional state spaces and long time horizons. Recent work has shown that variational inference for latent SDEs can be made simulation-free (Course & Nair, 2023a; Bartosh et al., 2025; Smith et al., 2026). Smith et al. (2026) address this problem in a simulation-free way with the Helmholtz-SDE, which optimizes the variational objective over path laws compatible with the prescribed marginals. Built on that work, the authors developed a discrete-state counterpart of this idea for the continuous-time Markov chain (CTMC), which has a discrete state space, continuous time, and the Markov property. They introduced CTMC Matching, a simulation-free variational inference method for latent CTMCs.
Critical strengths
This paper is clearly written, well-organized and has Math rigor in derivation and proofs. The authors explicitly acknowledge the close conceptual connection to Smith et al. (2026) and appropriately credit the mathematical foundations underlying their proofs to Mielke et al. (2014), Renger (2018), and Patterson & Renger (2019).
Critical weaknesses
-
The authors worked on Bayesian smoothing problem but they did not provide a convergence guarantee or a quantitative error bound between its learned variational posterior and the true Bayesian smoothing posterior, which is a standard practice in theoretical papers of this field.
-
The authors solved the globally KL-optimal generator problem in Equation (5). However, for interacting particle systems, the authors replaced it with independent local optimization problems conditioned on neighborhood configurations in Equation (12). The authors proved that these local solutions produce a globally compatible generator and that the resulting path cost decomposes in Proposition 3.5. But they did not establish that this generator minimizes the original global KL objective over all generators compatible with the product-form marginals.
Questions for authors
-
Can you provide a rigorous convergence guarantee or a quantitative error bound between its learned variational posterior and the true Bayesian smoothing posterior?
-
Can you resolve the CTMC local matching issue for global KL-optimal?
-
The high-dimensional analysis uses the product form of q_t^{\phi}, but the exact smoothing distribution generally does not factorize in practice. Therefore, how could you guarantee the exact marginals belong to the proposed variational family?
-
The theoretical assumptions seems very restrictive and excludes many important CTMC examples.
3 comments
Response to Reviewer teWS (2/2)
Q4. "The theoretical assumptions seems very restrictive and excludes many important CTMC examples."
We would like to go through the assumptions (Appendix A.1) one by one, since our experiments already include the cases that each of them seems to exclude.
- Finite state space. It is used for the general theory. Reaction networks with unbounded counts are covered by the construction of Section 4.2, where Lemma E.1 gives an example of compatible rates in closed form on the infinite state space.
- Positive prior rates on a strongly connected graph. To the best of our knowledge, this assumption is required to make the potential unique. However, cases not covered by this assumption can be addressed with simple fixes in practice, and we explicitly show this in our experiments: irreversible dynamics are handled with a small rate floor in the prior at training time, as stated in Appendix A.1: the wildfire model (unburned burning burned) and the enzyme and Lotka–Volterra models are of this kind, and their exact references use the same floor.
- Positive likelihoods. These are needed only for the exactness and convergence theorems. The flashing ratchet has nearly noiseless observations (likelihood ), yet our method is competitive with the baselines.
If the reviewer has specific examples in mind of CTMCs that may not be covered by our framework, we would be glad to discuss them.
Thank you for the rebuttal and the additional clarifications. After considering the paper and the authors’ responses as a whole, I still find the overall level of methodological innovation limited. Therefore, I have decided to maintain my original score.
Response to Reviewer teWS (1/2)
We thank the Reviewer for the careful review of our results, and for pointing out two results that the paper was missing. Both are now in the revision.
Q1. "Can you provide a rigorous convergence guarantee or a quantitative error bound between its learned variational posterior and the true Bayesian smoothing posterior?"
The revision provides both (new Theorem 3.5, proved in Appendix B.5), which we briefly describe next. Let qt be the variational marginals, pt⋆ the exact smoothing marginals, Q be the variational posterior, and P(⋅∣Y) the smoothing posterior, as laws on paths. We measure the error of the marginals and of their time derivatives by
δ2=∫0T(∣q˙t−p˙t⋆∣12+∣qt−pt⋆∣12)dt. We show the following properties:
As is common in these types of results, we do not prove that stochastic-gradient training of a neural network converges to these solutions, but rather that the distance to the true smoothing posterior can be bounded in terms of the error of the marginals under CTMC Matching.
Q2. "They did not establish that this generator minimizes the original global KL objective over all generators compatible with the product-form marginals." / "Can you resolve the CTMC local matching issue for global KL-optimal?"
The Reviewer is correct in this observation: in general it does not, and the revision now states exactly what holds and how to close the gap. Let Qloc be the posterior with the local rates, and Q the posterior with the globally optimal rates at the same marginals.
In the new Proposition 3.7, we show: DKL(Qloc∥P(⋅∣Y))=DKL(Q∥P(⋅∣Y))+DKL(Qloc∥Q). The last term is zero only in special cases, for example when the sites do not interact.
We measure the contribution of each component on a small Ising model, where the exact smoother is tractable, and find that on this example improving the posterior family leads to much higher gains than solving for the rates globally. See Appendix C.1 and the response to the next question for more details.
Q3. "The exact smoothing distribution generally does not factorize in practice. Therefore, how could you guarantee the exact marginals belong to the proposed variational family?"
We cannot, and we do not assume it for Local CTMC Matching. Theorems 3.4 and 3.5 concern CTMC Matching with an unrestricted family, and we explicitly address restricted families, such as the ones considered in Local CTMC Matching, in the new Remark B.2. There, the KL divergence to the exact posterior is the optimization error plus the smallest KL divergence attainable in the family.
We measured this second term on a model with an exact posterior (Figure 2) and, most importantly, generalize our Local CTMC Matching posterior to factorize across non-overlapping blocks of sites. This simple addition, which leaves the algorithm unchanged, allows for an "interpolation" between the Local CTMC Matching and CTMC Matching (see Figure 2), which can be tuned based on the complexity of the problem and the compute budget.
On a 4×4 Ising lattice, block marginals of 2×2 sites roughly halve the KL divergence of product marginals to the exact posterior at every coupling strength. Following up on the previous question, on the same model the term DKL(Qloc∥Q) accounts for only 0.25% to 2.3% of the KL divergence to the exact posterior (Appendix C.1), which is much smaller than the gain from a more expressive marginal family.