sign in
english version rss feed

inria-00369787, version 1

Upper Confidence Trees and Billiards for Optimal Active Learning

Philippe Rolet () 12, Michèle Sebag () 12, Olivier Teytaud () 12

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.

  • Domain : Mathematics/Optimization and Control
 
  • inria-00369787, version 1
  • oai:hal.inria.fr:inria-00369787
  • From: 
  • Submitted on: Saturday, 21 March 2009 09:58:28
  • Updated on: Monday, 23 March 2009 14:51:47
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...