Contact and support
Need help, have a question, or want to contact the ResearchHub team?
© 2026 ResearchHub. Built for responsible scholarly connection.
Privacy-aware community infrastructureResearch graph
References from Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems. Local targets link to admitted publications; unresolved targets remain external evidence.
Unresolved reference
2011 · External reference
Unresolved reference
1999 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2011 · External reference
Sample mean based index policies with O(log n) regret for the multi-armed bandit problem
1995 · External reference
Analysis of Thompson sampling for the multi-armed bandit problem
2012 · External reference
Unresolved reference
2006 · External reference
Bandits, query learning, and the haystack dimension
2011 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2012 · External reference
The multiplicative weights update method: A meta-algorithm and applications
10.4086/toc.2012.v008a006 · 2012 · External reference
Bayes and minimax solutions of sequential decision problems
10.2307/1905525 · 1949 · External reference
Unresolved reference
2009 · External reference
Regret bounds and minimax policies under partial monitoring
2010 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2010 · External reference
Exploration-exploitation trade-off using variance estimates in multi-armed bandits
10.1016/j.tcs.2009.01.016 · 2009 · External reference
Using confidence bounds for exploitation-exploration trade-offs
2002 · External reference
Finite-time analysis of the multi-armed bandit problem
10.1023/a:1013689704352 · 2002 · External reference
The non-stochastic multi-armed bandit problem
10.1137/s0097539701398375 · 2002 · External reference
UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem
10.1007/s10998-010-3055-6 · 2010 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2004 · External reference
On pseudo-games
10.1214/aoms/1177698023 · 1968 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
1997 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2011 · External reference
Mirror descent and nonlinear projected subgradient methods for convex optimization
10.1016/s0167-6377(02)00231-6 · 2003 · External reference
Unresolved reference
1999 · External reference
Bandit problems with infinitely many arms
10.1214/aos/1069362389 · 1997 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2011 · External reference
Theory of classification: A survey of recent advances
10.1051/ps:2005018 · 2005 · External reference
10.1017/cbo9780511804441
10.1017/cbo9780511804441 · 2004 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2009 · External reference
Pure exploration in finitely-armed and continuously-armed bandits
10.1016/j.tcs.2010.12.059 · 2011 · External reference
Unresolved reference
2009 · External reference
X-armed bandits
2011 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2011 · External reference
Optimal adaptive policies for Markov decision processes
10.1287/moor.22.1.222 · 1997 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2011 · External reference
10.1017/cbo9780511546921
10.1017/cbo9780511546921 · 2006 · External reference
Combinatorial bandits
10.1016/j.jcss.2012.01.001 · 2012 · External reference
Minimizing regret with label efficient prediction
10.1109/tit.2005.847729 · 2005 · External reference
Improved second-order bounds for prediction with expert advice
10.1007/s10994-006-5001-7 · 2007 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2011 · External reference
10.1137/1.9780898718768
10.1137/1.9780898718768 · 2009 · External reference
Regret and convergence bounds for a class of continuum-armed bandit problems
10.1109/tac.2009.2019797 · 2009 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2002 · External reference
Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems
2006 · External reference
Optimally sensing a single channel without prior information: The tiling algorithm and regret bounds
10.1109/jstsp.2010.2058091 · 2011 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2005 · External reference
Unresolved reference
2012 · External reference
Asymptotic calibration
10.1093/biomet/85.2.379 · 1998 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2006 · External reference
10.1002/9780470980033
10.1002/9780470980033 · 2011 · External reference
Bandit processes and dynamic allocation indices
10.1111/j.2517-6161.1979.tb01068.x · 1979 · External reference
General convergence results for linear discriminant updates
10.1023/a:1010844028087 · 2001 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2007 · External reference
The on-line shortest path problem under partial monitoring
2007 · External reference
Approximation to Bayes risk in repeated play
1957 · External reference
A simple adaptive procedure leading to correlated equilibrium
10.1111/1468-0262.00153 · 2000 · External reference
A general class of adaptive strategies
10.1006/jeth.2000.2746 · 2001 · External reference
10.7551/mitpress/8996.003.0012
10.7551/mitpress/8996.003.0012 · 2011 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
1997 · External reference
Learning permutations with exponential weights
2009 · External reference
Tracking the best expert
10.1023/a:1007424614876 · 1998 · External reference
10.1007/978-3-642-56468-0
10.1007/978-3-642-56468-0 · 2001 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2010 · External reference
Near-optimal regret bounds for reinforcement learning
2010 · External reference
Recursive aggregation of estimators by the Mirror Descent algorithm with averaging
10.1007/s11122-006-0005-2 · 2005 · External reference
Regularization techniques for learning with matrices
2012 · External reference
Unresolved reference
2003 · External reference
Unresolved reference
2008 · External reference
Efficient algorithms for online decision problems
10.1016/j.jcss.2004.10.016 · 2005 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2012 · External reference
A sparse sampling algorithm for near-optimal planning in large Markovian decision processes
10.1023/a:1017932429737 · 2002 · External reference
Sequential minimax search for a maximum
10.1090/s0002-9939-1953-0055639-3 · 1953 · External reference
Stochastic estimation of the maximum of a regression function
10.1214/aoms/1177729392 · 1952 · External reference
Relative loss bounds for multidimensional regression problems
10.1023/a:1017938623079 · 2001 · External reference
Unresolved reference
2004 · External reference
Regret bounds for sleeping experts and bandits
10.1007/s10994-010-5178-7 · 2010 · External reference
Multi-armed bandits in metric spaces
10.1145/1374376.1374475 · 2008 · External reference
Unresolved reference
2006 · External reference
Unresolved reference
2010 · External reference
Asymptotically efficient adaptive allocation rules
10.1016/0196-8858(85)90002-8 · 1985 · External reference
Unresolved reference
2007 · External reference
Chernoff-type bound for finite Markov chains
10.1214/aoap/1028903453 · 1998 · External reference
Unresolved reference
2010 · External reference
Dynamic multichannel access with imperfect channel state detection
10.1109/tsp.2010.2041600 · 2010 · External reference
10.1007/978-0-387-49819-5_6
10.1007/978-0-387-49819-5_6 · 2008 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2011 · External reference
The sample complexity of exploration in the multi-armed bandit problem
2004 · External reference
Unresolved reference
2004 · External reference
Unresolved reference
2009 · External reference
Efficient methods for large-scale convex optimization problems
1979 · External reference
Robust stochastic approximation approach to stochastic programming
10.1137/070704277 · 2009 · External reference
Unresolved reference
1983 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2011 · External reference
Combining expert advice in reactive environments
10.1145/1183907.1183911 · 2006 · External reference
Unresolved reference
2009 · External reference
Some aspects of the sequential design of experiments
10.1090/s0002-9904-1952-09620-8 · 1952 · External reference
A stochastic approximation method
10.1214/aoms/1177729586 · 1951 · External reference
Linearly parameterized bandits
10.1287/moor.1100.0446 · 2010 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2005 · External reference
Unresolved reference
1998 · External reference
10.1007/978-3-031-01551-9
10.1007/978-3-031-01551-9 · 2010 · External reference
Paths kernels and multiplicative updates
2003 · External reference
Online learning of rested and restless bandits
10.1109/tit.2012.2198613 · 2012 · External reference
Unresolved reference
2009 · External reference
On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
1933 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
1947 · External reference
Arbitrary side observations in bandit problems
10.1016/j.aam.2004.10.004 · 2005 · External reference
Bandit problems with side observations
10.1109/tac.2005.844079 · 2005 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2011 · External reference
Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension
2008 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2011 · External reference
Markov decision processes with arbitrary reward processes
10.1287/moor.1090.0397 · 2009 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2003 · External reference
