Quasi-potential and drift decomposition in stochastic systems by sparse identification

Leonardo Grigorio, Mnerh Alqahtani
{"title":"Quasi-potential and drift decomposition in stochastic systems by sparse identification","authors":"Leonardo Grigorio, Mnerh Alqahtani","doi":"arxiv-2409.06886","DOIUrl":null,"url":null,"abstract":"The quasi-potential is a key concept in stochastic systems as it accounts for\nthe long-term behavior of the dynamics of such systems. It also allows us to\nestimate mean exit times from the attractors of the system, and transition\nrates between states. This is of significance in many applications across\nvarious areas such as physics, biology, ecology, and economy. Computation of\nthe quasi-potential is often obtained via a functional minimization problem\nthat can be challenging. This paper combines a sparse learning technique with\naction minimization methods in order to: (i) Identify the orthogonal\ndecomposition of the deterministic vector field (drift) driving the stochastic\ndynamics; (ii) Determine the quasi-potential from this decomposition. This\ndecomposition of the drift vector field into its gradient and orthogonal parts\nis accomplished with the help of a machine learning-based sparse identification\ntechnique. Specifically, the so-called sparse identification of non-linear\ndynamics (SINDy) [1] is applied to the most likely trajectory in a stochastic\nsystem (instanton) to learn the orthogonal decomposition of the drift.\nConsequently, the quasi-potential can be evaluated even at points outside the\ninstanton path, allowing our method to provide the complete quasi-potential\nlandscape from this single trajectory. Additionally, the orthogonal drift\ncomponent obtained within our framework is important as a correction to the\nexponential decay of transition rates and exit times. We implemented the\nproposed approach in 2- and 3-D systems, covering various types of potential\nlandscapes and attractors.","PeriodicalId":501340,"journal":{"name":"arXiv - STAT - Machine Learning","volume":"2 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Machine Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.06886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The quasi-potential is a key concept in stochastic systems as it accounts for the long-term behavior of the dynamics of such systems. It also allows us to estimate mean exit times from the attractors of the system, and transition rates between states. This is of significance in many applications across various areas such as physics, biology, ecology, and economy. Computation of the quasi-potential is often obtained via a functional minimization problem that can be challenging. This paper combines a sparse learning technique with action minimization methods in order to: (i) Identify the orthogonal decomposition of the deterministic vector field (drift) driving the stochastic dynamics; (ii) Determine the quasi-potential from this decomposition. This decomposition of the drift vector field into its gradient and orthogonal parts is accomplished with the help of a machine learning-based sparse identification technique. Specifically, the so-called sparse identification of non-linear dynamics (SINDy) [1] is applied to the most likely trajectory in a stochastic system (instanton) to learn the orthogonal decomposition of the drift. Consequently, the quasi-potential can be evaluated even at points outside the instanton path, allowing our method to provide the complete quasi-potential landscape from this single trajectory. Additionally, the orthogonal drift component obtained within our framework is important as a correction to the exponential decay of transition rates and exit times. We implemented the proposed approach in 2- and 3-D systems, covering various types of potential landscapes and attractors.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过稀疏识别进行随机系统中的准势垒和漂移分解
准势垒是随机系统中的一个关键概念,因为它说明了此类系统动力学的长期行为。它还能让我们估算出系统吸引子的平均退出时间以及状态之间的过渡率。这在物理学、生物学、生态学和经济学等各个领域的许多应用中都具有重要意义。准势垒的计算通常是通过函数最小化问题来实现的,这可能具有挑战性。本文将稀疏学习技术与函数最小化方法相结合,旨在(i) 确定驱动随机动力学的确定性向量场(漂移)的正交分解;(ii) 根据该分解确定准势垒。将漂移矢量场分解为梯度和正交部分,是借助基于机器学习的稀疏识别技术完成的。具体来说,所谓的非线性动力学稀疏识别(SINDy)[1]应用于随机系统(瞬时)中最可能的轨迹,以学习漂移的正交分解。因此,即使在瞬时路径之外的点也可以评估准势能,从而使我们的方法能够从这一单一轨迹中提供完整的准势能场。此外,在我们的框架内获得的正交漂移分量对于校正过渡率和退出时间的指数衰减非常重要。我们在二维和三维系统中实施了所提出的方法,涵盖了各种类型的潜在地景和吸引子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fitting Multilevel Factor Models Cartan moving frames and the data manifolds Symmetry-Based Structured Matrices for Efficient Approximately Equivariant Networks Recurrent Interpolants for Probabilistic Time Series Prediction PieClam: A Universal Graph Autoencoder Based on Overlapping Inclusive and Exclusive Communities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1