mlsanityData to 14 Oct 2026

Action Gaps and Advantages in Continuous-Time Distributional Reinforcement Learning

arXiv 2410.11022 ↗First posted 14 Oct 2024cs.LG math.OC stat.MLcited by 7

On the map: Deep reinforcement learning methods → RL theory and sample complexity

Abstract (arXiv)

When decisions are made at high frequency, traditional reinforcement learning (RL) methods struggle to accurately estimate action values. In turn, their performance is inconsistent and often poor. Whether the performance of distributional RL (DRL) agents suffers similarly, however, is unknown. In this work, we establish that DRL agents are sensitive to the decision frequency. We prove that action-conditioned return distributions collapse to their underlying policy's return distribution as the decision frequency increases. We quantify the rate of collapse of these return distributions and exhibit that their statistics collapse at different rates. Moreover, we define distributional perspectives on action gaps and advantages. In particular, we introduce the superiority as a probabilistic generalization of the advantage -- the core object of approaches to mitigating performance issues in high-frequency value-based RL. In addition, we build a superiority-based DRL algorithm. Through simulations in an option-trading domain, we validate that proper modeling of the superiority distribution produces improved controllers at high decision frequencies.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 19 of its 42 references that are in the map. First posted on arXiv 14 Oct 2024.

Builds on

19 of 42 references.

References · 19

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2015Continuous control with deep reinforcement learningcited by 3,407
  3. 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 785
  4. 2017Distributional Reinforcement Learning with Quantile Regressioncited by 474
  5. 2018Implicit Quantile Networks for Distributional Reinforcement Learningcited by 369
  6. 2021Policy Gradient and Actor-Critic Learning in Continuous Time and Space: Theory and Algorithmscited by 101
  7. 2022q-Learning in Continuous Timecited by 91
  8. 2019Making Deep Q-learning methods robust to time discretizationcited by 58
  9. 2015Increasing the Action Gap: New Operators for Reinforcement Learningcited by 49
  10. 2019Real-Time Reinforcement Learningcited by 40
  11. 2023An Analysis of Quantile Temporal-Difference Learningcited by 31
  12. 2023Policy Optimization for Continuous Reinforcement Learningcited by 31
7 more
  1. 2022The Phenomenon of Policy Churncited by 28
  2. 2022Distributional Hamilton-Jacobi-Bellman Equations for Continuous-Time Reinforcement Learningcited by 12
  3. 2023Instance-Optimality in Interactive Decision Making: Toward a Non-Asymptotic Theorycited by 12
  4. 2021Direct Advantage Estimationcited by 11
  5. 2023VA-learning as a more efficient alternative to Q-learningcited by 11
  6. 2023Distributional Model Equivalence for Risk-Sensitive Reinforcement Learningcited by 9
  7. 2021Distributional Offline Continuous-Time Reinforcement Learning with Neural Physics-Informed PDEs (SciPhy RL for DOCTR-L)cited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 4.

7 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025A Differential Perspective on Distributional Reinforcement Learning
  2. 2024On Policy Evaluation Algorithms in Distributional Reinforcement Learning
  3. 2025Optimizing Return Distributions with Distributional Dynamic Programming
  4. 2022On Practical Reinforcement Learning: Provable Robustness, Scalability, and Statistical Efficiency
  5. 2025Beyond CVaR: Leveraging Static Spectral Risk Measures for Enhanced Decision-Making in Distributional Reinforcement Learning
  6. 2024Assessing the Impact of Distribution Shift on Reinforcement Learning Performance
  7. 2026Decoupling Time and Risk: Risk-Sensitive Reinforcement Learning with General Discounting
  8. 2026Mathematical methods of reinforcement learning