SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Adaptive Submodular Maximization in Bandit Setting
5 references·0 citing·18 second hop
Adaptive Submodular Maximization in Bandit Setting (2013)Adaptive Submodular Maximization in Bandi…From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)From Bandits to Monte-Carlo T…Linear Submodular Bandits and their Application to Diversified Retrieval (2011)Linear Submodular Bandits and…Near-optimal Regret Bounds for Reinforcement Learning (2010)Near-optimal Regret Bounds fo…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…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)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)Learning diverse rankings with multi-armed bandits (2008)Stochastic Linear Optimization Under Bandit Feedback (2008)Contextual Bandits with Linear Payoff Functions (2011)Learning Hidden Features for Contextual Bandits (2016)Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits (2023)Matroid Bandits: Fast Combinatorial Optimization with Learning (2014)Optimal Best Arm Identification with Fixed Confidence (2016)Global optimization of Lipschitz functions (2017)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
  • 2010Near-optimal Regret Bounds for Reinforcement Learning718 cited
  • 2014From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning233 cited
  • 2011Linear Submodular Bandits and their Application to Diversified Retrieval101 cited

Cited by

No citing works inside the corpus for this window.

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