Randomized approximation of summable sequences -- adaptive and non-adaptive
From MaRDI portal
Publication:6632941
DOI10.1016/J.JAT.2024.106056MaRDI QIDQ6632941
Robert J. Kunsch, M. Wnuk, Erich Novak
Publication date: 5 November 2024
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Monte Carlo methods (65C05) Geometry and structure of normed linear spaces (46B20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A mathematical introduction to compressive sensing
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Linear vs. nonlinear algorithms for linear problems
- Tractability of multivariate problems. Volume I: Linear information
- Random approximation of Sobolev embeddings
- Lower bounds for the complexity of Monte Carlo function approximation
- A minimax principle for the optimal error of Monte Carlo methods
- On the approximate calculation of multiple integrals
- On the power of adaption
- Compressed sensing and best 𝑘-term approximation
- On Low-Risk Heavy Hitters and Sparse Recovery Schemes
- Lower Bounds for Sparse Recovery
- On the Power of Adaptivity in Sparse Recovery
- A universal non-compact operator
- Lower Bounds for Adaptive Sparse Recovery
- Probability theory. A comprehensive course
- Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case
- Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces
Related Items (1)
This page was built for publication: Randomized approximation of summable sequences -- adaptive and non-adaptive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632941)
