Towards optimal sampling for learning sparse approximation in high dimensions (Q6390185)

scientific article; zbMATH DE number 7598274

Language	Label	Description	Also known as
English	Towards optimal sampling for learning sparse approximation in high dimensions	scientific article; zbMATH DE number 7598274

Statements

instance of

scholarly article

0 references

publication date

4 February 2022

0 references

arXiv classification

math.NA

0 references

cs.NA

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Infinite-dimensional $\ell ^1$ minimization and function approximation from pointwise data

0 references

Infinite-dimensional compressed sensing and function interpolation

0 references

Sparse approximation of multivariate functions from small datasets via weighted orthogonal matching pursuit

0 references

Near-Optimal Sampling Strategies for Multivariate Function Approximation on General Domains

0 references

Compressive Imaging: Structure, Sampling, Learning

0 references

APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS

0 references

Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements

0 references

Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations

0 references

Correcting for unknown errors in sparse high-dimensional function approximation

0 references

Sparse Polynomial Approximation of High-Dimensional Functions

0 references

Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions

0 references

A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions

0 references

Sequential Sampling for Optimal Weighted Least Squares Approximations in Hierarchical Spaces

0 references

Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison

0 references

Adaptive sparse polynomial chaos expansion based on least angle regression

0 references

Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs

0 references

Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs

0 references

High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs

0 references

Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs

0 references

Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs

0 references

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

0 references

Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables

0 references

An introduction to frames and Riesz bases

0 references

Approximation of high-dimensional parametric PDEs

0 references

Optimal pointwise sampling for $L^2$ approximation

0 references

Optimal weighted least-squares methods

0 references

Multivariate Approximation in Downward Closed Polynomial Spaces

0 references

ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S

0 references

On the stability and accuracy of least squares approximations

0 references

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

0 references

Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016

0 references

A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs

0 references

Sparse polynomial chaos expansions via compressed sensing and D-optimal design

0 references

Optimal sampling and Christoffel functions on general domains

0 references

A non-adapted sparse approximation of PDEs with stochastic inputs

0 references

On the convergence of generalized polynomial chaos expansions

0 references

Sequential Design of Experiment for Sparse Polynomial Chaos Expansions

0 references

Handbook of Uncertainty Quantification

0 references

Sparse Recovery via ℓq-Minimization for Polynomial Chaos Expansions

0 references

Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures

0 references

A gradient enhanced $\ell_{1}$-minimization for sparse approximation of polynomial chaos expansions

0 references

Constructing Least-Squares Polynomial Approximations

0 references

Boosted optimal weighted least-squares

0 references

Least squares polynomial chaos expansion: a review of sampling strategies

0 references

Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression

0 references

Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies

0 references

Basis adaptive sample efficient polynomial chaos (BASE-PC)

0 references

Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs

0 references

Recovery guarantees for polynomial coefficients from weakly dependent data with outliers

0 references

REGULARITY AND GENERALIZED POLYNOMIAL CHAOS APPROXIMATION OF PARAMETRIC AND RANDOM SECOND-ORDER HYPERBOLIC PARTIAL DIFFERENTIAL EQUATIONS

0 references

Enhancing $\ell_1$-minimization estimates of polynomial chaos expansions using basis selection

0 references

A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions

0 references

Polynomial chaos expansions for dependent random variables

0 references

Spectral Methods for Uncertainty Quantification

0 references

Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification

0 references

Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark

0 references

A Compressed Sensing Approach for Partial Differential Equations with Random Input Data

0 references

Adaptive Approximation by Optimal Weighted Least-Squares Methods

0 references

Multivariate approximation of functions on irregular domains by weighted least-squares methods

0 references

Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets

0 references

Analysis of discrete $L^2$ projection on polynomial spaces with random evaluations

0 references

Computation of induced orthogonal polynomial distributions

0 references

Stochastic Collocation on Unstructured Multivariate Meshes

0 references

A Christoffel function weighted least squares algorithm for collocation approximations

0 references

A weighted $\ell_1$-minimization approach for sparse polynomial chaos expansions

0 references

On polynomial chaos expansion via gradient-enhanced $\ell_1$-minimization

0 references

Numerical Fourier analysis

0 references

Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations

0 references

Sparse Legendre expansions via $\ell_1$-minimization

0 references

Interpolation via weighted $\ell_{1}$ minimization

0 references

Correcting Data Corruption Errors for Multivariate Function Approximation

0 references

Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression

0 references

Physical Systems with Random Uncertainties: Chaos Representations with Arbitrary Probability Measure

0 references

Introduction to Uncertainty Quantification

0 references

Subsampled Gauss Quadrature Nodes for Estimating Polynomial Chaos Expansions

0 references

On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification

0 references

Multivariate Approximation

0 references

A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations

0 references

Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients

0 references

User-friendly tail bounds for sums of random matrices

0 references

Compressive sensing adaptation for polynomial chaos expansions

0 references

On Sparse Interpolation and the Design of Deterministic Interpolation Points

0 references

STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION

0 references

Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation

0 references

Reweighted $\ell_1$ minimization method for stochastic elliptic differential equations

0 references

Enhancing sparsity of Hermite polynomial expansions by iterative rotations

0 references

Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification

0 references

A GENERAL FRAMEWORK FOR ENHANCING SPARSITY OF GENERALIZED POLYNOMIAL CHAOS EXPANSIONS

0 references

An Efficient Sampling Method for Regression-Based Polynomial Chaos Expansion

0 references

Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid

0 references

Weighted discrete least-squares polynomial approximation using randomized quadratures

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-00832-0_2

0 references

title

Towards Optimal Sampling for Learning Sparse Approximations in High Dimensions (English)

0 references

Identifiers

arXiv ID

2202.02360

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH Open document ID

1527.62004

0 references

DOI

10.1007/978-3-031-00832-0_2

0 references

OpenAlex ID

W4289690434

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6390185