Sample Complexity and Performance Bounds for Non-Parametric Approximate Linear Programming

Jason Pazis, Ronald Parr. Sample Complexity and Performance Bounds for Non-Parametric Approximate Linear Programming. In Marie desJardins, Michael L. Littman, editors, Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, July 14-18, 2012, Bellevue, Washington, USA. pages 782-788, AAAI Press, 2013. [doi]

@inproceedings{PazisP13a,
  title = {Sample Complexity and Performance Bounds for Non-Parametric Approximate Linear Programming},
  author = {Jason Pazis and Ronald Parr},
  year = {2013},
  url = {http://www.aaai.org/ocs/index.php/AAAI/AAAI13/paper/view/6479},
  researchr = {https://researchr.org/publication/PazisP13a},
  cites = {0},
  citedby = {0},
  pages = {782-788},
  booktitle = {Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, July 14-18, 2012, Bellevue, Washington, USA},
  editor = {Marie desJardins and Michael L. Littman},
  publisher = {AAAI Press},
  isbn = {978-1-57735-615-8},
}