On the power of standard information for L_ approximation in the randomized setting
\(L_\infty\) approximationapproximation powerrandomized settingreproducing kernel Hilbert spacesstandard informationworst case setting
Multidimensional problems (41A63) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Monte Carlo methods (65C05) Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20)
Approximations from reproducing kernel Hilbert spaces are important in theory and practice, because these spaces provide vast and useful choices of approximating functions. In this paper, the approximation power from the spaces is studied in various cases. The cases include standard information consisting of function values of the approximand or alternatively of general linear information which means general linear functionals applied to the approximand. The different cases of approximation power are compared for the randomized setting and for the worst case setting. The approximations are always such that the error is measured in the Chebychev-norm.
- scientific article; zbMATH DE number 2161076
- The power of standard information for multivariate approximation in the randomized setting
- On the power of standard information for \(\mathbb{L}_2\)-approximation in the average case setting
- On the power of standard information for tractability for \(L_2\)-approximation in the average case setting
- On the power of standard information for multivariate approximation in the worst case setting
- On the power of standard information for weighted approximation
- Complexity of approximating Hölder classes from information with varying Gaussian noise
- On the minimal cost of approximating linear problems based on information with deterministic noise
- Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
- On Lower Bounds for Nonstandard Deterministic Estimation
- Average-case analysis of numerical problems
- Deterministic and stochastic error bounds in numerical analysis
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 50734 (Why is no real title available?)
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- Integration and approximation in arbitrary dimensions
- Linear information versus function evaluations for L₂-approximation
- Lower bounds for the complexity of Monte Carlo function approximation
- Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces
- Noisy Information and Computational Complexity
- On the Optimal Solution of Large Linear Systems
- On the power of standard information for multivariate approximation in the worst case setting
- Optimal linear randomized methods for linear operators in Hilbert spaces
- Random approximation of Sobolev embeddings
- Randomization for continuous problems
- The power of standard information for multivariate approximation in the randomized setting
- Theory of Reproducing Kernels
- Tractability of multivariate problems. Volume I: Linear information
- On the power of standard information for multivariate approximation in the worst case setting
- On the power of standard information for tractability for \(L_2\)-approximation in the average case setting
- The power of standard information for multivariate approximation in the randomized setting
- scientific article; zbMATH DE number 2161076 (Why is no real title available?)
- Approximation of additive random fields based on standard information: average case and probabilistic settings
- On the power of function values for the approximation problem in various settings
- Liberating the dimension for function approximation: standard information
- Lower bounds for the complexity of linear functionals in the randomized setting
- On the power of standard information for tractability for \(L_{\infty}\) approximation of periodic functions in the worst case setting
This page was built for publication: On the power of standard information for \(L_{\infty}\) approximation in the randomized setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035792)
