- Rating
- 2(+1)
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
The paper proposes using an amortized method for estimating the smoothing posterior of stochastic differential equation with known dynamics given some noisy observations. They use an EM rollout to map the initial state and Gaussian increments to a trajectory. They then learn a control applied to the Gaussian increments which using targets from the simulations. After training it produces the approximate posterior trajectory with a single rollout. The paper also analyzes the approximation error of the fixed-covariance model and relation to the conditional trajectory law.
Critical strengths
The paper tackles and interesting problem. I find the strongest parts of the work to be:
- Shifting the means of the Brownian increments to incorporate the information of is interesting.
Critical weaknesses
While the paper tackles an interesting problem I have some concerns.
- The notation is often vague and ambiguous making it harder to read and understand what the authors did. For example the authors use to denote the learned control but also later use in Alg 1. The lack of consistent notation makes it harder to follow what Alg 1 does for example.
- My understanding reading the paper is that we learn this stochastic flow map which is a deterministic function of the initial condition and Gaussians . It's not clear to me where this map is used in Algorithm 1. Also the the practical implementation still does an Euler-Maruyama rollout so I'm confused by the utility of this deterministic map from the initial condition and discretized Brownian path. Additionally, several works have explored learning such stochastic flow maps in law [1-3] and in path [4-5]. Of the former [1] focuses on the traditional neural SDE setting and [2-3] focus on generative-time models; and for the later two [4] use a shifted Legendre polynomial to model the Brownian path following [6] and [5] uses the classic Karhunen-Loeve sinusoidal approximation of the Brownian path. I'm a bit concerned by the first-order discretization employed here as this encoding seems difficult to use.
- There is also quite a bit of work on learning these latent SDEs for example [7-8] and it is not clear to me how this work differs and how it fits into the broader literature.
References
[1] Kiyohara, Naoki, Johns, Edward, and Li, Yingzhen (2025). “Neural Stochastic Flows: Solver-Free Modelling and Inference for SDE Solutions”. In: The Thirty-ninth Annual Conference on Neural Information Processing Systems. URL: https://openreview.net/forum?id=PrYDDxphym
[2] Holderrieth, Peter, Chen, Douglas, Eyring, Luca, Shah, Ishin, Anantharaman, Giri, He, Yutong, Akata, Zeynep, Jaakkola, Tommi, Boffi, Nicholas Matthew, and Simchowitz, Max (2026). “Diamond Maps: Efficient Reward Alignment via Stochastic Flow Maps”. In: arXiv preprint arXiv:2602.05993
[3] Potaptchik, Peter, Saravanan, Adhi, Mammadov, Abbas, Prat, Alvaro, Albergo, Michael S, and Teh, Yee Whye (2026). “Meta Flow Maps enable scalable reward alignment”. In: arXiv preprint arXiv:2601.14430
[4] Pan, Zhengkai, Potaptchik, Peter, Yao, Wenxi, Albergo, Michael S, and Pidstrigach, Jakiw (2026). “Itô maps for any-step SDEs”. In: arXiv preprint arXiv:2606.11156
[5] McCallum, Sam, Blasingame, Zander W., Herschell, Timothy, Rindtorff, Niklas, Tong, Alexander, and Foster, James (2026). “Strong Stochastic Flow Maps”. In: ICML 2026 Workshop on Structured Probabilistic Inference & Generative Modeling.
[6] Foster, James, Lyons, Terry, and Oberhauser, Harald (2020). “An optimal polynomial approximation of Brownian motion”. In: SIAM Journal on Numerical Analysis 58.3, pp. 1393–142
[7] Grigory Bartosh, Dmitry Vetrov, and Christian A. Naesseth. SDE Matching: Scalable and simulation- free training of latent stochastic differential equations. In Proceedings of the 42nd International Conference on Machine Learning, volume 267 of Proceedings of Machine Learning Research, pp. 3054–3070. PMLR, 2025.
[8] Henry D Smith, Brian L Trippe, and Scott W Linderman. Closing the approximation gap in simulation-free latent SDEs. arXiv preprint arXiv:2606.16138, 2026.
Questions for authors
- Why pass the guidance term via rather than additively to the drift as currently you multiplicatively scale by the diffusion coefficient ? I suppose the argument is via Prop 3 that ideally is the score of but this wasn't very clear to me.
- Where do you use your deterministic map from the joint initial condition and Brownian path?
Follow up questions from Reviewer 7jKX
Thank you for your response and for conducting the additional experiments. I have also reread the revised paper, and my concerns regarding points 1–4 have been addressed. I have a few suggestions for the revision and two follow-up questions.
Suggestions for the revision
Follow-up questions
The training set requires ϵ0:K−1. Since the method uses noise as a supervision signal, does this mean that you also need to record the Brownian noise term γdWt added to the Lorenz system? If so, this would significantly limit the method's applicability, because the noise is generally not directly observable in real-world settings.
I am still confused by the explanation in point 5: "Run the frozen model to generate a high-resolution image, record its initial noise and the noise used at each step, and downsample the image." Isn't this procedure already part of standard diffusion models? Could you clarify what you intend to illustrate by presenting the diffusion and Brownian smoothing equations side by side?