Optimal sampling for least-squares approximation
From MaRDI portal
Cites work
- A mathematical introduction to compressive sensing
- A new upper bound for sampling numbers
- A note on sampling recovery of multivariate functions in the uniform norm
- A sharp upper bound for sampling numbers in \(L_2\)
- A statistical perspective on algorithmic leveraging
- A universal sampling method for reconstructing signals with simple Fourier transforms
- Adaptive approximation by optimal weighted least-squares methods
- Adaptive polynomial approximation by means of random discrete least squares
- Analysis of discrete L^2 projection on polynomial spaces with random evaluations
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Approximation of high-dimensional parametric PDEs
- Approximation of quantities of interest in stochastic PDEs by the random discrete L^2 projection on polynomial spaces
- Boosted optimal weighted least-squares
- CAS4DL: Christoffel adaptive sampling for function approximation via deep learning
- Christoffel functions and Fourier series for multivariate orthogonal polynomials
- Christoffel functions on planar domains with piecewise smooth boundary
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Compressive imaging: structure, sampling, learning. With contributions by Vegard Antun
- Computation of induced orthogonal polynomial distributions
- Constructing least-squares polynomial approximations
- Constructing linear-sized spectral sparsification in almost-linear time
- Constructive subsampling of finite frames with applications in optimal function recovery
- Convergence bounds for empirical nonlinear least-squares
- Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points
- Derivative-informed neural operator: an efficient framework for high-dimensional parametric derivative learning
- Derivative-informed projected neural networks for high-dimensional parametric maps governed by PDEs
- Determinantal point processes for machine learning
- Dimension-adaptive tensor-product quadrature
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Entropy numbers and Marcinkiewicz-type discretization
- Exponential frames on unbounded sets
- Fast and stable approximation of analytic functions from equispaced samples via polynomial frames
- Fast approximation of matrix coherence and statistical leverage
- Frames and numerical approximation
- Frames and numerical approximation. II: Generalized sampling
- Function recovery on manifolds using scattered data
- Function values are enough for \(L_2\)-approximation
- Function values are enough for \(L_2\)-approximation. II
- Fundamental Performance Limits for Ideal Decoders in High-Dimensional Linear Inverse Problems
- Gauss and the invention of least squares
- Gradient-enhanced physics-informed neural networks for forward and inverse PDE problems
- Greedy approximation
- Géza Freud, orthogonal polynomials and Christoffel functions. A case study
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- scientific article; zbMATH DE number 2107939 (Why is no real title available?)
- scientific article; zbMATH DE number 836627 (Why is no real title available?)
- scientific article; zbMATH DE number 2208228 (Why is no real title available?)
- Impossibility of fast stable approximation of analytic functions from equispaced samples
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Interpolation via weighted \(\ell_{1}\) minimization
- Least squares polynomial chaos expansion: a review of sampling strategies
- Matrix approximation and projective clustering via volume sampling
- Model-Based Compressive Sensing
- Multivariate approximation of functions on irregular domains by weighted least-squares methods
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- Near-optimal approximation methods for elliptic PDEs with lognormal coefficients
- Near-optimal sampling strategies for multivariate function approximation on general domains
- Nyström landmark sampling and regularized Christoffel functions
- On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification
- On minimal trajectories for mobile sampling of bandlimited fields
- On Nikol'skii inequalities for domains in \({\mathbb {R}}^d\)
- On optimal recovery in L₂
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- On sampling discretization in \(L_2\)
- On the reconstruction of functions from values at subsampled quadrature points
- On the stability and accuracy of least squares approximations
- Optimal approximation of infinite-dimensional holomorphic functions
- Optimal approximation of infinite-dimensional holomorphic functions. II: Recovery from i.i.d. pointwise samples
- Optimal Monte Carlo methods for \(L^2\)-approximation
- Optimal pointwise sampling for \(L^2\) approximation
- Optimal sampling and Christoffel functions on general domains
- Optimal sampling rates for approximating analytic functions from pointwise samples
- Optimal weighted least-squares methods
- Option pricing with orthogonal polynomial expansions
- Orthogonal polynomials of several variables
- Polynomial interpolation of function averages on interval segments
- Random periodic sampling patterns for shift-invariant spaces
- Random points are optimal for the approximation of Sobolev functions
- Randomized Algorithms for Matrices and Data
- Randomized least-squares with minimal oversampling and interpolation in general spaces
- Randomized numerical linear algebra: Foundations and algorithms
- Randomized weakly admissible meshes
- Recovery of Sobolev functions restricted to iid sampling
- Resolution of Singularities by Rational Functions
- Sampling discretization and related problems
- Sampling discretization of integral norms
- Sampling projections in the uniform norm
- Sampling, Marcinkiewicz-Zygmund inequalities, approximation, and quadrature rules
- Sequential sampling for optimal weighted least squares approximations in hierarchical spaces
- Sigmoid functions, multiscale resolution of singularities, and hp-mesh refinement
- Sketching as a tool for numerical linear algebra
- Sparse Polynomial Approximation of High-Dimensional Functions
- Stable approximation of Helmholtz solutions in the disk by evanescent plane waves
- Stable high-order randomized cubature formulae in arbitrary dimension
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Stochastic collocation on unstructured multivariate meshes
- Stochastic finite element: a non intrusive approach by regression
- Structured Compressed Sensing: From Theory to Applications
- The AAA algorithm for rational approximation
- The Christoffel-Darboux kernel for data analysis
- The estimation of functional uncertainty using polynomial chaos and adjoint equations
- The Kadison-Singer problem in discrepancy theory.
- The Marcinkiewicz-type discretization theorems
- The power of standard information for multivariate approximation in the randomized setting
- Towards optimal sampling for learning sparse approximation in high dimensions
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- Twice-Ramanujan sparsifiers
- Universal sampling discretization
- User-friendly tail bounds for sums of random matrices
- Weighted least-squares approximation with determinantal point processes and generalized volume sampling
Cited in
(2)
This page was built for publication: Optimal sampling for least-squares approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880488)
