inria-00369787, version 1
Upper Confidence Trees and Billiards for Optimal Active Learning
Philippe Rolet
1, 2Michèle Sebag
1, 2Olivier Teytaud
1, 2
CAP09 (2009)
Abstract: This paper focuses on Active Learning (AL) with bounded compu- tational resources. AL is formalized as a finite horizon Reinforcement Learning problem, and tackled as a single-player game. An approximate optimal AL strat- egy based on tree-structured multi-armed bandit algorithms and billiard-based sampling is presented together with a proof of principle of the approach.
- 1: Laboratoire de Recherche en Informatique (LRI)
- CNRS : UMR8623 – Université Paris XI - Paris Sud
- 2: TAO (INRIA Saclay - Ile de France)
- INRIA – CNRS : UMR8623 – Université Paris XI - Paris Sud
- Domain : Mathematics/Optimization and Control
- inria-00369787, version 1
- http://hal.inria.fr/inria-00369787
- oai:hal.inria.fr:inria-00369787
- From: Olivier Teytaud
- Submitted on: Saturday, 21 March 2009 09:58:28
- Updated on: Monday, 23 March 2009 14:51:47






Associated documents
Export