Worst-case recovery guarantees for least squares approximation using random samples

From MaRDI portal
Publication:2243884


DOI10.1007/s00365-021-09555-0zbMath1484.41004arXiv1911.10111OpenAlexW3194792970MaRDI QIDQ2243884

Toni Volkmer, Tino Ullrich, Lutz Kämmerer

Publication date: 11 November 2021

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.10111



Related Items

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\), Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation, A Note on Sampling Recovery of Multivariate Functions in the Uniform Norm, Constructive subsampling of finite frames with applications in optimal function recovery, Spherical random sampling of localized functions on 𝕊ⁿ⁻¹, A sharp upper bound for sampling numbers in \(L_2\), Sampling numbers of smoothness classes via \(\ell^1\)-minimization, Random sampling of signals concentrated on compact set in localized reproducing kernel subspace of \(L^p (\mathbb{R}^n)\), Error guarantees for least squares approximation with noisy samples in domain adaptation, On the reconstruction of functions from values at subsampled quadrature points, Fast hyperbolic wavelet regression meets ANOVA, On the power of standard information for tractability for \(L_{\infty}\) approximation of periodic functions in the worst case setting, On the stability of unevenly spaced samples for interpolation and quadrature, Sampling discretization of the uniform norm, \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace, Generalized sparse grid interpolation based on the fast discrete Fourier transform, The uniform sparse FFT with application to PDEs with random coefficients


Uses Software


Cites Work