A sharp upper bound for sampling numbers in \(L_2\)
DOI10.1016/j.acha.2022.12.001OpenAlexW4311465473MaRDI QIDQ2677840
David Krieg, Matthieu Dolbeault, Mario Ullrich
Publication date: 6 January 2023
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.12621
rate of convergencerandom matricesleast squaresinformation-based complexityKadison-Singer\( L_2\)-approximation
Random matrices (probabilistic aspects) (60B20) Probabilistic methods in Banach space theory (46B09) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary linear expressions (41A45)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tractability of multivariate problems for standard and linear information in the worst case setting. I.
- Coherent states, wavelets, and their generalizations
- Tractability of multivariate problems. Volume III: Standard information for operators
- On singular values of matrices with independent rows
- Approximation of mixed order Sobolev functions on the \(d\)-torus: asymptotics, preasymptotics, and \(d\)-dependence
- Linear information versus function evaluations for \(L_2\)-approximation
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- On the power of standard information for multivariate approximation in the worst case setting
- Explicit cost bounds of algorithms for multivariate tensor product problems
- The Marcinkiewicz-type discretization theorems
- Tensor power sequences and the approximation of tensor product operators
- The discretization problem for continuous frames
- Optimal Monte Carlo methods for \(L^2\)-approximation
- Function values are enough for \(L_2\)-approximation. II
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- Lower bounds for the error of quadrature formulas for Hilbert spaces
- On optimal recovery in \(L_2\)
- Optimal pointwise sampling for \(L^2\) approximation
- \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace
- Approximation of functions with small mixed smoothness in the uniform norm
- On the power of standard information for tractability for \(L_2\)-approximation in the average case setting
- Sampling discretization and related problems
- A new upper bound for sampling numbers
- Lower bounds for integration and recovery in \(L_2\)
- On sampling discretization in \(L_2\)
- A variant of Schur's product theorem and its applications
- On the worst-case error of least squares algorithms for \(L_2\)-approximation with high probability
- Function values are enough for \(L_2\)-approximation
- Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness
- Worst-case recovery guarantees for least squares approximation using random samples
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- A few remarks on sampling of signals with small spectrum
- On the mathematical foundations of learning
- 4. On the power of random information
- The power of standard information for multivariate approximation in the randomized setting
- Exponential frames on unbounded sets
- Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time
- Multivariate Approximation
- High-Dimensional Statistics
- ON A WAY OF OBTAINING LOWER ESTIMATES FOR THE ERRORS OF QUADRATURE FORMULAS
- Continuous Frames and the Kadison-Singer Problem
- Optimal weighted least-squares methods
- Random sections of ellipsoids and the power of random information
- Recovery of Sobolev functions restricted to iid sampling
- Twice-Ramanujan Sparsifiers
- An introduction to frames and Riesz bases
- On the power of standard information for weighted approximation
This page was built for publication: A sharp upper bound for sampling numbers in \(L_2\)