Computing high-dimensional invariant distributions from noisy data

被引:2
|
作者
Lin, Bo [1 ]
Li, Qianxiao [1 ,2 ]
Ren, Weiqing [1 ]
机构
[1] Natl Univ Singapore, Dept Math, 10 Lower Kent Ridge Rd, Singapore 119076, Singapore
[2] Natl Univ Singapore, Inst Funct Intelligent Mat, 4 Sci Dr 2, Singapore 117544, Singapore
基金
新加坡国家研究基金会;
关键词
Fokker -Planck equation; Invariant distribution; Noisy data; Maximum likelihood method; LANDSCAPE; NETWORK;
D O I
10.1016/j.jcp.2022.111783
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The invariant distribution is an important object in the study of randomly perturbed dynamical systems. The existing methods, including traditional finite difference or finite element methods as well as recently developed machine learning-based methods, all require the knowledge of the dynamical equations or adequate equilibrium data for estimating the invariant distribution. In this work, we propose a data-driven method for inferring the dynamics and simultaneously learning the invariant distribution from noisy trajectory data of the dynamical system. The data is not necessarily at equilibrium and may be collected from the transient period of the dynamics. The proposed method combines the idea of maximum likelihood estimation and a decomposition of the force field as suggested by the Fokker-Planck equation. The drift term (or force field), which is in the form of a decomposition with the constraint specified by the Fokker-Planck equation, and the diffusion term are learned from the data using an alternate updating algorithm. The generalized potential, which is the negative logarithm of the invariant distribution multiplied by the noise, is then obtained from the potential part of the decomposition. The proposed method is able to deal with high-dimensional dynamical systems and the small noise regime, without prior knowledge of the dynamical equations. The proposed method is demonstrated by four numerical examples, including a practical 10-dimensional biological network model.(c) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页数:16
相关论文
共 50 条
  • [41] APPROXIMATING THE MOMENTS OF MARGINALS OF HIGH-DIMENSIONAL DISTRIBUTIONS
    Vershynin, Roman
    [J]. ANNALS OF PROBABILITY, 2011, 39 (04): : 1591 - 1606
  • [42] HBDFA: An intelligent nature-inspired computing with high-dimensional data analytics
    Dinc, Baris
    Kaya, Yasin
    [J]. MULTIMEDIA TOOLS AND APPLICATIONS, 2024, 83 (04) : 11573 - 11592
  • [43] HBDFA: An intelligent nature-inspired computing with high-dimensional data analytics
    Barış Dinç
    Yasin Kaya
    [J]. Multimedia Tools and Applications, 2024, 83 : 11573 - 11592
  • [44] On Criticality in High-Dimensional Data
    Saremi, Saeed
    Sejnowski, Terrence J.
    [J]. NEURAL COMPUTATION, 2014, 26 (07) : 1329 - 1339
  • [45] High-dimensional data clustering
    Bouveyron, C.
    Girard, S.
    Schmid, C.
    [J]. COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2007, 52 (01) : 502 - 519
  • [47] High-Dimensional Data Bootstrap
    Chernozhukov, Victor
    Chetverikov, Denis
    Kato, Kengo
    Koike, Yuta
    [J]. ANNUAL REVIEW OF STATISTICS AND ITS APPLICATION, 2023, 10 : 427 - 449
  • [48] High-dimensional data visualization
    Tang, Lin
    [J]. NATURE METHODS, 2020, 17 (02) : 129 - 129
  • [49] High-dimensional data visualization
    Lin Tang
    [J]. Nature Methods, 2020, 17 : 129 - 129
  • [50] Modeling High-Dimensional Data
    Vempala, Santosh S.
    [J]. COMMUNICATIONS OF THE ACM, 2012, 55 (02) : 112 - 112