Towards optimal sampling for learning sparse approximation in high dimensions

DOI10.1007/978-3-031-00832-0_2zbMath1527.62004arXiv2202.02360OpenAlexW4289690434MaRDI QIDQ6390185

Sebastián Moraga, Nick C. Dexter, Ben Adcock, Juan M. Cardenas

Publication date: 4 February 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-00832-0_2

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Computational aspects of data analysis and big data (68T09)

Cites Work

• 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
• On the stability and accuracy of least squares approximations
• High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
• Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
• 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
• Adaptive sparse polynomial chaos expansion based on least angle regression
• User-friendly tail bounds for sums of random matrices
• Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
• Enhancing sparsity of Hermite polynomial expansions by iterative rotations
• Interpolation via weighted \(\ell_{1}\) minimization
• Infinite-dimensional compressed sensing and function interpolation
• Computation of induced orthogonal polynomial distributions
• Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
• Numerical Fourier analysis
• Sparse polynomial chaos expansions via compressed sensing and D-optimal design
• Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
• 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
• Optimal pointwise sampling for \(L^2\) approximation
• Sparse approximation of multivariate functions from small datasets via weighted orthogonal matching pursuit
• Optimal sampling and Christoffel functions on general domains
• Polynomial chaos expansions for dependent random variables
• 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 sensing adaptation for polynomial chaos expansions
• Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
• Least squares polynomial chaos expansion: a review of sampling strategies
• Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
• Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
• Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
• Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
• Weighted discrete least-squares polynomial approximation using randomized quadratures
• On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
• Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients
• A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
• Correcting for unknown errors in sparse high-dimensional function approximation
• Basis adaptive sample efficient polynomial chaos (BASE-PC)
• A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
• Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression
• Correcting Data Corruption Errors for Multivariate Function Approximation
• Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
• Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs
• On the convergence of generalized polynomial chaos expansions
• REGULARITY AND GENERALIZED POLYNOMIAL CHAOS APPROXIMATION OF PARAMETRIC AND RANDOM SECOND-ORDER HYPERBOLIC PARTIAL DIFFERENTIAL EQUATIONS
• Handbook of Uncertainty Quantification
• Subsampled Gauss Quadrature Nodes for Estimating Polynomial Chaos Expansions
• On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification
• Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid
• Introduction to Uncertainty Quantification
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation
• Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures
• A Christoffel function weighted least squares algorithm for collocation approximations
• Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison
• ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
• Sparse Recovery via ℓ_q-Minimization for Polynomial Chaos Expansions
• Spectral Methods for Uncertainty Quantification
• Multivariate Approximation
• A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
• An Efficient Sampling Method for Regression-Based Polynomial Chaos Expansion
• Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
• Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations
• Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification
• Multivariate Approximation in Downward Closed Polynomial Spaces
• Sequential Design of Experiment for Sparse Polynomial Chaos Expansions
• Physical Systems with Random Uncertainties: Chaos Representations with Arbitrary Probability Measure
• Optimal weighted least-squares methods
• Compressive Imaging: Structure, Sampling, Learning
• Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
• Sequential Sampling for Optimal Weighted Least Squares Approximations in Hierarchical Spaces
• Near-Optimal Sampling Strategies for Multivariate Function Approximation on General Domains
• A GENERAL FRAMEWORK FOR ENHANCING SPARSITY OF GENERALIZED POLYNOMIAL CHAOS EXPANSIONS
• Boosted optimal weighted least-squares
• Sparse Polynomial Approximation of High-Dimensional Functions
• Multivariate approximation of functions on irregular domains by weighted least-squares methods
• APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
• Constructing Least-Squares Polynomial Approximations
• A mixed ℓ₁ regularization approach for sparse simultaneous approximation of parameterized PDEs
• Adaptive Approximation by Optimal Weighted Least-Squares Methods
• Approximation of high-dimensional parametric PDEs
• Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
• A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
• Stochastic Collocation vial₁-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
• Stochastic Collocation on Unstructured Multivariate Meshes
• STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
• An introduction to frames and Riesz bases

This page was built for publication: Towards optimal sampling for learning sparse approximation in high dimensions