SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Finite-time Analysis of the Multiarmed Bandit Problem
0 references·16 citing·34 second hop
Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the Multiarmed Ba…Bandit Algorithms (2020)Bandit AlgorithmsIntroduction to Multi-Armed Bandits (2019)Introduction to Multi-Armed B…On the Complexity of Best Arm Identification in Multi-Armed Bandit Models (2014)On the Complexity of Best Arm…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Information-Theoretic Regret …Improved Algorithms for Linear Stochastic Bandits (2011)Improved Algorithms for Linea…Contextual Bandits with Linear Payoff Functions (2011)Contextual Bandits with Linea…Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Analysis of Thompson Sampling…An Empirical Evaluation of Thompson Sampling (2011)An Empirical Evaluation of Th…Why Copy Others? Insights from the Social Learning Strategies Tournament (2010)Why Copy Others? Insights fro…Near-optimal Regret Bounds for Reinforcement Learning (2010)Near-optimal Regret Bounds fo…Exploration–exploitation tradeoff using variance estimates in multi-armed bandits (2009)Exploration–exploitation trad…Stochastic Linear Optimization Under Bandit Feedback (2008)Stochastic Linear Optimizatio…Learning diverse rankings with multi-armed bandits (2008)Learning diverse rankings wit…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Multi-armed Bandit Algorithms and Empirical Evaluation (2005)Multi-armed Bandit Algorithms…Non-cooperative games (1989)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Online Learning and Online Convex Optimization (2011)Online Learning and Online Convex Optimization (2012)Theory of games and economic behavior (2019)The Nonstochastic Multiarmed Bandit Problem (2002)Regret Bounds for the Adaptive Control of Linear Quadratic Systems (2011)Confronting Deep Uncertainties in Risk Analysis (2012)A Tutorial on Thompson Sampling (2018)Multi-Armed Bandit Allocation Indices. (1990)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Learning to Optimize via Posterior Sampling (2014)The Evolution of Cooperation (1981)Culture and the Evolutionary Process (1986)Not By Genes Alone (2004)Evolutionary mechanisms for loneliness (2013)Potent Social Learning and Conformity Shape a Wild Primate’s Foraging Decisions (2013)Social Learning Strategies: Bridge-Building between Fields (2018)A Stochastic Approximation Method (1951)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Some aspects of the sequential design of experiments (1952)Using confidence bounds for exploitation-exploration trade-offs (2003)Bayesian Experimental Design: A Review (1995)A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning (2010)PORTFOLIO SELECTION* (1952)Prospect Theory: An Analysis of Decision under Risk (1979)Optimization of conditional value-at-risk (2000)Hedging the Drift: Learning to Optimize Under Non-Stationarity (2018)Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (2021)Multi-Armed Bandits With Correlated Arms (2021)Stochastic bandits robust to adversarial corruptions (2018)Predictive Policing for Reform? Indeterminacy and Intervention in Big Data Policing (2019)The sense of agency in human–AI interactions (2024)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2006Prediction, Learning, and Games3,176 cited
  • 2012Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting2,098 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,410 cited
  • 2011An Empirical Evaluation of Thompson Sampling1,000 cited
  • 2020Bandit Algorithms981 cited
  • 2011Analysis of Thompson Sampling for the multi-armed bandit problem904 cited
  • 2011Improved Algorithms for Linear Stochastic Bandits860 cited
  • 2010Why Copy Others? Insights from the Social Learning Strategies Tournament812 cited
  • 2019Introduction to Multi-Armed Bandits797 cited
  • 2010Near-optimal Regret Bounds for Reinforcement Learning718 cited
  • 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Models704 cited
  • 2011Contextual Bandits with Linear Payoff Functions599 cited
  • 2008Stochastic Linear Optimization Under Bandit Feedback581 cited
  • 2009Exploration–exploitation tradeoff using variance estimates in multi-armed bandits571 cited
  • 2005Multi-armed Bandit Algorithms and Empirical Evaluation

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

522 cited
  • 2008Learning diverse rankings with multi-armed bandits504 cited