SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Bandits with switching costs
11 references·0 citing·28 second hop
Bandits with switching costs (2014)Bandits with switching costsOnline Markov Decision Processes Under Bandit Feedback (2014)Online Markov Decision Proces…Online Learning with Switching Costs and Other Adaptive Adversaries (2013)Online Learning with Switchin…Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret (2012)Online Bandit Learning agains…Online Markov Decision Processes under Bandit Feedback (2010)Online Markov Decision Proces…Markov Decision Processes with Arbitrary Reward Processes (2009)Markov Decision Processes wit…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Minimax policies for adversarial and stochastic bandits (2004)Minimax policies for adversar…Efficient algorithms for online decision problems (2004)Efficient algorithms for onli…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …How to use expert advice (1997)How to use expert adviceA Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)A Decision-Theoretic Generali…Finite-time Analysis of the Multiarmed Bandit Problem (2002)UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem (2010)Combinatorial bandits (2012)Further Optimal Regret Bounds for Thompson Sampling (2012)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)Contributions to the theory of games. (1960)The Asymptotic Theory of Extreme Order Statistics (1990)Tracking the Best Expert (1998)Adaptive Game Playing Using Multiplicative Weights (1999)Near-optimal Regret Bounds for Reinforcement Learning (2010)The adversarial stochastic shortest path problem with unknown transition probabilities (2012)Online learning in Markov Decision Processes with changing reward sequences (2015)Delay and Cooperation in Nonstochastic Bandits (2016)Some aspects of the sequential design of experiments (1952)Stochastic Games (1953)The Theory of Learning in Games (1998)Online Linear Quadratic Control (2018)Online convex programming and generalized infinitesimal gradient ascent (2003)Algorithms for portfolio management based on the Newton method (2006)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)Survey on speech emotion recognition: Features, classification schemes, and databases (2010)Learning Prices for Repeated Auctions with Strategic Buyers (2013)Online Learning: A Modern Introduction Using Convex Optimization (2019)Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits (2023)Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions (2013)
this work references cited by second hop

References

  • 1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting20,469 cited
  • 2006Prediction, Learning, and Games3,176 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 1997How to use expert advice631 cited
  • 2004Efficient algorithms for online decision problems595 cited
  • 2004Minimax policies for adversarial and stochastic bandits330 cited
  • 2012Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret121 cited
  • 2014Online Markov Decision Processes Under Bandit Feedback101 cited
  • 2009Markov Decision Processes with Arbitrary Reward Processes93 cited
  • 2010Online Markov Decision Processes under Bandit Feedback88 cited
  • 2013Online Learning with Switching Costs and Other Adaptive Adversaries53 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