Infinite-dimensional compressed sensing and function interpolation
From MaRDI portal
Publication:1656376
DOI10.1007/s10208-017-9350-3zbMath1396.41001arXiv1509.06073OpenAlexW2964095301MaRDI QIDQ1656376
Publication date: 10 August 2018
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.06073
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10)
Related Items (19)
Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method ⋮ Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data ⋮ Convergence bounds for empirical nonlinear least-squares ⋮ Near-Optimal Sampling Strategies for Multivariate Function Approximation on General Domains ⋮ On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals ⋮ Robust recovery of a kind of weighted l1-minimization without noise level ⋮ Analysis of sparse recovery for Legendre expansions using envelope bound ⋮ Correcting for unknown errors in sparse high-dimensional function approximation ⋮ APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS ⋮ Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations ⋮ Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ On Interpolation Approximation: Convergence Rates for Polynomial Interpolation for Functions of Limited Regularity ⋮ Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs ⋮ A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs ⋮ Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements ⋮ The Gap between Theory and Practice in Function Approximation with Deep Neural Networks ⋮ Minimum norm interpolation in the ℓ1(ℕ) space ⋮ Generalization bounds for sparse random feature expansions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- Generalized sampling and infinite-dimensional compressed sensing
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- New explicit-in-dimension estimates for the cardinality of high-dimensional hyperbolic crosses and approximation of functions having mixed smoothness
- Approximation of mixed order Sobolev functions on the \(d\)-torus: asymptotics, preasymptotics, and \(d\)-dependence
- Interpolation via weighted \(\ell_{1}\) minimization
- How sharp is Bernstein's inequality for Jacobi polynomials?
- A partial derandomization of phaselift using spherical designs
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients
- Subsampled Gauss Quadrature Nodes for Estimating Polynomial Chaos Expansions
- A Christoffel function weighted least squares algorithm for collocation approximations
- An Analysis of Block Sampling Strategies in Compressed Sensing
- Fundamental Performance Limits for Ideal Decoders in High-Dimensional Linear Inverse Problems
- ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
- Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Probing the Pareto Frontier for Basis Pursuit Solutions
- A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Alternative Proof of a Sharpened Form of Bernstein's Inequality for Legendre Polynomials
- Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
- Recovering Compressively Sampled Signals Using Partial Support Information
- A Probabilistic and RIPless Theory of Compressed Sensing
- A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Compressed Sensing and Parallel Acquisition
- Stochastic Collocation on Unstructured Multivariate Meshes
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
- Compressed sensing
This page was built for publication: Infinite-dimensional compressed sensing and function interpolation
