TY - JOUR A1 - Helfmann, Luzie A1 - Ribera Borrell, Enric A1 - Schütte, Christof A1 - Koltai, Peter T1 - Extending Transition Path Theory: Periodically Driven and Finite-Time Dynamics JF - Journal of Nonlinear Science Y1 - 2020 U6 - https://doi.org/https://doi.org/10.1007/s00332-020-09652-7 VL - 30 SP - 3321 EP - 3366 ER - TY - THES A1 - Ribera Borrell, Enric T1 - From ergodic infinite-time to finite-time transition path theory Y1 - 2019 ER - TY - CHAP A1 - Ribera Borrell, Enric A1 - Richter, Lorenz A1 - Schütte, Christof T1 - Reinforcement Learning with Random Time Horizons T2 - Proceedings of the 42nd International Conference on Machine Learning Y1 - 2025 UR - https://raw.githubusercontent.com/mlresearch/v267/main/assets/borrell25a/borrell25a.pdf VL - 267 SP - 5101 EP - 5123 ER - TY - GEN A1 - Ribera Borrell, Enric A1 - Quer, Jannes A1 - Richter, Lorenz A1 - Schütte, Christof T1 - Improving control based importance sampling strategies for metastable diffusions via adapted metadynamics N2 - Sampling rare events in metastable dynamical systems is often a computationally expensive task and one needs to resort to enhanced sampling methods such as importance sampling. Since we can formulate the problem of finding optimal importance sampling controls as a stochastic optimization problem, this then brings additional numerical challenges and the convergence of corresponding algorithms might as well suffer from metastabilty. In this article we address this issue by combining systematic control approaches with the heuristic adaptive metadynamics method. Crucially, we approximate the importance sampling control by a neural network, which makes the algorithm in principle feasible for high dimensional applications. We can numerically demonstrate in relevant metastable problems that our algorithm is more effective than previous attempts and that only the combination of the two approaches leads to a satisfying convergence and therefore to an efficient sampling in certain metastable settings. T3 - ZIB-Report - 21-40 KW - importance sampling KW - stochastic optimal control KW - rare event simulation KW - metastability KW - neural networks KW - metadynamics Y1 - 2021 SN - 1438-0064 ER - TY - JOUR A1 - Ribera Borrell, Enric A1 - Quer, Jannes A1 - Richter, Lorenz A1 - Schütte, Christof T1 - Improving control based importance sampling strategies for metastable diffusions via adapted metadynamics JF - SIAM Journal on Scientific Computing (SISC) N2 - Sampling rare events in metastable dynamical systems is often a computationally expensive task and one needs to resort to enhanced sampling methods such as importance sampling. Since we can formulate the problem of finding optimal importance sampling controls as a stochastic optimization problem, this then brings additional numerical challenges and the convergence of corresponding algorithms might as well suffer from metastabilty. In this article we address this issue by combining systematic control approaches with the heuristic adaptive metadynamics method. Crucially, we approximate the importance sampling control by a neural network, which makes the algorithm in principle feasible for high dimensional applications. We can numerically demonstrate in relevant metastable problems that our algorithm is more effective than previous attempts and that only the combination of the two approaches leads to a satisfying convergence and therefore to an efficient sampling in certain metastable settings. KW - importance sampling KW - stochastic optimal control KW - rare event simulation KW - metastability KW - neural networks KW - metadynamics Y1 - 2023 U6 - https://doi.org/10.1137/22M1503464 VL - 89 IS - 1 ER - TY - JOUR A1 - Sikorski, Alexander A1 - Ribera Borrell, Enric A1 - Weber, Marcus T1 - Learning Koopman eigenfunctions of stochastic diffusions with optimal importance sampling and ISOKANN JF - Journal of Mathematical Physics N2 - The dominant eigenfunctions of the Koopman operator characterize the metastabilities and slow-timescale dynamics of stochastic diffusion processes. In the context of molecular dynamics and Markov state modeling, they allow for a description of the location and frequencies of rare transitions, which are hard to obtain by direct simulation alone. In this article, we reformulate the eigenproblem in terms of the ISOKANN framework, an iterative algorithm that learns the eigenfunctions by alternating between short burst simulations and a mixture of machine learning and classical numerics, which naturally leads to a proof of convergence. We furthermore show how the intermediate iterates can be used to reduce the sampling variance by importance sampling and optimal control (enhanced sampling), as well as to select locations for further training (adaptive sampling). We demonstrate the usage of our proposed method in experiments, increasing the approximation accuracy by several orders of magnitude. Y1 - 2024 U6 - https://doi.org/10.1063/5.0140764 VL - 65 SP - 013502 ER - TY - JOUR A1 - Quer, Jannes A1 - Ribera Borrell, Enric T1 - Connecting Stochastic Optimal Control and Reinforcement Learning JF - Journal of Mathematical Physics N2 - In this paper the connection between stochastic optimal control and reinforcement learning is investigated. Our main motivation is to apply importance sampling to sampling rare events which can be reformulated as an optimal control problem. By using a parameterised approach the optimal control problem becomes a stochastic optimization problem which still raises some open questions regarding how to tackle the scalability to high-dimensional problems and how to deal with the intrinsic metastability of the system. To explore new methods we link the optimal control problem to reinforcement learning since both share the same underlying framework, namely a Markov Decision Process (MDP). For the optimal control problem we show how the MDP can be formulated. In addition we discuss how the stochastic optimal control problem can be interpreted in the framework of reinforcement learning. At the end of the article we present the application of two different reinforcement learning algorithms to the optimal control problem and a comparison of the advantages and disadvantages of the two algorithms. Y1 - 2024 U6 - https://doi.org/10.1063/5.0140665 VL - 65 IS - 8 ER -