Adaptive algorithms in sampling recovery
Dinh D\~ung

TL;DR
This paper investigates optimal adaptive sampling algorithms for recovering smooth functions on a unit cube, establishing their asymptotic error decay rate and linking it to best n-term approximation and nonlinear widths.
Contribution
It introduces a framework for adaptive sampling recovery of smooth functions, deriving the asymptotic order of the minimal recovery error and connecting it to nonlinear approximation measures.
Findings
Asymptotic error decay rate is proportional to n^{-α/d}.
Established the equivalence of recovery error with nonlinear n-widths.
Provided bounds linking adaptive sampling to best n-term approximation.
Abstract
We study optimal algorithms in adaptive sampling recovery of smooth functions defined on the unit -cube . The recovery error is measured in the quasi-norm of . For a subset in we define a sampling algorithm of recovery with the free choice of sample points and recovering functions from as follows. For each from the quasi-normed Besov space , we choose sample points. This choice defines sampled values. Based on these sample points and sampled values, we choose a function from for recovering . The choice of sample points and a recovering function from for each defines a -sampling algorithm by functions in . If is a family of elements in , let be the non-linear set of linear…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Reservoir Engineering and Simulation Methods · Image and Object Detection Techniques
