.png){kind=icon}
返回
A FINITE EXPRESSION METHOD FOR SOLVING HIGH-DIMENSIONAL COMMITTOR PROBLEMS
.png){kind=icon}
OA
AI
DOI：10.1137/23M1583612.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Transition path theory (TPT) is a mathematical framework for quantifying rare transition events between a pair of selected metastable states A and B. Central to TPT is the committor function, which describes the probability to hit the metastable state B prior to A from any given starting point of the phase space. Once the committor is computed, the transition channels and the transition rate can be readily found. The committor is the solution to the backward Kolmogorov equation with appropriate boundary conditions. However, solving it is a challenging task in high dimensions due to the need to mesh a whole region of the ambient space. In this work, we explore the finite expression method (FEX, Liang and Yang (2022)) as a tool for computing the committor. FEX approximates the committor by an algebraic expression involving a fixed finite number of nonlinear functions and binary arithmetic operations. The optimal nonlinear functions, the binary operations, and the numerical coefficients in the expression template are found via reinforcement learning. The FEX-based committor solver is tested on several high-dimensional benchmark problems. It gives comparable or better results than neural network-based solvers. Most importantly, FEX is capable of correctly identifying the algebraic structure of the solution which allows one to reduce the committor problem to a low-dimensional one and find the committor with any desired accuracy.
Keyword:
committor functions
rare events
finite expression method
high dimensions
deep neural network
symbolic learning
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Order of maturation of the components of the working memory from childhood to emerging adulthood从童年到成年的工作记忆成分的成熟顺序
OAAI
OAAI分享收藏分享收藏
查看更多内容