Universal $L_2$-approximation using median lattice algorithms
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909883935227904 |
|---|---|
| author | Pan, Zexin Goda, Takashi Kritzer, Peter |
| author_facet | Pan, Zexin Goda, Takashi Kritzer, Peter |
| contents | We study the problem of multivariate $L_2$-approximation of functions in a weighted Korobov space using a median lattice-based algorithm recently proposed by the authors. In the original work, the algorithm requires knowledge of the smoothness and weights of the Korobov space to construct the hyperbolic cross index set, where each coefficient is estimated via the median of approximations obtained from randomly shifted, randomly chosen rank-1 lattice rules. In this paper, we introduce a \emph{universal median lattice-based algorithm}, which eliminates the need for any prior information on smoothness and weights. Although the tractability property of the algorithm slightly deteriorates, we prove that, for individual functions in the Korobov space with arbitrary smoothness and (downward-closed) weights, it achieves an $L_2$-approximation error arbitrarily close to the optimal rate with respect to the number of function evaluations. Numerical experiments are conducted to support our theoretical claim. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_24582 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Universal $L_2$-approximation using median lattice algorithms Pan, Zexin Goda, Takashi Kritzer, Peter Numerical Analysis We study the problem of multivariate $L_2$-approximation of functions in a weighted Korobov space using a median lattice-based algorithm recently proposed by the authors. In the original work, the algorithm requires knowledge of the smoothness and weights of the Korobov space to construct the hyperbolic cross index set, where each coefficient is estimated via the median of approximations obtained from randomly shifted, randomly chosen rank-1 lattice rules. In this paper, we introduce a \emph{universal median lattice-based algorithm}, which eliminates the need for any prior information on smoothness and weights. Although the tractability property of the algorithm slightly deteriorates, we prove that, for individual functions in the Korobov space with arbitrary smoothness and (downward-closed) weights, it achieves an $L_2$-approximation error arbitrarily close to the optimal rate with respect to the number of function evaluations. Numerical experiments are conducted to support our theoretical claim. |
| title | Universal $L_2$-approximation using median lattice algorithms |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2509.24582 |