Sampling discretization error of integral norms for function classes
From MaRDI portal
Publication:2274411
Cites work
- A distribution-free theory of nonparametric regression
- Approximation methods for supervised learning
- Entropy numbers, s-numbers, and eigenvalue problems
- Function spaces with dominating mixed smoothness
- Greedy approximation with regard to non-greedy bases
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1950575 (Why is no real title available?)
- scientific article; zbMATH DE number 1420699 (Why is no real title available?)
- Multivariate approximation
- Observations on discretization of trigonometric polynomials with given spectrum
- On the complexity of computing the \(L_q\) norm
- On the mathematical foundations of learning
- Some nonlinear problems are as easy as the approximation problem
- The entropy in learning theory. Error estimates
- The Marcinkiewicz-type discretization theorems
- The Marcinkiewicz-type discretization theorems for the hyperbolic cross
Cited in
(8)- Marcinkiewicz-type discretization of L^p-norms under the Nikolskii-type inequality assumption
- \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace
- Worst-case recovery guarantees for least squares approximation using random samples
- Sampling inequalities for infinitely smooth radial basis functions and its application to error estimates
- Discretization error of irregular sampling approximations of stochastic integrals
- Remarks on sampling discretization of integral norms of functions
- Sampling discretization error of integral norms for function classes with small smoothness
- Bounds for the sampling discretization error and their applications to the universal sampling discretization
This page was built for publication: Sampling discretization error of integral norms for function classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274411)
