Abstract

Deep Reinforcement Learning (RL) agents often learn policies that achieve the same episodic return yet behave very differently, due to a combination of environmental (random transitions, initial conditions, reward noise) and algorithmic (minibatch selection, exploration noise) factors. In continuous control tasks, even small parameter shifts can produce unstable gaits, complicating both algorithm comparison and real-world transfer. Previous work has shown that such instability arises when policy updates traverse noisy neighborhoods and that the spread of post-update return distribution \(R(\theta)\), obtained by repeatedly sampling minibatches, updating \(\theta\), and measuring final returns, is a useful indicator of this noise. Although explicitly constraining the policy to maintain a narrow \(R(\theta)\) can improve stability, directly estimating \(R(\theta)\) is computationally expensive in high-dimensional settings. We propose an alternative that takes advantage of environmental s

Authors

(none)

Tags

  • Exploration

Stats

  • citations0
  • S2 citationsβ€”
  • github stars0
  • HF likes0
  • heat score0.00
  • arxiv keyjabs2026moments

Related papers