Research map / Learning theory and algorithms / Sample complexity
On the Performance of Temporal Difference Learning With Neural Networks
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use a constant projection radius instead of one decaying with network width | Projected Neural TD · Mountaincar, Cartpole, Acrobot | averaged Bellman error | Helped |
| Use Markov sampling rather than i.i.d. sampling | Projected Neural TD · Policy evaluation | convergence rate | Hurt |
Closest papers by meaning
- An Improved Finite-time Analysis of Temporal Difference Learning with Deep Neural Networks (ICML 2024 · similarity 0.92)
- Neural Temporal-Difference Learning Converges to Global Optima (NeurIPS 2019 · similarity 0.91)
- Towards Parameter-Free Temporal Difference Learning (ICML 2026 · similarity 0.90)
- Almost Sure Convergence of Linear Temporal Difference Learning with Arbitrary Features (NeurIPS 2026 · similarity 0.90)
- Discerning Temporal Difference Learning (AAAI 2024 · similarity 0.88)
- Finite Sample Analysis of Linear Temporal Difference Learning with Arbitrary Features (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.