A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes

Cite

Text

Kearns et al. "A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes." Machine Learning, 2002. doi:10.1023/A:1017932429737

Markdown

[Kearns et al. "A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes." Machine Learning, 2002.](https://mlanthology.org/mlj/2002/kearns2002mlj-sparse/) doi:10.1023/A:1017932429737

BibTeX

@article{kearns2002mlj-sparse,
  title     = {{A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes}},
  author    = {Kearns, Michael J. and Mansour, Yishay and Ng, Andrew Y.},
  journal   = {Machine Learning},
  year      = {2002},
  pages     = {193-208},
  doi       = {10.1023/A:1017932429737},
  volume    = {49},
  url       = {https://mlanthology.org/mlj/2002/kearns2002mlj-sparse/}
}