Polynomial approximation via compressed sensing of high-dimensional functions on lower sets

DOI10.1090/mcom/3272OpenAlexW2284492459MaRDI QIDQ4605704

No author found.

Publication date: 27 February 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.05823

zbMATH Keywords

convex optimizationpolynomial approximationcompressed sensinghigh-dimensional methodsdownward closed (lower) sets

Mathematics Subject Classification ID

Random fields; image analysis (62M40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Random operators and equations (aspects of stochastic analysis) (60H25) Random matrices (algebraic aspects) (15B52) PDEs with randomness, stochastic partial differential equations (35R60) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Randomized algorithms (68W20) Relations with random matrices (11M50) Algorithmic randomness and dimension (03D32)

Related Items (33)

Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data ⋮ Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension ⋮ Near-Optimal Sampling Strategies for Multivariate Function Approximation on General Domains ⋮ Accelerating Stochastic Collocation Methods for Partial Differential Equations with Random Input Data ⋮ Hyperspherical Sparse Approximation Techniques for High-Dimensional Discontinuity Detection ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals ⋮ Adaptive group Lasso neural network models for functions of few variables and time-dependent data ⋮ Analysis of sparse recovery for Legendre expansions using envelope bound ⋮ A metalearning approach for physics-informed neural networks (PINNs): application to parameterized PDEs ⋮ Correcting for unknown errors in sparse high-dimensional function approximation ⋮ Optimal approximation of infinite-dimensional holomorphic functions ⋮ APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS ⋮ Constructing Least-Squares Polynomial Approximations ⋮ Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing ⋮ Flavors of Compressive Sensing ⋮ Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations ⋮ Recovery guarantees for polynomial coefficients from weakly dependent data with outliers ⋮ A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ A Compressive Spectral Collocation Method for the Diffusion Equation Under the Restricted Isometry Property ⋮ Sparse polynomial chaos expansions via compressed sensing and D-optimal design ⋮ An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework ⋮ A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials ⋮ Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables ⋮ Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs ⋮ Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time ⋮ Multivariate extensions of isotonic regression and total variation denoising via entire monotonicity and Hardy-Krause variation ⋮ A mixed ℓ₁ 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 ⋮ GenMod: a generative modeling approach for spectral representation of PDEs with random inputs ⋮ Generalization bounds for sparse random feature expansions

Uses Software

• SPGL1

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of quasi-optimal stochastic Galerkin methods for a class of PDES with random coefficients
• 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
• On the stability and accuracy of least squares approximations
• High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
• Sparse Legendre expansions via \(\ell_1\)-minimization
• Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Iterative hard thresholding for compressed sensing
• 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
• Modeling uncertainty in steady state diffusion problems via generalized polynomial chaos
• Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
• On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
• Low rank tensor recovery via iterative hard thresholding
• Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
• REGULARITY AND GENERALIZED POLYNOMIAL CHAOS APPROXIMATION OF PARAMETRIC AND RANDOM SECOND-ORDER HYPERBOLIC PARTIAL DIFFERENTIAL EQUATIONS
• Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
• Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
• On sparse reconstruction from Fourier and Gaussian measurements
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Probing the Pareto Frontier for Basis Pursuit Solutions
• A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• The Restricted Isometry Property of Subsampled Fourier Matrices
• A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
• Approximation of high-dimensional parametric PDEs
• Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
• An Adaptive Wavelet Stochastic Collocation Method for Irregular Solutions of Partial Differential Equations with Random Input Data
• An Improved Estimate in the Restricted Isometry Problem
• Recovering Compressively Sampled Signals Using Partial Support Information
• Probability Inequalities for Sums of Bounded Random Variables
• Stochastic Collocation on Unstructured Multivariate Meshes
• STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
• Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes
• Compressed sensing

This page was built for publication: Polynomial approximation via compressed sensing of high-dimensional functions on lower sets