Empirical Bernstein and betting confidence intervals for randomized quasi-Monte Carlo
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911415210606592 |
|---|---|
| author | Jain, Aadit Hickernell, Fred J. Owen, Art B. Sorokin, Aleksei G. |
| author_facet | Jain, Aadit Hickernell, Fred J. Owen, Art B. Sorokin, Aleksei G. |
| contents | Randomized quasi-Monte Carlo (RQMC) methods estimate the mean of a random variable by sampling an integrand at $n$ equidistributed points. For scrambled digital nets, the resulting variance is typically $\tilde O(n^{-θ})$ where $θ\in[1,3]$ depends on the smoothness of the integrand and $\tilde O$ neglects logarithmic factors. While RQMC can be far more accurate than plain Monte Carlo (MC) it remains difficult to get confidence intervals on RQMC estimates. We investigate some empirical Bernstein confidence intervals (EBCI) and hedged betting confidence intervals (HBCI), both from Waudby-Smith and Ramdas (2024), when the random variable of interest is subject to known bounds. When there are $N$ integrand evaluations partitioned into $R$ independent replicates of $n=N/R$ RQMC points, and the RQMC variance is $Θ(n^{-θ})$, then an oracle minimizing the width of a Bennett confidence interval would choose $n =Θ(N^{1/(θ+1)})$. The resulting intervals have a width that is $Θ(N^{-θ/(θ+1)})$. Our empirical investigations had optimal values of $n$ grow slowly with $N$, HBCI intervals that were usually narrower than the EBCI ones, and optimal values of $n$ for HBCI that were equal to or smaller than the ones for the oracle. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_18677 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Empirical Bernstein and betting confidence intervals for randomized quasi-Monte Carlo Jain, Aadit Hickernell, Fred J. Owen, Art B. Sorokin, Aleksei G. Numerical Analysis Computation Randomized quasi-Monte Carlo (RQMC) methods estimate the mean of a random variable by sampling an integrand at $n$ equidistributed points. For scrambled digital nets, the resulting variance is typically $\tilde O(n^{-θ})$ where $θ\in[1,3]$ depends on the smoothness of the integrand and $\tilde O$ neglects logarithmic factors. While RQMC can be far more accurate than plain Monte Carlo (MC) it remains difficult to get confidence intervals on RQMC estimates. We investigate some empirical Bernstein confidence intervals (EBCI) and hedged betting confidence intervals (HBCI), both from Waudby-Smith and Ramdas (2024), when the random variable of interest is subject to known bounds. When there are $N$ integrand evaluations partitioned into $R$ independent replicates of $n=N/R$ RQMC points, and the RQMC variance is $Θ(n^{-θ})$, then an oracle minimizing the width of a Bennett confidence interval would choose $n =Θ(N^{1/(θ+1)})$. The resulting intervals have a width that is $Θ(N^{-θ/(θ+1)})$. Our empirical investigations had optimal values of $n$ grow slowly with $N$, HBCI intervals that were usually narrower than the EBCI ones, and optimal values of $n$ for HBCI that were equal to or smaller than the ones for the oracle. |
| title | Empirical Bernstein and betting confidence intervals for randomized quasi-Monte Carlo |
| topic | Numerical Analysis Computation |
| url | https://arxiv.org/abs/2504.18677 |