Primal-Dual $π$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems

17 October 2017

Papers citing "Primal-Dual $π$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems"

11 / 11 papers shown

Title
Second-Order Min-Max Optimization with Lazy Hessians Lesi Chen Chengchang Liu Jingzhao Zhang 90 1 0 12 Oct 2024
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes Aaron Sidford Mengdi Wang X. Wu Yinyu Ye 52 125 0 27 Oct 2017
Lower Bound On the Computational Complexity of Discounted Markov Decision Problems Yichen Chen Mengdi Wang 38 18 0 20 May 2017
Stochastic Primal-Dual Methods and Sample Complexity of Reinforcement Learning Yichen Chen Mengdi Wang 60 64 0 08 Dec 2016
Improved and Generalized Upper Bounds on the Complexity of Policy Iteration B. Scherrer 58 75 0 03 Jun 2013
On the Complexity of Solving Markov Decision Problems Michael L. Littman T. Dean L. Kaelbling 59 584 0 20 Feb 2013
On the Complexity of Policy Iteration Yishay Mansour Satinder Singh 54 101 0 23 Jan 2013
On the Sample Complexity of Reinforcement Learning with a Generative Model M. G. Azar Rémi Munos H. Kappen 61 156 0 27 Jun 2012
PAC Bounds for Discounted MDPs Tor Lattimore Marcus Hutter 77 188 0 17 Feb 2012
Sublinear Optimization for Machine Learning K. Clarkson Elad Hazan David P. Woodruff 68 138 0 21 Oct 2010
Solving variational inequalities with Stochastic Mirror-Prox algorithm A. Juditsky A. Nemirovskii Claire Tauvel 119 441 0 04 Sep 2008