Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions

13 references·2 citing·31 second hop

FromToDepth

this work references cited by second hop

References

2006Prediction, Learning, and Games3,176 cited
2003Using confidence bounds for exploitation-exploration trade-offs1,189 cited
2011Improved Algorithms for Linear Stochastic Bandits860 cited
2010Near-optimal Regret Bounds for Reinforcement Learning718 cited
2004Efficient algorithms for online decision problems595 cited
2008Stochastic Linear Optimization Under Bandit Feedback581 cited
2011Regret Bounds for the Adaptive Control of Linear Quadratic Systems213 cited
2009Online Markov Decision Processes137 cited
2013Online Learning for Linearly Parametrized Control Problems90 cited
2010Online Markov Decision Processes under Bandit Feedback88 cited
2004Experts in a Markov Decision Process67 cited
2010Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm.51 cited
2012The adversarial stochastic shortest path problem with unknown transition probabilities49 cited

Cited by

2020Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimism40 cited
2020Logarithmic Regret for Adversarial Online Control37 cited

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