Constructive subsampling of finite frames with applications in optimal function recovery
From MaRDI portal
Publication:6038824
DOI10.1016/j.acha.2023.02.004zbMath1528.41010arXiv2202.12625OpenAlexW4322621393MaRDI QIDQ6038824
No author found.
Publication date: 3 May 2023
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.12625
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Trigonometric approximation (42A10) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Multidimensional problems (41A63) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) Sampling theory in information and communication theory (94A20)
Related Items
Sampling numbers of smoothness classes via \(\ell^1\)-minimization ⋮ Error guarantees for least squares approximation with noisy samples in domain adaptation ⋮ On the reconstruction of functions from values at subsampled quadrature points
Cites Work
- Unnamed Item
- Mercer's theorem on general domains: on the interaction between measures, kernels, and RKHSs
- Finite frames. Theory and applications.
- On the stability of the hyperbolic cross discrete Fourier transform
- Auto-tuning unit norm frames
- User-friendly tail bounds for sums of random matrices
- The Kadison-Singer problem in discrepancy theory.
- Numerical Fourier analysis
- Equal-norm tight frames with erasures
- Function values are enough for \(L_2\)-approximation. II
- Entropy numbers and Marcinkiewicz-type discretization
- On optimal recovery in \(L_2\)
- \(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 sampling discretization in \(L_2\)
- 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
- Exponential frames on unbounded sets
- Sampling from large matrices
- A Singular Value Decomposition Updating Algorithm for Subspace Tracking
- Optimal weighted least-squares methods
- Boosted optimal weighted least-squares
- A Note on Sampling Recovery of Multivariate Functions in the Uniform Norm
- Twice-ramanujan sparsifiers
- Pipage Rounding, Pessimistic Estimators and Matrix Concentration
- A Class of Nonharmonic Fourier Series
- Updating the singular value decomposition
- Graph Sparsification by Effective Resistances
