aiqbench analysis
This paper tackles a long-standing numerical problem in computational physics: computing committor functions for underdamped Langevin dynamics, where the standard variational tools break down. Its contribution is a splitting scheme that makes each subproblem variational so neural networks can solve it, with validation on standard benchmarks (a double-well potential, the Müller-Brown potential, and alanine dipeptide). For ML readers, the useful takeaway is a case study in neural PDE-style solvers applied to rare-event sampling, though the claimed gains are only as strong as the benchmark comparisons behind them.
Iterative Neural Variational Solver of Committor Function in Under-damped Langevin Dynamics
arXiv:2610.20617v1 Announce Type: cross Abstract: The committor function describes the probability that a stochastic dynamical system, while transitioning between two metastable states, will first reach one state rather than the other. It is a central object in transition path theory, providing the accurate reaction rate and the characterization of the transition mechanism through reactive probability flux and the transition state ensemble. While the numerical methods for this function are well studied for over-damped Langevin dynamics where the friction damping coefficient goes to infinity, its computation in the general under-damped case remains an open challenge due to the lack of a variational structure in the underlying backward Kolmogorov equation. This restricts the quantitative investigation of the impact of the finite damping coefficient on rare transitions in real systems. In this work, by decomposing the infinitesimal generator of the underdamped Langevin dynamics into a self-adjoint and a skew-adjoint part, we develop an iterative scheme in which each subproblem has a variational form and can be solved efficiently using neural networks. Fundamentally, this approach can be viewed as a generalized Concus-Golub-Widlund (CGW) splitting method and each subproblem has a variational form, which can be solved efficiently. This iterative scheme also has the flexibility of introducing a preconditioning operator associated with a new overdamped Langevin dynamics, which naturally leads to the design of enhanced adaptive sampling for the subproblems. We validate the efficiency and accuracy of our method on benchmark systems including a one-dimensional double-well potential, the Muller-Brown potential, and alanine dipeptide. The proposed iterative variational framework provides a practical and extensible numerical tool for probing rare transition events in Langevin dynamics across varying damping coefficients.
Abstract:The committor function describes the probability that a stochastic dynamical system, while transitioning between two metastable states, will first reach one state rather than the other. It is a central object in transition path theory, providing the accurate reaction rate and the characterization of the transition mechanism through reactive probability flux and the transition state ensemble. While the numerical methods for this function are well studied for over-damped Langevin dynamics where the friction damping coefficient goes to infinity, its computation in the general under-damped case remains an open challenge due to the lack of a variational structure in the underlying backward Kolmogorov equation. This restricts the quantitative investigation of the impact of the finite damping coefficient on rare transitions in real systems. In this work, by decomposing the infinitesimal generator of the underdamped Langevin dynamics into a self-adjoint and a skew-adjoint part, we develop an iterative scheme in which each subproblem has a variational form and can be solved efficiently using neural networks. Fundamentally, this approach can be viewed as a generalized Concus-Golub-Widlund (CGW) splitting method and each subproblem has a variational form, which can be solved efficiently. This iterative scheme also has the flexibility of introducing a preconditioning operator associated with a new overdamped Langevin dynamics, which naturally leads to the design of enhanced adaptive sampling for the subproblems. We validate the efficiency and accuracy of our method on benchmark systems including a one-dimensional double-well potential, the Muller-Brown potential, and alanine dipeptide. The proposed iterative variational framework provides a practical and extensible numerical tool for probing rare transition events in Langevin dynamics across varying damping coefficients.
Computational Physics (physics.comp-ph); Machine Learning (cs.LG)
arXiv:2610.20617 [physics.comp-ph]
(or arXiv:2610.20617v1 [physics.comp-ph] for this version)
https://doi.org/10.48550/arXiv.2610.20617 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 362 words
Related coverage
Energy Manifold Natural Gradient Descent: Riemannian Optimization for Neural PDE Solvers
arXiv · Jul 27, 2026
WINO: A Weak-Form Physics Informed Neural Operator for Hyperelasticity on Variable Domains
arXiv · Jul 21, 2026
Equation Recast for Canonical Operator Learning Across Parametric PDEs
arXiv · Sep 4, 2026

Exploding variance of means of exponentials: least-squares to the rescue – Machine Learning Research Blog
francisbach.com · Sep 27, 2026