Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model

Aaron Sidford, Mengdi Wang, Xian Wu, Lin Yang, Yinyu Ye. Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model. In Samy Bengio, Hanna M. Wallach, Hugo Larochelle, Kristen Grauman, Nicolò Cesa-Bianchi, Roman Garnett, editors, Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, 3-8 December 2018, Montréal, Canada. pages 5192-5202, 2018. [doi]

@inproceedings{SidfordWWYY18,
  title = {Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model},
  author = {Aaron Sidford and Mengdi Wang and Xian Wu and Lin Yang and Yinyu Ye},
  year = {2018},
  url = {http://papers.nips.cc/paper/7765-near-optimal-time-and-sample-complexities-for-solving-markov-decision-processes-with-a-generative-model},
  researchr = {https://researchr.org/publication/SidfordWWYY18},
  cites = {0},
  citedby = {0},
  pages = {5192-5202},
  booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, 3-8 December 2018, Montréal, Canada},
  editor = {Samy Bengio and Hanna M. Wallach and Hugo Larochelle and Kristen Grauman and Nicolò Cesa-Bianchi and Roman Garnett},
}