Research map / Reinforcement learning / MDPs and planning
Understanding Deep Neural Function Approximation in Reinforcement Learning via $\epsilon$-Greedy Exploration
Fanghui Liu, Luca Viano, Volkan Cevher
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.
Closest papers by meaning
- Stop Regressing: Training Value Functions via Classification for Scalable Deep RL (ICML 2024 · similarity 0.89)
- Stochastic Q-learning for Large Discrete Action Spaces (ICML 2024 · similarity 0.88)
- Learning the Target Network in Function Space (ICML 2024 · similarity 0.88)
- Neural Network Approximation for Pessimistic Offline Reinforcement Learning (AAAI 2024 · similarity 0.88)
- The Effective Horizon Explains Deep RL Performance in Stochastic Environments (ICLR 2024 · similarity 0.87)
- Universal Approximation Theorem of Deep Q-Networks (ICML 2025 · similarity 0.87)
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.
