Research graph
References from From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning. Local targets link to admitted publications; unresolved targets remain external evidence.
Improved algorithms for linear stochastic bandits
2011 · External reference
Online-to-confidence-set conversions and application to sparse stochastic bandits
2012 · External reference
Expected-outcome: A general model of static evaluation
10.1109/34.44404 · 1990 · External reference
Stochastic convex optimization with bandit feedback
2011 · External reference
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization
10.1109/tit.2011.2182178 · 2012 · External reference
The continuum-armed bandit problem
10.1137/s0363012992237273 · 1995 · External reference
Sample mean based index policies with O(log n) regret for the multi-armed bandit problem
10.2307/1427934 · 1995 · External reference
Analysis of Thompson sampling for the multi-armed bandit problem
2012 · External reference
Further optimal regret bounds for Thompson sampling
2013 · External reference
Learning is planning: near Bayes-optimal reinforcement learning via Monte-Carlo tree search
2011 · External reference
Exploration-exploitation trade-off using variance estimates in multi-armed bandits
10.1016/j.tcs.2009.01.016 · 2009 · External reference
Best arm identification in multi-armed bandits
2010 · External reference
Minimax policies for adversarial and stochastic bandits
2009 · External reference
Improved rates for the stochastic continuum-armed bandit problem
10.1007/978-3-540-72927-3_33 · 2007 · External reference
Using confidence bounds for exploitation-exploration trade-offs
2003 · External reference
Finite time analysis of the multiarmed bandit problem
10.1023/a:1013689704352 · 2002 · External reference
The nonstochastic multiarmed bandit problem
10.1137/s0097539701398375 · 2003 · External reference
Theory of Randomized Search Heuristics: Foundations and Recent Developments
2011 · External reference
Weighted sums of certain dependent random variables
10.2748/tmj/1178243286 · 1967 · External reference
Denumerable-armed bandits
10.2307/2951539 · 1992 · External reference
Markov Decision Processes with Applications to Finance
10.1007/978-3-642-18324-9 · 2011 · External reference
Bandit problems with infinitely many arms
10.1214/aos/1069362389 · 1997 · External reference
Neuro-Dynamic Programming
1996 · External reference
Scalability and parallelization of monte-carlo tree search
2012 · External reference
Monte-Carlo go developments
2003 · External reference
Computer Go: an AI oriented survey
10.1016/s0004-3702(01)00127-8 · 2001 · External reference
A survey of monte carlo tree search methods
10.1109/tciaig.2012.2186810 · 2012 · External reference
Monte Carlo Go
1993 · External reference
Open loop optimistic planning
2010 · External reference
Online optimization of X-armed bandits
2008 · External reference
Pure exploration in multi-armed bandits problems
2009 · External reference
X-armed bandits
2011 · External reference
Lipschitz bandits without the Lipschitz constant
2011 · External reference
Bandits Games and Clustering Foundations
2010 · External reference
10.1561/2200000024 · 2012 · Admitted local publication
Optimistic planning in Markov decision processes
2011 · External reference
Optimistic planning for markov decision processes
2012 · External reference
Reinforcement Learning and Dynamic Programming Using Function Approximators
2010 · External reference
Optimistic planning for sparsely stochastic systems
10.1109/adprl.2011.5967375 · 2011 · External reference
Adaptive-treed bandits
2013 · External reference
Optimal adaptive policies for sequential allocation problems
10.1006/aama.1996.0007 · 1996 · External reference
Optimal adaptive policies for sequential allocation problems
10.1006/aama.1996.0007 · 1996 · External reference
Model Predictive Control
2004 · External reference
Kullback-leibler upper confidence bounds for optimal sequential allocation
10.1214/13-aos1119 · 2013 · External reference
Bandit theory meets compressed sensing for high dimensional stochastic linear bandit
2012 · External reference
Prediction, Learning, and Games
2006 · External reference
Simulation-based Algorithms for Markov Decision Processes
2007 · External reference
Monte-Carlo Tree Search
2010 · External reference
Bandit algorithms for tree search
2007 · External reference
Efficient selectivity and backup operators in Monte-Carlo Tree Search
2006 · External reference
Stochastic linear optimization under bandit feedback
2008 · External reference
Lazy planning under uncertainties by optimizing decisions on an ensemble of incomplete disturbance trees
2008 · External reference
Optimal learning: computational procedures for Bayes-adaptive Markov decision processes
2002 · External reference
Parametric bandits: The generalized linear case
2010 · External reference
Convergence analysis of the direct algorithm
2004 · External reference
Online convex optimization in the bandit setting: gradient descent without a gradient
2005 · External reference
Deterministic Global Optimization: Theory, Algorithms and Applications
1999 · External reference
Optimistic planning for belief augmented Markov decision processes
2013 · External reference
Modifications of the Direct algorithm
2001 · External reference
The KL-UCB algorithm for bounded stochastic bandits and beyond
2011 · External reference
Modification of UCT with patterns in monte-carlo go
2006 · External reference
Combining online and offline knowledge in UCT
2007 · External reference
Monte-carlo tree search and rapid action value estimation in computer Go
10.1016/j.artint.2011.03.007 · 2011 · External reference
Bandit processes and dynamic allocation indices
10.1111/j.2517-6161.1979.tb01068.x · 1979 · External reference
Multi-armed Bandit Allocation Indices
1989 · External reference
Efficient Bayes-adaptive reinforcement learning using sample-based search
2012 · External reference
Global Optimization Using Interval Analysis
1992 · External reference
A heuristic search algorithm for Markov decision problems
1999 · External reference
An asymptotically optimal policy for finite support models in the multiarmed bandit problem
10.1007/s10994-011-5257-4 · 2011 · External reference
An asymptotically optimal bandit algorithm for bounded support models
2010 · External reference
Global Optimization: Deterministic ? Deterministic Approaches
1996 · External reference
Optimistic planning of deterministic systems
2008 · External reference
Lipschitzian optimization without the lipschitz constant
10.1007/bf00941892 · 1993 · External reference
Planning and acting in partially observable stochastic domains
10.1016/s0004-3702(98)00023-x · 1998 · External reference
Efficient algorithms for online decision problems
10.1016/j.jcss.2004.10.016 · 2005 · External reference
On Bayesian upper confidence bounds for bandit problems
2012 · External reference
Thompson sampling: An asymptotically optimal finite time analysis
2012 · External reference
Thompson sampling for 1-dimensional exponential family bandits
2013 · External reference
Rigorous Global Search: Continuous Problems
1996 · External reference
A sparse sampling algorithm for near-optimal planning in large Markovian decision processes
10.1023/a:1017932429737 · 2002 · External reference
A sparse sampling algorithm for near-optimal planning in large Markov decision processes
10.1023/a:1017932429737 · 2002 · External reference
Multi-armed bandits in metric spaces
2008 · External reference
Nearly tight bounds for the continuum-armed bandit problem
2004 · External reference
Multi-armed bandit problems in metric spaces
10.1145/1374376.1374475 · 2008 · External reference
Bandit based Monte-Carlo planning
2006 · External reference
Following the perturbed leader to gamble at multi-armed bandits
2007 · External reference
Planning Algorithms
2006 · External reference
Asymptotically efficient adaptive allocation rules
10.1016/0196-8858(85)90002-8 · 1985 · External reference
The computational intelligence of MoGo revealed in Taiwan computer Go tournaments
2009 · External reference
Predictive Control with Constraints
2002 · External reference
Apprentissage séquentiel: Bandits, Statistique et Renforcement
2011 · External reference
Finite-time analysis of multi-armed bandits problems with Kullback-Leibler divergences
2011 · External reference
Optimistic optimization of deterministic functions without the knowledge of its smoothness
2011 · External reference
Problem Complexity and Method Efficiency in Optimization
1983 · External reference
Introductory Lectures on Convex Optimization: A Basic Course
2004 · External reference
Interval Methods for Systems of Equations
1990 · External reference
Principles of Artificial Intelligence
1980 · External reference
On-line search for solving large Markov decision processes
2004 · External reference
Anytime point-based approximations for large POMDPs
10.1613/jair.2078 · 2006 · External reference
Global Optimization in Action (Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications)
1996 · External reference
Markov Decision Processes — Discrete Stochastic Dynamic Programming
1994 · External reference
Biasing Monte-Carlo simulations through RAVE values
2010 · External reference
Some aspects of the sequential design of experiments
10.1090/s0002-9904-1952-09620-8 · 1952 · External reference
Online planning algorithms for POMDPs
10.1613/jair.2567 · 2008 · External reference
A Bayesian approach for learning and planning in partially observable Markov decision processes
2011 · External reference
Linearly parameterized bandits
10.1287/moor.1100.0446 · 2010 · External reference
Markov Decision Processes in Artificial Intelligence
2010 · External reference
Reinforcement Learning and Simulation-Based Search in Computer Go
2009 · External reference
Monte-carlo planning in large POMDPs
2012 · External reference
Contextual bandits with similarity information
2011 · External reference
Gaussian process optimization in the bandit setting: No regret and experimental design
2010 · External reference
Global Optimization with Non-Convex Constraints: Sequential and Parallel Algorithms
2000 · External reference
Reinforcement Learning: An Introduction
1998 · External reference
Algorithms for Reinforcement Learning
2010 · External reference
On the theory of apportionment
10.2307/2371219 · 1935 · External reference
On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
10.1093/biomet/25.3-4.285 · 1933 · External reference
Information-based Complexity
1988 · External reference
Stochastic simultaneous optimistic optimization
2013 · External reference
Reinforcement Learning: State of the Art
2012 · External reference
Bayesian sparse sampling for on-line reward optimization
2005 · External reference
Modifications of UCT and sequence-like simulations for Monte-Carlo Go
2007 · External reference
Algorithms for infinitely many-armed bandits
2008 · External reference
