From Biased to Unbiased Dynamics: An Infinitesimal Generator Approach
Not on the map. Why?
Abstract (arXiv)
We investigate learning the eigenfunctions of evolution operators for time-reversal invariant stochastic processes, a prime example being the Langevin equation used in molecular dynamics. Many physical or chemical processes described by this equation involve transitions between metastable states separated by high potential barriers that can hardly be crossed during a simulation. To overcome this bottleneck, data are collected via biased simulations that explore the state space more rapidly. We propose a framework for learning from biased simulations rooted in the infinitesimal generator of the process and the associated resolvent operator. We contrast our approach to more common ones based on the transfer operator, showing that it can provably learn the spectral properties of the unbiased system from biased data. In experiments, we highlight the advantages of our method over transfer operator approaches and recent developments based on generator learning, demonstrating its effectiveness in estimating eigenfunctions and eigenvalues. Importantly, we show that even with datasets containing only a few relevant transitions due to sub-optimal biasing, our approach recovers relevant information about the transition mechanism.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 12 of its 50 references that are in the map. First posted on arXiv 13 Jun 2024.
Builds on
12 of 50 references.
References · 12
- 2017VAMPnets: Deep learning of molecular kineticscited by 135
- 2019Data-driven approximation of the Koopman generator: Model reduction, system identification, and controlcited by 85
- 2022Learning Dynamical Systems via Koopman Operator Regression in Reproducing Kernel Hilbert Spacescited by 66
- 2023Sharp Spectral Rates for Koopman Operator Learningcited by 35
- 2021Chasing Collective Variables using Autoencoders and biased trajectoriescited by 13
- 2021Solving eigenvalue PDEs of metastable diffusion processes using artificial neural networkscited by 13
- 2024Learning the Infinitesimal Generator of Stochastic Diffusion Processescited by 9
- 2023Transition Path Sampling with Boltzmann Generator-based MCMC Movescited by 8
- 2023The Galerkin method beats Graph-Based Approaches for Spectral Algorithmscited by 6
- 2023Kernelized Diffusion mapscited by 5
- 2022Reweighted Manifold Learning of Collective Variables from Enhanced Sampling Simulationscited by 4
- 2023Data-driven path collective variablescited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 4.
6 papers.
- 2024Laplace Transform Based Low-Complexity Learning of Continuous Markov Semigroupscited by 7
- 2025kooplearn: A Scikit-Learn Compatible Library of Algorithms for Evolution Operator Learningcited by 1
- 2026Adaptive Kernel Selection for Kernelized Diffusion Mapscited by 0
- 2026Demystifying Linear Operator Learning for Control Systemscited by 0
- 2026Multi-Task Learning of Conditional Mean Operators: applications to dynamical systems and uncertainty quantificationcited by 0
- 2026Langevin-Informed Transfer Learning: Replacing Target Samples by Black-Box Feedbackcited by 0
- 2026Langevin-Informed Transfer Learning: Replacing Target Samples by Black-Box Feedback1 Oct 2026
- 2026Multi-Task Learning of Conditional Mean Operators: applications to dynamical systems and uncertainty quantification28 Sep 2026
- 2026Demystifying Linear Operator Learning for Control Systems16 Sep 2026
- 2026Adaptive Kernel Selection for Kernelized Diffusion Maps20 Apr 2026
- 2025kooplearn: A Scikit-Learn Compatible Library of Algorithms for Evolution Operator Learning24 Dec 2025
- 2024Laplace Transform Based Low-Complexity Learning of Continuous Markov Semigroups18 Oct 2024