Dimension-independent convergence rates of randomized nets using median-of-means
Mathematics of Computation · 14.05.2026
DOI: 10.1090/mcom/4208 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics of Computation, online erschienen am 14.05.2026. Verfasst von Zexin Pan. Die Arbeit nennt 44 Literaturangaben. Gefördert von: Austrian Science Fund.
Abstract (Originalsprache)
Recent advances in quasi-Monte Carlo integration demonstrate that the median of linearly scrambled digital net estimators achieves near-optimal convergence rates for high-dimensional integrals without requiring a priori knowledge of the integrand’s smoothness. Building on this framework, we prove that the median estimator attains dimension-independent convergence, a property known as strong tractability in complexity theory, under tractability conditions characterized by low effective dimensionality. Using a probabilistic, integrand-specific error criterion, our analysis establishes both faster and dimension-independent convergence under weaker assumptions than previously possible in the worst-case setting.
Förderung
- Austrian Science Fund
Zitieren
APA
Pan, Z. (2026). Dimension-independent convergence rates of randomized nets using median-of-means. Mathematics of Computation. https://doi.org/10.1090/mcom/4208
Vancouver
Pan Z. Dimension-independent convergence rates of randomized nets using median-of-means. Mathematics of Computation. 2026. doi:10.1090/mcom/4208
BibTeX
@article{Pan2026,
author = {Pan, Zexin},
title = {Dimension-independent convergence rates of randomized nets using median-of-means},
journal = {Mathematics of Computation},
year = {2026},
doi = {10.1090/mcom/4208}
}
EUVIMED