4.6 Article

Learning mean-field equations from particle data using WSINDy

Journal

PHYSICA D-NONLINEAR PHENOMENA
Volume 439, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.physd.2022.133406

Keywords

Data-driven modeling; Interacting particle systems; Weak form; Mean-field limit; Sparse regression

Funding

  1. NSF Mathematical Biology MODULUS [2054085]
  2. NSF/NIH Joint DMS/NIGMS Mathematical Biology Initiative [R01GM126559]
  3. NSF Computing and Communications Foundations [1815983]
  4. National Science Foundation [ACI-1532235, ACI-1532236]
  5. University of Colorado Boulder, and Colorado State University
  6. Direct For Biological Sciences
  7. Div Of Molecular and Cellular Bioscience [2054085] Funding Source: National Science Foundation
  8. Direct For Computer & Info Scie & Enginr
  9. Division of Computing and Communication Foundations [1815983] Funding Source: National Science Foundation

Ask authors/readers for more resources

We have developed a weak-form sparse identification method for interacting particle systems (IPS), aiming to reduce computational complexity for large number of particles and offer robustness to noise. By combining mean-field theory of IPS with the weak-form sparse identification of nonlinear dynamics algorithm (WSINDy), we provide a fast and reliable system identification scheme for recovering the governing stochastic differential equations for an IPS.
We develop a weak-form sparse identification method for interacting particle systems (IPS) with the primary goals of reducing computational complexity for large particle number N and offering robustness to either intrinsic or extrinsic noise. In particular, we use concepts from mean-field theory of IPS in combination with the weak-form sparse identification of nonlinear dynamics algorithm (WSINDy) to provide a fast and reliable system identification scheme for recovering the governing stochastic differential equations for an IPS when the number of particles per experiment N is on the order of several thousands and the number of experiments M is less than 100. This is in contrast to existing work showing that system identification for N less than 100 and M on the order of several thousand is feasible using strong-form methods. We prove that under some standard regularity assumptions the scheme converges with rate O(N-1/2) in the ordinary least squares setting and we demonstrate the convergence rate numerically on several systems in one and two spatial dimensions. Our examples include a canonical problem from homogenization theory (as a first step towards learning coarse-grained models), the dynamics of an attractive-repulsive swarm, and the IPS description of the parabolic-elliptic Keller-Segel model for chemotaxis. Code is available at https://github.com/MathBioCU/WSINDy_IPS. (c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available