Stochastic Simultaneous Optimistic Optimization

Michal Valko 1 Alexandra Carpentier 1, 2 Rémi Munos 1
1 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal, Inria Lille - Nord Europe
Abstract : We study the problem of global maximization of a function f given a finite number of evaluations perturbed by noise. We consider a very weak assumption on the function, namely that it is locally smooth (in some precise sense) with respect to some semi-metric, around one of its global maxima. Compared to previous works on bandits in general spaces (Kleinberg et al., 2008; Bubeck et al., 2011a) our algorithm does not require the knowledge of this semi-metric. Our algorithm, StoSOO, follows an optimistic strategy to iteratively construct upper confidence bounds over the hierarchical partitions of the function domain to decide which point to sample next. A finite-time analysis of StoSOO shows that it performs almost as well as the best specifically-tuned algorithms even though the local smoothness of the function is not known.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-00789606
Contributor : Michal Valko <>
Submitted on : Thursday, May 30, 2013 - 4:13:59 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on : Tuesday, September 3, 2013 - 10:15:22 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00789606, version 2

Citation

Michal Valko, Alexandra Carpentier, Rémi Munos. Stochastic Simultaneous Optimistic Optimization. International Conference on Machine Learning, Jun 2013, Atlanta, United States. ⟨hal-00789606v2⟩

Share

Metrics

Record views

991

Files downloads

461