Compressed sensing with sparse corruptions: fault-tolerant sparse collocation approximations
From MaRDI portal
Abstract: The recovery of approximately sparse or compressible coefficients in a Polynomial Chaos Expansion is a common goal in modern parametric uncertainty quantification (UQ). However, relatively little effort in UQ has been directed toward theoretical and computational strategies for addressing the sparse corruptions problem, where a small number of measurements are highly corrupted. Such a situation has become pertinent today since modern computational frameworks are sufficiently complex with many interdependent components that may introduce hardware and software failures, some of which can be difficult to detect and result in a highly polluted simulation result. In this paper we present a novel compressive sampling-based theoretical analysis for a regularized minimization algorithm that aims to recover sparse expansion coefficients in the presence of measurement corruptions. Our recovery results are uniform, and prescribe algorithmic regularization parameters in terms of a user-defined a priori estimate on the ratio of measurements that are believed to be corrupted. We also propose an iteratively reweighted optimization algorithm that automatically refines the value of the regularization parameter, and empirically produces superior results. Our numerical results test our framework on several medium-to-high dimensional examples of solutions to parameterized differential equations, and demonstrate the effectiveness of our approach.
Recommendations
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- Sparse Recovery via ℓq-Minimization for Polynomial Chaos Expansions
- Compressed sensing and matrix completion with constant proportion of corruptions
- Stochastic collocation methods via minimisation of the transformed \(L_1\)-penalty
- On the Doubly Sparse Compressed Sensing Problem
Cites work
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- A mathematical introduction to compressive sensing
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Breaking the coherence barrier: a new theory for compressed sensing
- Compressed sensing and matrix completion with constant proportion of corruptions
- Compressed Sensing and Parallel Acquisition
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Correcting data corruption errors for multivariate function approximation
- Dense Error Correction Via \ell^1-Minimization
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Infinite-dimensional compressed sensing and function interpolation
- Interpolation via weighted \(\ell_{1}\) minimization
- 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
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Probing the Pareto frontier for basis pursuit solutions
- Recovery of Sparsely Corrupted Signals
- Refined analysis of sparse MIMO radar
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Sparse Legendre expansions via _1-minimization
- Stochastic collocation algorithms using _1-minimization
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- Stochastic collocation on unstructured multivariate meshes
- The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
Cited in
(10)- Recovery guarantees for polynomial coefficients from weakly dependent data with outliers
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Correcting for unknown errors in sparse high-dimensional function approximation
- Correcting data corruption errors for multivariate function approximation
- Robust censored regression with _1-norm regularization
- Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
- Towards optimal sampling for learning sparse approximation in high dimensions
- The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
- Oracle inequalities for corrupted compressed sensing
- Noise-robust multi-fidelity surrogate modelling for parametric partial differential equations
This page was built for publication: Compressed sensing with sparse corruptions: fault-tolerant sparse collocation approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611522)
