Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Minimax Number of Strata for Online Stratified Sampling given Noisy Samples

Alexandra Carpentier 1 Rémi Munos 1
1 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
Abstract : We consider the problem of online stratified sampling for Monte Carlo integration of a function given a finite budget of $n$ noisy evaluations to the function. More precisely we focus on the problem of choosing the number of strata $K$ as a function of the budget $n$. We provide asymptotic and finite-time results on how an oracle that has access to the function would choose the partition optimally. In addition we prove a \textit{lower bound} on the learning rate for the problem of stratified Monte-Carlo. As a result, we are able to state, by improving the bound on its performance, that algorithm MC-UCB, defined in~\citep{MC-UCB}, is minimax optimal both in terms of the number of samples n and the number of strata K, up to a $\sqrt{\log(nK)}$. This enables to deduce a minimax optimal bound on the difference between the performance of the estimate outputted by MC-UCB, and the performance of the estimate outputted by the best oracle static strategy, on the class of Hölder continuous functions, and upt to a $\sqrt{\log(n)}$.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download
Contributor : Alexandra Carpentier <>
Submitted on : Wednesday, May 16, 2012 - 4:20:00 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Document(s) archivé(s) le : Thursday, December 15, 2016 - 8:13:59 AM


Files produced by the author(s)


  • HAL Id : hal-00698517, version 1
  • ARXIV : 1205.4095



Alexandra Carpentier, Rémi Munos. Minimax Number of Strata for Online Stratified Sampling given Noisy Samples. 2012. ⟨hal-00698517⟩



Record views


Files downloads