Open AccessSample Complexity and Performance Bounds for Non-Parametric Approximate Linear Programming
Author(s) -
Jason Pazis,
Ronald Parr
Publication year - 2013
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v27i1.8696
Subject(s) - bellman equation , mathematical optimization , overfitting , parametric statistics , markov decision process , robustness (evolution) , computer science , linear programming , function approximation , mathematics , smoothness , markov process , artificial intelligence , statistics , mathematical analysis , artificial neural network , biochemistry , chemistry , gene
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom