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

From MaRDI portal
Revision as of 06:37, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (20)

On the power of standard information for tractability for \(L_2\)-approximation in the average case settingSampling discretization and related problemsA new upper bound for sampling numbersLower bounds for integration and recovery in \(L_2\)Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA ApproximationA Note on Sampling Recovery of Multivariate Functions in the Uniform NormConstructive subsampling of finite frames with applications in optimal function recoverySpherical random sampling of localized functions on 𝕊ⁿ⁻¹A sharp upper bound for sampling numbers in \(L_2\)Sampling numbers of smoothness classes via \(\ell^1\)-minimizationRandom 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 adaptationOn the reconstruction of functions from values at subsampled quadrature pointsFast hyperbolic wavelet regression meets ANOVAOn the power of standard information for tractability for \(L_{\infty}\) approximation of periodic functions in the worst case settingOn the stability of unevenly spaced samples for interpolation and quadratureSampling discretization of the uniform norm\(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite traceGeneralized sparse grid interpolation based on the fast discrete Fourier transformThe uniform sparse FFT with application to PDEs with random coefficients


Uses Software


Cites Work


This page was built for publication: Worst-case recovery guarantees for least squares approximation using random samples