Policy Optimization in a Noisy Neighborhood: On Return Landscapes in Continuous Control

Nate Rahn, P. D'Oro, Harley Wiltzer, Pierre-Luc Bacon, Marc G. Bellemare
2/12/2026

No official code found. Best implementation: nathanrahn/return-landscapes (7 stars, last commit 2023-10-31).

Abstract

Deep reinforcement learning agents for continuous control are known to exhibit significant instability in their performance over time. In this work, we provide a fresh perspective on these behaviors by studying the return landscape: the mapping between a policy and a return. We find that popular algorithms traverse noisy neighborhoods of this landscape, in which a single update to the policy parameters leads to a wide range of returns. By taking a distributional view of these returns, we map the landscape, characterizing failure-prone regions of policy space and revealing a hidden dimension of policy quality. We show that the landscape exhibits surprising structure by finding simple paths in parameter space which improve the stability of a policy. To conclude, we develop a distribution-aware procedure which finds such paths, navigating away from noisy neighborhoods in order to improve the robustness of a policy. Taken together, our results provide new insight into the optimization, evaluation, and design of agents.

View on arXivView PDF

Code Implementations(1)

70PythonOct 23, 20232 years ago

Similar Papers

Cite this paper

@article{rahn2026policy,
  title  = {Policy Optimization in a Noisy Neighborhood: On Return Landscapes in Continuous Control},
  author = {Nate Rahn and P. D'Oro and Harley Wiltzer and Pierre-Luc Bacon and Marc G. Bellemare},
  year   = {2026},
  eprint = {2309.14597},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2309.14597},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2309.14597.svg)](https://codeofpaper.com/paper/2309.14597)

Discussion