@inproceedings{
du2024doobs,
title={Doob's Lagrangian: A Sample-Efficient Variational Approach to Transition Path Sampling},
author={Yuanqi Du and Michael Plainer and Rob Brekelmans and Chenru Duan and Frank Noe and Carla P Gomes and Alan Aspuru-Guzik and Kirill Neklyudov},
booktitle={The Thirty-eighth Annual Conference on Neural Information Processing Systems},
year={2024},
url={https://openreview.net/forum?id=ShJWT0n7kX}
}
Rare event sampling in dynamical systems is a fundamental problem arising in the natural sciences, which poses significant computational challenges due to an exponentially large space of trajectories. For settings where the dynamical system of interest follows a Brownian motion with known drift, the question of conditioning the process to reach a given endpoint or desired rare event is definitively answered by Doob's $h$-transform. However, the naive estimation of this transform is infeasible, as it requires simulating sufficiently many forward trajectories to estimate rare event probabilities. In this work, we propose a variational formulation of Doob's $h$-transform as an optimization problem over trajectories between a given initial point and the desired ending point. To solve this optimization, we propose a simulation-free training objective with a model parameterization that imposes the desired boundary conditions by design. Our approach significantly reduces the search space over trajectories and avoids expensive trajectory simulation and inefficient importance sampling estimators which are required in existing methods. We demonstrate the ability of our method to find feasible transition paths on real-world molecular simulation and protein folding tasks.
Doob's Lagrangian: A Sample-Efficient Variational Approach to Transition Path Sampling
Yuanqi Du Michael Plainer Rob Brekelmans Chenru Duan Frank Noe Carla P Gomes Alan Aspuru-Guzik Kirill Neklyudov