Adaptive and non-adaptive randomized approximation of high-dimensional vectors

DOI10.1016/J.JAT.2026.106318MaRDI QIDQ7288066zbMATH OpenFDO

Authors Robert J. Kunsch, M. Wnuk

Publication date 26 June 2026

Published in Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JAT.2026.106318

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Algorithms for approximation of functions (65D15)

Cites work

• Compressed sensing and best \(k\)-term approximation
• Finding frequent items in data streams
• Fixed Precision MCMC Estimation by Median of Products of Averages
• Homogeneous algorithms and solvable problems on cones
• scientific article; zbMATH DE number 3944477 (Why is no real title available?)
• scientific article; zbMATH DE number 3464269 (Why is no real title available?)
• Lower bounds for the complexity of Monte Carlo function approximation
• On low-risk heavy hitters and sparse recovery schemes
• On the existence of unbiased Monte Carlo estimators
• On the power of adaption
• On the power of adaption and randomization
• On the Power of Adaptivity in Sparse Recovery
• Random approximation of Sobolev embeddings
• Randomized approximation of summable sequences -- adaptive and non-adaptive
• Randomized complexity of mean computation and the adaption problem
• 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
• Randomized complexity of vector-valued approximation
• Solvable integration problems and optimal sample size selection
• Uniform approximation of vectors using adaptive randomized information

This page was built for publication: Adaptive and non-adaptive randomized approximation of high-dimensional vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288066)