A Machine Learning Framework for Computing the Most Probable Paths of Stochastic Dynamical Systems
The emergence of transition phenomena between metastable states induced by noise plays a fundamental role in a broad range of nonlinear systems. The computation of the most probable paths is a key issue to understand the mechanism of transition behaviors. Shooting method is a common technique for this purpose to solve the Euler-Lagrange equation for the associated action functional, while losing its efficacy in high-dimensional systems. In the present work, we develop a machine learning framework to compute the most probable paths in the sense of Onsager-Machlup action functional theory. Specifically, we reformulate the boundary value problem of Hamiltonian system and design a neural network to remedy the shortcomings of shooting method. The successful applications of our algorithms to several prototypical examples demonstrate its efficacy and accuracy for stochastic systems with both (Gaussian) Brownian noise and (non-Gaussian) L\'evy noise. This novel approach is effective in exploring the internal mechanisms of rare events triggered by random fluctuations in various scientific fields.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningSimilar Papers 제목 키워드 기반
Computing large deviation prefactors of stochastic dynamical systems based on machine learning
In this paper, we present large deviation theory that characterizes the exponential estimate for rare events of stochastic dynamical systems in the limit of weak noise. We aim to consider next-to-leading-order approximat…
Computing the Most Probable String with a Probabilistic Finite State Machine
Bayes risk CTC: Controllable CTC alignment in Sequence-to-Sequence tasks
Sequence-to-Sequence (seq2seq) tasks transcribe the input sequence to a target sequence. The Connectionist Temporal Classification (CTC) criterion is widely used in multiple seq2seq tasks. Besides predicting the target s…
An Onsager-Machlup approach to the most probable transition pathway for a genetic regulatory network
We investigate a quantitative network of gene expression dynamics describing the competence development in Bacillus subtilis. First, we introduce an Onsager-Machlup approach to quantify the most probable transition pathw…
BIG-bench Machine LearningStatistical Inference in Hidden Markov Models using $k$-segment Constraints
Hidden Markov models (HMMs) are one of the most widely used statistical methods for analyzing sequence data. However, the reporting of output from HMMs has largely been restricted to the presentation of the most-probable…