EUVIMEDEUVIMED entdecken
Crossref

Automatic optimal-rate convergence of randomized nets using median-of-means

Zexin Pan

Mathematics of Computation · 16.04.2025 · 95 (359) · 1415-1446

DOI: 10.1090/mcom/4093 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics of Computation, online erschienen am 16.04.2025. Verfasst von Zexin Pan. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 30 Literaturangaben. Gefördert von: Austrian Science Fund.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study the sample median of independently generated quasi-Monte Carlo estimators based on randomized digital nets and prove it approximates the target integral value at almost the optimal convergence rate for various function spaces. In contrast to previous methods, the algorithm does not require a priori knowledge of underlying function spaces or even an input of pre-designed ( t , m , s ) (t,m,s) -digital nets, and is therefore easier to implement. This study provides further evidence that some types of randomized quasi-Monte Carlo estimators are heavy-tailed when applied to smooth integrands and taking the median can significantly improve the error by filtering out the outliers.

Förderung

  • Austrian Science Fund

Zitieren

APA

Pan, Z. (2025). Automatic optimal-rate convergence of randomized nets using median-of-means. Mathematics of Computation, 95(359), 1415-1446. https://doi.org/10.1090/mcom/4093

Vancouver

Pan Z. Automatic optimal-rate convergence of randomized nets using median-of-means. Mathematics of Computation. 2025;95(359):1415-1446. doi:10.1090/mcom/4093

BibTeX
@article{Pan2025,
  author = {Pan, Zexin},
  title = {Automatic optimal-rate convergence of randomized nets using median-of-means},
  journal = {Mathematics of Computation},
  year = {2025},
  volume = {95},
  number = {359},
  pages = {1415--1446},
  doi = {10.1090/mcom/4093}
}
Kostenlos starten →