Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
From MaRDI portal
compressed sensingconvex optimizationdownward closed (lower) setshigh-dimensional methodspolynomial approximation
Algorithmic randomness and dimension (03D32) Relations with random matrices (11M50) Random matrices (algebraic aspects) (15B52) PDEs with randomness, stochastic partial differential equations (35R60) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Random operators and equations (aspects of stochastic analysis) (60H25) Random fields; image analysis (62M40) Randomized algorithms (68W20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Recommendations
- Infinite-dimensional compressed sensing and function interpolation
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
- Stochastic collocation algorithms using _1-minimization
- Near-optimal sampling strategies for multivariate function approximation on general domains
Cites work
- A compressed sensing approach for partial differential equations with random input data
- A mathematical introduction to compressive sensing
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- An adaptive wavelet stochastic collocation method for irregular solutions of partial differential equations with random input data
- An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- An Improved Estimate in the Restricted Isometry Problem
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Approximation of high-dimensional parametric PDEs
- Approximation of mixed order Sobolev functions on the \(d\)-torus: asymptotics, preasymptotics, and \(d\)-dependence
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
- Compressed sensing
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Compressive sensing and structured random matrices
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- Convergence of quasi-optimal stochastic Galerkin methods for a class of PDES with random coefficients
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- Impossibility of fast stable approximation of analytic functions from equispaced samples
- Interpolation via weighted \(\ell_{1}\) minimization
- Iterative hard thresholding for compressed sensing
- Low rank tensor recovery via iterative hard thresholding
- Modeling uncertainty in steady state diffusion problems via generalized polynomial chaos
- New explicit-in-dimension estimates for the cardinality of high-dimensional hyperbolic crosses and approximation of functions having mixed smoothness
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- On sparse reconstruction from Fourier and Gaussian measurements
- On the stability and accuracy of least squares approximations
- Probability Inequalities for Sums of Bounded Random Variables
- Probing the Pareto frontier for basis pursuit solutions
- Recovering Compressively Sampled Signals Using Partial Support Information
- Regularity and generalized polynomial chaos approximation of parametric and random second-order hyperbolic partial differential equations
- Restricted isometry of Fourier matrices and list decodability of random linear codes
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
- Sparse Legendre expansions via _1-minimization
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Stochastic collocation algorithms using _1-minimization
- Stochastic collocation on unstructured multivariate meshes
- The restricted isometry property of subsampled Fourier matrices
Cited in
(39)- Infinite-dimensional compressed sensing and function interpolation
- 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
- 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
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs
- Generalization bounds for sparse random feature expansions
- 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
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Correcting for unknown errors in sparse high-dimensional function approximation
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- A metalearning approach for physics-informed neural networks (PINNs): application to parameterized PDEs
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
- Accelerating stochastic collocation methods for partial differential equations with random input data
- Hyperspherical sparse approximation techniques for high-dimensional discontinuity detection
- Flavors of compressive sensing
- Compressed sensing with sparse corruptions: fault-tolerant sparse collocation approximations
- The gap between theory and practice in function approximation with deep neural networks
- Near-optimal sampling strategies for multivariate function approximation on general domains
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Constructing least-squares polynomial approximations
- A compressive spectral collocation method for the diffusion equation under the restricted isometry property
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs
- 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
- Optimal approximation of infinite-dimensional holomorphic functions
- Towards optimal sampling for learning sparse approximation in high dimensions
- On efficient algorithms for computing near-best polynomial approximations to high-dimensional, Hilbert-valued functions from limited samples
- The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
- An efficient spatial discretization of spans of multivariate Chebyshev polynomials
- Approximation of functions: optimal sampling and complexity
- Surrogate models for diffusion on graphs via sparse polynomials
- Sparse sampling recovery by greedy algorithms
This page was built for publication: Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605704)
