Optimal nonlinear sampling recovery of mixed-smoothness classes H^r_q is at least c m^{-r+1/q-1/p} (log m)^{(d-1)/p}, a logarithmic factor not captured by previous lower-bound techniques.
Bounds for the sampling discretization error and their applications to the universal sampling discretization
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In the first part of the paper we study absolute error of sampling discretization of the integral $L_p$-norm for function classes of continuous functions. We use basic approaches from chaining technique to provide general upper bounds for the error of sampling discretization of the $L_p$-norm on a given function class in terms of entropy numbers in the uniform norm of this class. As an example we apply these general results to obtain new error bounds for sampling discretization of the $L_p$-norms on classes of multivariate functions with mixed smoothness. In the second part of the paper we apply our general bounds to study the problem of universal sampling discretization.
citation-role summary
citation-polarity summary
fields
math.NA 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Some lower bounds for optimal sampling recovery of functions with mixed smoothness
Optimal nonlinear sampling recovery of mixed-smoothness classes H^r_q is at least c m^{-r+1/q-1/p} (log m)^{(d-1)/p}, a logarithmic factor not captured by previous lower-bound techniques.