Infinite-Variate -Approximation with Nested Subspace Sampling
arXiv:2301.13177 · doi:10.1007/978-3-031-59762-6_16
Abstract
We consider -approximation on weighted reproducing kernel Hilbert spaces of functions depending on infinitely many variables. We focus on unrestricted linear information, admitting evaluations of arbitrary continuous linear functionals. We distinguish between ANOVA and non-ANOVA spaces, where, by ANOVA spaces, we refer to function spaces whose norms are induced by an underlying ANOVA function decomposition. In ANOVA spaces, we provide an optimal algorithm to solve the approximation problem using linear information. We determine the upper and lower error bounds on the polynomial convergence rate of -th minimal worst-case errors, which match if the weights decay regularly. For non-ANOVA spaces, we also establish upper and lower error bounds. Our analysis reveals that for weights with a regular and moderate decay behavior, the convergence rate of -th minimal errors is strictly higher in ANOVA than in non-ANOVA spaces.
arXiv commentTo appear in: A. Hinrichs, P. Kritzer, F. Pillichshammer (eds.). Monte Carlo and Quasi-Monte Carlo Methods 2022. Springer Verlag
References in corpus (6)
- Rate of Convergence and Tractability of the Radial Function Approximation Problem
- Optimal randomized multilevel algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- Infinite-Dimensional Integration in Weighted Hilbert Spaces: Anchored Decompositions, Optimal Deterministic Algorithms, and Higher Order Convergence
- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- Embeddings of Weighted Hilbert Spaces and Applications to Multivariate and Infinite-Dimensional Integration
- Embeddings for Infinite-Dimensional Integration and -Approximation with Increasing Smoothness