Data-driven prediction of multistable systems from sparse measurements
Bryan Chu, Mohammad Farazmand

TL;DR
This paper introduces a novel data-driven, semi-supervised classification method using a sparsity-promoting metric-learning approach to predict the long-term states of multistable systems from limited measurements.
Contribution
It develops a convex, scalable metric-learning optimization that accurately predicts system behavior and guides measurement placement in multistable systems.
Findings
Achieves 95% accuracy in reaction-diffusion system predictions
Attains 90% accuracy in FitzHugh-Nagumo system predictions
Provides a method to identify optimal measurement locations
Abstract
We develop a data-driven method, based on semi-supervised classification, to predict the asymptotic state of multistable systems when only sparse spatial measurements of the system are feasible. Our method predicts the asymptotic behavior of an observed state by quantifying its proximity to the states in a precomputed library of data. To quantify this proximity, we introduce a sparsity-promoting metric-learning (SPML) optimization, which learns a metric directly from the precomputed data. The optimization problem is designed so that the resulting optimal metric satisfies two important properties: (i) It is compatible with the precomputed library, and (ii) It is computable from sparse measurements. We prove that the proposed SPML optimization is convex, its minimizer is non-degenerate, and it is equivariant with respect to scaling of the constraints. We demonstrate the application of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
