SZodixStudyAcademic Library
DashboardShelvesOpen accessMy libraryInboxNotesWriteLearnAlerts
More
Ask your libraryNotificationsQuick citeReview
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Online Markov Decision Processes Under Bandit Feedback
6 references·4 citing·29 second hop
Online Markov Decision Processes Under Bandit Feedback (2014)Online Markov Decision Processes Under Ba…Near-optimal Regret Bounds for Reinforcement Learning (2010)Near-optimal Regret Bounds fo…Online Markov Decision Processes (2009)Online Markov Decision Proces…The on-line shortest path problem under partial monitoring (2007)The on-line shortest path pro…Stochastic Learning and Optimization (2007)Stochastic Learning and Optim…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …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 costsThe adversarial stochastic shortest path problem with unknown transition probabilities (2012)The adversarial stochastic sh…A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Online Learning and Online Convex Optimization (2012)Theory of games and economic behavior (2019)Online Learning and Online Convex Optimization (2011)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)How to use expert advice (1997)Robust Control of Markov Decision Processes with Uncertain Transition Matrices (2005)Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret (2012)Online Linear Quadratic Control (2018)Improper Learning for Non-Stochastic Control (2020)Some aspects of the sequential design of experiments (1952)An analog of the minimax theorem for vector payoffs (1956)Introduction to Online Optimization (2011)Combinatorial Bandits Revisited (2015)Minimal Exploration in Structured Stochastic Bandits (2017)Efficient algorithms for online decision problems (2004)Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions (2013)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)Regret Bounds for the Adaptive Control of Linear Quadratic Systems (2011)Confronting Deep Uncertainties in Risk Analysis (2012)A Tutorial on Thompson Sampling (2018)What you should know about simulation and derivatives (2008)Event-based optimization of admission control in open queueing networks (2013)Robust Sensitivity Analysis for Stochastic Systems (2016)
this work references cited by second hop

References

  • 2006Prediction, Learning, and Games3,176 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 2010Near-optimal Regret Bounds for Reinforcement Learning718 cited
  • 2007Stochastic Learning and Optimization248 cited
  • 2007The on-line shortest path problem under partial monitoring151 cited
  • 2009Online Markov Decision Processes137 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
  • 2015Online learning in Markov Decision Processes with changing reward sequences42 cited

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