SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Contextual Multi-Armed Bandits
10 references·8 citing·31 second hop
Contextual Multi-Armed Bandits (2010)Contextual Multi-Armed BanditsMulti-armed bandits in metric spaces (2008)Multi-armed bandits in metric…The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information (2007)The Epoch-Greedy Algorithm fo…Improved Rates for the Stochastic Continuum-Armed Bandit Problem (2007)Improved Rates for the Stocha…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems (2006)Action Elimination and Stoppi…Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Online convex optimization in…Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Nearly Tight Bounds for the C…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…The Continuum-Armed Bandit Problem (1995)The Continuum-Armed Bandit Pr…From Ads to Interventions: Contextual Bandits in Mobile Health (2017)From Ads to Interventions: Co…Rawlsian Fairness for Machine Learning. (2016)Rawlsian Fairness for Machine…Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits (2015)Algorithms with Logarithmic o…Latent Bandits. (2014)Latent Bandits.A Strategy-Aware Technique for Learning Behaviors from Discrete Human Feedback (2014)A Strategy-Aware Technique fo…Finite-Time Analysis of Kernelised Contextual Bandits (2013)Finite-Time Analysis of Kerne…Convergent Learning Algorithms for Unknown Reward Games (2013)Convergent Learning Algorithm…A linear response bandit problem (2013)A linear response bandit prob…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)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Theory of games and economic behavior (2019)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Online convex programming and generalized infinitesimal gradient ascent (2003)Linearly Parameterized Bandits (2010)Introduction to Stochastic Programming (2011)Some aspects of the sequential design of experiments (1952)Stochastic Approximation Methods for Constrained and Unconstrained Systems (1978)Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards (1987)Online linear optimization and adaptive routing (2007)Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms (2014)Stochastic Estimation of the Maximum of a Regression Function (1952)Contextual Bandits with Similarity Information (2009)Interactively optimizing information retrieval systems as a dueling bandits problem (2009)UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem (2010)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Parametric Bandits: The Generalized Linear Case (2010)Online Decision Making with High-Dimensional Covariates (2019)Survey on Applications of Multi-Armed and Contextual Bandits (2020)Algorithms for Infinitely Many-Armed Bandits (2008)Stochastic Convex Optimization with Bandit Feedback (2013)Bandit Algorithms for Tree Search (2014)Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access (2010)Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization (2012)Safe Exploration for Optimization with Gaussian Processes (2015)The Epoch-Greedy algorithm for contextual multi-armed bandits (2007)Almost Optimal Exploration in Multi-Armed Bandits (2013)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 2006Prediction, Learning, and Games3,176 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 2004Online convex optimization in the bandit setting: gradient descent without a gradient599 cited
  • 2007The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information426 cited
  • 2006Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems410 cited
  • 2008Multi-armed bandits in metric spaces353 cited
  • 2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
  • 1995The Continuum-Armed Bandit Problem201 cited
  • 2007Improved Rates for the Stochastic Continuum-Armed Bandit Problem175 cited

Cited by

  • 2017From Ads to Interventions: Contextual Bandits in Mobile Health130 cited
  • 2013Finite-Time Analysis of Kernelised Contextual Bandits120 cited
  • 2015Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits61 cited
  • 2014A Strategy-Aware Technique for Learning Behaviors from Discrete Human Feedback55 cited
  • 2013A linear response bandit problem

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

54 cited
  • 2016Rawlsian Fairness for Machine Learning.52 cited
  • 2013Convergent Learning Algorithms for Unknown Reward Games45 cited
  • 2014Latent Bandits.44 cited