Reinforcement Learning as (Discrete) Potential Theory
On the map: Deep reinforcement learning methods → RL theory and sample complexity
Abstract (arXiv)
Reinforcement learning (RL) theory fundamentally depends on probability theory through the Markov chain. There is a deep connection between probability theory and potential theory. This paper reviews that connection and explores the potential-theoretic viewpoint for core reinforcement learning representations and algorithms under a fixed-policy assumption. This viewpoint may offer a path for improved sample efficiency and formal constraints that can be applied to RL. When the fixed-policy assumption is relaxed, the linear potential theory framework can be naturally extended to the nonlinear case.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 0 of its 15 references that are in the map. First posted on arXiv 17 Aug 2026.
Builds on
0 of 15 references.
No references here yet.
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Mathematical methods of reinforcement learning
- 2024Policy Gradients for Cumulative Prospect Theory in Reinforcement Learning
- 2025Statistical and Algorithmic Foundations of Reinforcement Learning
- 2025Towards Formalizing Reinforcement Learning Theory: A Robbins-Siegmund Approach
- 2024Programmatic Reinforcement Learning: Navigating Gridworlds
- 2025Reconciling Discrete-Time Mixed Policies and Continuous-Time Relaxed Controls in Reinforcement Learning and Stochastic Control
- 2022Challenging Common Assumptions in Convex Reinforcement Learning
- 2024Local Linearity: the Key for No-regret Reinforcement Learning in Continuous MDPs