Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations
From MaRDI portal
Publication:4611522
DOI10.1137/17M112590XzbMath1405.42001arXiv1703.00135MaRDI QIDQ4611522
Anyi Bao, Ben Adcock, John D. Jakeman, Akil C. Narayan
Publication date: 21 January 2019
Published in: SIAM/ASA Journal on Uncertainty Quantification (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.00135
Trigonometric approximation (42A10) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15)
Related Items (6)
Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class ⋮ Robust censored regression with \(\ell_1\)-norm regularization ⋮ Correcting for unknown errors in sparse high-dimensional function approximation ⋮ Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising ⋮ Recovery guarantees for polynomial coefficients from weakly dependent data with outliers ⋮ Towards optimal sampling for learning sparse approximation in high dimensions
Uses Software
Cites Work
- Unnamed Item
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- A mathematical introduction to compressive sensing
- Sparse Legendre expansions via \(\ell_1\)-minimization
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Interpolation via weighted \(\ell_{1}\) minimization
- Infinite-dimensional compressed sensing and function interpolation
- Compressed sensing and matrix completion with constant proportion of corruptions
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Refined analysis of sparse MIMO radar
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Correcting Data Corruption Errors for Multivariate Function Approximation
- Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
- Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- The Quest for Optimal Sampling: Computationally Efficient, Structure-Exploiting Measurements for Compressed Sensing
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
- Recovery of Sparsely Corrupted Signals
- A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
- Dense Error Correction Via $\ell^1$-Minimization
- Compressed Sensing and Parallel Acquisition
- Stochastic Collocation on Unstructured Multivariate Meshes
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
This page was built for publication: Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations
