RQMC estimation of CVaR sensitivity is strongly consistent and reaches mean error O(n^{-1/2-1/(4d-2)+epsilon}) under technical conditions.
A strong law of large numbers for scrambled net integration
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
This article provides a strong law of large numbers for integration on digital nets randomized by a nested uniform scramble. The motivating problem is optimization over some variables of an integral over others, arising in Bayesian optimization. This strong law requires that the integrand have a finite moment of order $p$ for some $p>1$. Previously known results implied a strong law only for Riemann integrable functions. Previous general weak laws of large numbers for scrambled nets require a square integrable integrand. We generalize from $L^2$ to $L^p$ for $p>1$ via the Riesz-Thorin interpolation theorem
fields
math.NA 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sensitivity estimation of conditional value at risk using randomized quasi-Monte Carlo
RQMC estimation of CVaR sensitivity is strongly consistent and reaches mean error O(n^{-1/2-1/(4d-2)+epsilon}) under technical conditions.