On the power of standard information for L_ approximation in the randomized setting

DOI10.1007/S10543-009-0232-1zbMATH Open1178.65013OpenAlexW2465623048MaRDI QIDQ1035792FDOQ1035792

Authors: F. Y. Kuo, Grzegorz W. Wasilkowski, H. Woźniakowski 

Publication date: 4 November 2009

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-009-0232-1

Recommendations

• 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

zbMATH Keywords

reproducing kernel Hilbert spacesworst case settingstandard informationrandomized settingapproximation power\(L_\infty\) approximation

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Complexity and performance of numerical algorithms (65Y20) Multidimensional problems (41A63) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Algorithms for approximation of functions (65D15)

Cites Work

• Theory of Reproducing Kernels
• Title not available (Why is that?)
• Title not available (Why is that?)
• Noisy Information and Computational Complexity
• On the power of standard information for multivariate approximation in the worst case setting
• Deterministic and stochastic error bounds in numerical analysis
• Average-case analysis of numerical problems
• The power of standard information for multivariate approximation in the randomized setting
• Linear information versus function evaluations for \(L_2\)-approximation
• Tractability of multivariate problems. Volume I: Linear information
• Integration and approximation in arbitrary dimensions
• On the Optimal Solution of Large Linear Systems
• Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces
• Title not available (Why is that?)
• Random approximation of Sobolev embeddings
• Randomization for continuous problems
• Lower bounds for the complexity of Monte Carlo function approximation
• Optimal linear randomized methods for linear operators in Hilbert spaces

Cited In (9)

• Title not available (Why is that?)
• Liberating the dimension for function approximation: standard information
• On the power of standard information for multivariate approximation in the worst case setting
• On the power of function values for the approximation problem in various settings
• 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
• Approximation of additive random fields based on standard information: average case and probabilistic settings
• The power of standard information for multivariate approximation in the randomized setting
• On the power of standard information for tractability for \(L_2\)-approximation in the average 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)