Parameter-Efficient Distributional RL via Normalizing Flows and a Geometry-Aware Cram'er Surrogate
Not on the map. Why?
Abstract (arXiv)
Distributional Reinforcement Learning (DistRL) improves upon expectation-based methods by modeling full return distributions, but standard approaches often remain far from parsimonious. Categorical methods (e.g., C51) rely on fixed supports where parameter counts scale linearly with resolution, while quantile methods approximate distributions as discrete mixtures whose piecewise-constant densities can be wasteful when modeling complex multi-modal or heavy-tailed returns. We introduce NFDRL, a parsimonious architecture that models return distributions using continuous normalizing flows. Unlike categorical baselines, our flow-based model maintains a compact parameter footprint that does not grow with the effective resolution of the distribution, while providing a dynamic, adaptive support for returns. To train this continuous representation, we propose a Cram'er-inspired, geometry-aware distance defined over probability masses obtained from the flow. We show that this distance is a true probability metric, that the associated distributional Bellman operator is a sqrt(gamma)-contraction, and that the resulting objective admits unbiased sample gradients, properties that are typically not simultaneously guaranteed in prior PDF-based DistRL methods. Empirically, NFDRL recovers rich, multi-modal return landscapes on toy MDPs and achieves performance competitive with categorical baselines on the Atari-5 benchmark, while offering substantially better parameter efficiency.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 19 references that are in the map. First posted on arXiv 7 May 2025.
Builds on
11 of 19 references.
References · 11
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
- 2017A Distributional Perspective on Reinforcement Learningcited by 743
- 2017Distributional Reinforcement Learning with Quantile Regressioncited by 464
- 2018Implicit Quantile Networks for Distributional Reinforcement Learningcited by 362
- 2017Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agentscited by 267
- 2019Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Designcited by 258
- 2019Search on the Replay Buffer: Bridging Planning and Reinforcement Learningcited by 188
- 2017The Cramer Distance as a Solution to Biased Wasserstein Gradientscited by 116
- 2019Fully Parameterized Quantile Function for Distributional Reinforcement Learningcited by 87
- 2020Reinforcement Learning in Economics and Financecited by 57
- 2021Distributional Reinforcement Learning with Unconstrained Monotonic Neural Networkscited by 3
Built on by
Not cited yet.