SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Online Markov Decision Processes under Bandit Feedback
1 references·8 citing·20 second hop
Online Markov Decision Processes under Bandit Feedback (2010)Online Markov Decision Processes under Ba…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …Nonstationary Reinforcement Learning: The Blessing of (More) Optimism (2023)Nonstationary Reinforcement L…Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimism (2020)Reinforcement Learning for No…Learning in Generalized Linear Contextual Bandits with Stochastic Delays (2019)Learning in Generalized Linea…Delay and Cooperation in Nonstochastic Bandits (2016)Delay and Cooperation in Nons…Online learning in Markov Decision Processes with changing reward sequences (2015)Online learning in Markov Dec…Bandits with switching costs (2014)Bandits with switching costsOnline Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions (2013)Online Learning in Markov Dec…The adversarial stochastic shortest path problem with unknown transition probabilities (2012)The adversarial stochastic sh…Prediction, Learning, and Games (2006)Online Learning and Online Convex Optimization (2011)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Some aspects of the sequential design of experiments (1952)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Online Learning and Online Convex Optimization (2012)Using confidence bounds for exploitation-exploration trade-offs (2003)Improved Algorithms for Linear Stochastic Bandits (2011)Logarithmic Regret for Adversarial Online Control (2020)Efficient algorithms for online decision problems (2004)Near-optimal Regret Bounds for Reinforcement Learning (2010)Multiplicative updates outperform generic no-regret learning in congestion games (2009)Efficient Optimal Learning for Contextual Bandits (2011)Collaborative Learning of Stochastic Bandits Over a Social Network (2016)Social Learning in Multi Agent Multi Armed Bandits (2019)Decentralized Online Convex Optimization With Feedback Delays (2021)Contextual Bandits with Linear Payoff Functions (2011)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Learning to Optimize via Posterior Sampling (2014)Finite-time Analysis of the Multiarmed Bandit Problem (2002)
this work references cited by second hop

References

  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited

Cited by

  • 2016Delay and Cooperation in Nonstochastic Bandits65 cited
  • 2014Bandits with switching costs52 cited
  • 2012The adversarial stochastic shortest path problem with unknown transition probabilities49 cited
  • 2013Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions44 cited
  • 2015Online learning in Markov Decision Processes with changing reward sequences42 cited
  • 2020Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimism40 cited
  • 2019Learning in Generalized Linear Contextual Bandits with Stochastic Delays35 cited
  • 2023Nonstationary Reinforcement Learning: The Blessing of (More) Optimism34 cited

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