Structured model selection via ℓ1−ℓ2 optimization
From MaRDI portal
Publication:6141559
DOI10.1088/1361-6420/AD0FADarXiv2305.17467MaRDI QIDQ6141559FDOQ6141559
Hongjin He, Linan Zhang, Xiaofan Lu
Publication date: 20 December 2023
Published in: Inverse Problems (Search for Journal in Brave)
Abstract: Automated model selection is an important application in science and engineering. In this work, we develop a learning approach for identifying structured dynamical systems from undersampled and noisy spatiotemporal data. The learning is performed by a sparse least-squares fitting over a large set of candidate functions via a nonconvex sparse optimization solved by the alternating direction method of multipliers. Using a Bernstein-like inequality with a coherence condition, we show that if the set of candidate functions forms a structured random sampling matrix of a bounded orthogonal system, the recovery is stable and the error is bounded. The learning approach is validated on synthetic data generated by the viscous Burgers' equation and two reaction-diffusion equations. The computational results demonstrate the theoretical guarantees of success and the efficiency with respect to the ambient dimension and the number of candidate functions.
Full work available at URL: https://arxiv.org/abs/2305.17467
model selectionsparse approximationdifference of convex optimizationstructured dynamical systemsrandom sampling matrices
Cites Work
- Title not available (Why is that?)
- SINDy-PI: a robust algorithm for parallel implicit sparse identification of nonlinear dynamics
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- Discovering governing equations from data by sparse identification of nonlinear dynamical systems
- Automated reverse engineering of nonlinear dynamical systems
- Proximal Splitting Methods in Signal Processing
- A mathematical introduction to compressive sensing
- Title not available (Why is that?)
- A Probabilistic and RIPless Theory of Compressed Sensing
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Large deviations for sums of partly dependent random variables
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- A method for finding structured sparse solutions to nonnegative least squares problems with applications
- On the Convergence of the SINDy Algorithm
- Fast L1-L2 minimization via a proximal operator
- Extracting Sparse High-Dimensional Dynamics from Limited Data
- Learning partial differential equations via data discovery and sparse optimization
- Sparse identification of nonlinear dynamics for model predictive control in the low-data limit
- Data-Driven Identification of Parametric Partial Differential Equations
- Weak SINDy for partial differential equations
- Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples
- Weak SINDy: Galerkin-Based Data-Driven Model Selection
- Sparse learning of partial differential equations with structured dictionary matrix
- New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods
- High-Dimensional Probability: An Introduction with Applications in Data Science
Cited In (1)
This page was built for publication: Structured model selection via ℓ1−ℓ2 optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6141559)
