Recovery guarantees for polynomial coefficients from weakly dependent data with outliers
From MaRDI portal
Publication:2209293
DOI10.1016/j.jat.2020.105472zbMath1451.41013arXiv1811.10115MaRDI QIDQ2209293
Hayden Schaeffer, Lam Si Tung Ho, Rachel Ward, Giang Tran
Publication date: 30 October 2020
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.10115
41A63: Multidimensional problems
41A10: Approximation by polynomials
41A99: Approximations and expansions
Related Items
Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples, Adaptive group Lasso neural network models for functions of few variables and time-dependent data, Towards optimal sampling for learning sparse approximation in high dimensions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discovering governing equations from data by sparse identification of nonlinear dynamical systems
- A mathematical introduction to compressive sensing
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- Learning functions of few arbitrary linear parameters in high dimensions
- System identification in the presence of outliers and random noises: a compressed sensing approach
- Modeling and nonlinear parameter estimation with Kronecker product representation for coupled oscillators and spatiotemporal systems
- Interpolation via weighted \(\ell_{1}\) minimization
- Learning from dependent observations
- Hidden physics models: machine learning of nonlinear partial differential equations
- Compressed sensing and matrix completion with constant proportion of corruptions
- A Bernstein-type inequality for some mixing processes and dynamical systems with an application to learning
- Approximation of infinitely differentiable multivariate functions is intractable
- Sequential function approximation with noisy data
- Fast learning from \(\alpha\)-mixing observations
- Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data
- Proximal Splitting Methods in Signal Processing
- Learning from Non-iid Data: Fast Rates for the One-vs-All Multiclass Plug-in Classifiers
- Machine learning: Trends, perspectives, and prospects
- Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks
- A CENTRAL LIMIT THEOREM AND A STRONG MIXING CONDITION
- Nonlinear Regression with Dependent Observations
- Empirical Processes with Applications to Statistics
- EXPONENTIAL INEQUALITIES AND FUNCTIONAL ESTIMATIONS FOR WEAK DEPENDENT DATA: APPLICATIONS TO DYNAMICAL SYSTEMS
- Effectively Well-Conditioned Linear Systems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Minimum complexity regression estimation with weakly dependent observations
- Extracting Sparse High-Dimensional Dynamics from Limited Data
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations
- Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing
- Learning partial differential equations via data discovery and sparse optimization
- Optimal weighted least-squares methods
- On the Convergence of the SINDy Algorithm
- Sparse identification of nonlinear dynamics for model predictive control in the low-data limit
- Corrupted Sensing: Novel Guarantees for Separating Structured Signals
- The elements of statistical learning. Data mining, inference, and prediction
