Paper Info
Title
Sample Complexity and Performance Bounds for Non-Parametric Approximate Linear Programming.
Year
Venue
Keywords
2013
AAAI
reinforcement learning
Field
DocType
Citations 
Mathematical optimization,Computer science,Markov decision process,Bellman equation,Nonparametric statistics,Robustness (computer science),Artificial intelligence,Linear programming,Overfitting,Smoothness,Machine learning,Reinforcement learning
Conference
1
PageRank 
References 
Authors
0.36
12
2
Name
Order
Citations
PageRank
Jason Pazis11046.97
Ronald Parr22428186.85