On the information complexity for integration in subspaces of the Wiener algebra

DOI10.1016/J.JCO.2023.101819MaRDI QIDQ6154552zbMATH OpenOpenAlexFDO

Authors

Publication date 15 February 2024

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jco.2023.101819

zbMATH Keywords

Monte Carlonumerical integrationFourier seriesRademacher complexity

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical integration (65D30) Multidimensional problems (41A63) Numerical approximation of high-dimensional functions; sparse grids (65D40)

Recommendations

• Information complexity of Monte Carlo integration in Sobolev classes with mixed derivative
• Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure
• Integration and approximation of multivariate functions: Average case complexity with isotropic Wiener measure
• The information-based complexity of approximation problem by adaptive Monte Carlo methods
• A lower bound on complexity of optimization on the Wiener space

Cites work

• scientific article; zbMATH DE number 1552503 (Why is no real title available?)
• scientific article; zbMATH DE number 3310221 (Why is no real title available?)
• Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration
• High-dimensional statistics. A non-asymptotic viewpoint
• Lattice Rules
• New lower bounds for the integration of periodic functions
• Numerical integration of Hölder continuous, absolutely convergent Fourier, Fourier cosine, and Walsh series
• Polynomial tractability for integration in an unweighted function space with absolutely convergent Fourier series
• Sampling numbers of smoothness classes via \(\ell^1\)-minimization
• The inverse of the star-discrepancy depends linearly on the dimension
• Tractability of multivariate problems. Volume I: Linear information
• Tractability of multivariate problems. Volume II: Standard information for functionals.
• Tractability of multivariate problems. Volume III: Standard information for operators
• Understanding machine learning. From theory to algorithms

Cited in

(1)

• Tractability of sampling recovery on unweighted function classes

This page was built for publication: On the information complexity for integration in subspaces of the Wiener algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154552)