A note on sampling recovery of multivariate functions in the uniform norm

by   Kateryna Pozharska, et al.

We study the recovery of multivariate functions from reproducing kernel Hilbert spaces in the uniform norm. Our main interest is to obtain preasymptotic estimates for the corresponding sampling numbers. We obtain results in terms of the decay of related singular numbers of the compact embedding into L_2(D,ϱ_D) multiplied with the supremum of the Christoffel function of the subspace spanned by the first m singular functions. Here the measure ϱ_D is at our disposal. As an application we obtain near optimal upper bounds for the sampling numbers for periodic Sobolev type spaces with general smoothness weight. Those can be bounded in terms of the corresponding benchmark approximation number in the uniform norm, which allows for preasymptotic bounds. By applying a recently introduced sub-sampling technique related to Weaver's conjecture we mostly lose a √(log n) and sometimes even less. Finally we point out a relation to the corresponding Kolmogorov numbers.



There are no comments yet.


page 1

page 2

page 3

page 4


Lower bounds for integration and recovery in L_2

Function values are, in some sense, "almost as good" as general linear i...

Approximation of functions with small mixed smoothness in the uniform norm

In this paper we present results on asymptotic characteristics of multiv...

A sharp upper bound for sampling numbers in L_2

For a class F of complex-valued functions on a set D, we denote by g_n(F...

How anisotropic mixed smoothness affects the decay of singular numbers of Sobolev embeddings

We continue the research on the asymptotic and preasymptotic decay of si...

Multiple Lattice Rules for Multivariate L_∞ Approximation in the Worst-Case Setting

We develop a general framework for estimating the L_∞(T^d) error for the...

Exact uniform sampling over catalan structures

We present a new framework for creating elegant algorithms for exact uni...

Adversarial Laws of Large Numbers and Optimal Regret in Online Classification

Laws of large numbers guarantee that given a large enough sample from so...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.