Abstract
Abstract
It is known that results on universal sampling discretization of the square norm are useful in sparse sampling recovery with error measured in the square norm. In this paper we demonstrate how known results on universal sampling discretization of the uniform norm and recent results on universal sampling representation allow us to provide good universal methods of sampling recovery for anisotropic Sobolev and Nikol’skii classes of periodic functions of several variables. The sharpest results are obtained in the case of functions of two variables, where the Fibonacci point sets are used for recovery.
Reference18 articles.
1. P. Binev, A. Cohen, W. Dahmen, R. DeVore, and V. Temlyakov, “Universal algorithms for learning theory. I: Piecewise constant functions,” J. Mach. Learn. Res. 6, 1297–1321 (2005).
2. F. Dai, A. Prymak, V. N. Temlyakov, and S. Yu. Tikhonov, “Integral norm discretization and related problems,” Russ. Math. Surv. 74 (4), 579–630 (2019) [transl. from Usp. Mat. Nauk 74 (4), 3–58 (2019)].
3. F. Dai and V. Temlyakov, “Universal sampling discretization,” Constr. Approx. 58 (3), 589–613 (2023); arXiv: 2107.11476v1 [math.FA].
4. F. Dai and V. Temlyakov, “Universal discretization and sparse sampling recovery,” arXiv: 2301.05962v1 [math.NA].
5. F. Dai and V. Temlyakov, “Random points are good for universal discretization,” J. Math. Anal. Appl. 529 (1), 127570 (2024); arXiv: 2301.12536v1 [math.FA].
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献