# Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity

Mahajan Gaurav
Cited by: 6|Views115

Abstract:

The current paper studies the problem of agnostic $Q$-learning with function approximation in deterministic systems where the optimal $Q$-function is approximable by a function in the class $\mathcal{F}$ with approximation error $\delta \ge 0$. We propose a novel recursion-based algorithm and show that if \$\delta = O\left(\rho/\sqrt{\di...More

Code:

Data:

Full Text
Bibtex