ML Anthology

Near-Optimal Reinforcement Learning in Polynomial Time

Michael J. Kearns, Satinder Singh
MLJ 2002 pp. 209-232
doi:10.1023/A:1017984413808 /mlj/2002/kearns2002mlj-nearoptimal/
PDF MLJ Semantic Scholar

Cite

Text

Kearns and Singh. "Near-Optimal Reinforcement Learning in Polynomial Time." Machine Learning, 2002. doi:10.1023/A:1017984413808

Markdown

[Kearns and Singh. "Near-Optimal Reinforcement Learning in Polynomial Time." Machine Learning, 2002.](https://mlanthology.org/mlj/2002/kearns2002mlj-nearoptimal/) doi:10.1023/A:1017984413808

BibTeX

@article{kearns2002mlj-nearoptimal,
  title     = {{Near-Optimal Reinforcement Learning in Polynomial Time}},
  author    = {Kearns, Michael J. and Singh, Satinder},
  journal   = {Machine Learning},
  year      = {2002},
  pages     = {209-232},
  doi       = {10.1023/A:1017984413808},
  volume    = {49},
  url       = {https://mlanthology.org/mlj/2002/kearns2002mlj-nearoptimal/}
}