Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Online Markov Decision Processes

8 references·11 citing·36 second hop

FromToDepth

this work references cited by second hop

References

1997Exponentiated Gradient versus Gradient Descent for Linear Predictors856 cited
2005Robust Control of Markov Decision Processes with Uncertain Transition Matrices700 cited
1997How to use expert advice631 cited
2004Efficient algorithms for online decision problems595 cited
1998On‐Line Portfolio Selection Using Multiplicative Updates387 cited
1995Additive versus exponentiated gradient updates for linear prediction221 cited
2002Adaptive and self-confident on-line learning algorithms181 cited
1997Universal portfolios with and without transaction costs151 cited

Cited by

2012Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret121 cited
2014Online Markov Decision Processes Under Bandit Feedback101 cited
2020Improper Learning for Non-Stochastic Control76 cited
2018Online Linear Quadratic Control52 cited
2024Corruption-Robust Exploration in Episodic Reinforcement Learning49 cited
2012The adversarial stochastic shortest path problem with unknown transition probabilities49 cited
2013Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions

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

44 cited

2015Online learning in Markov Decision Processes with changing reward sequences42 cited

2020Logarithmic Regret for Adversarial Online Control37 cited

2009Online learning in Markov decision processes with arbitrarily changing rewards and transitions35 cited

2010The Online Loop-free Stochastic Shortest-Path Problem.34 cited