Multi-armed bandits with episode context
From MaRDI portal
Publication:766259
DOI10.1007/s10472-011-9258-6zbMath1234.68171OpenAlexW1977989560WikidataQ104573352 ScholiaQ104573352MaRDI QIDQ766259
Publication date: 23 March 2012
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-011-9258-6
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
An analysis for strength improvement of an MCTS-based program playing Chinese dark chess, LinUCB applied to Monte Carlo tree search, Multi-armed bandits with episode context
Cites Work
- Unnamed Item
- Unnamed Item
- Multi-armed bandits with episode context
- Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
- A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
- Pure Exploration in Multi-armed Bandits Problems
- The Nonstochastic Multiarmed Bandit Problem
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
- Computer Go: An AI oriented survey
- Finite-time analysis of the multiarmed bandit problem