Deep RL With Information Constrained Policies: Generalization in Continuous Control
Not on the map. Why?
Abstract (arXiv)
Biological agents learn and act intelligently in spite of a highly limited capacity to process and store information. Many real-world problems involve continuous control, which represents a difficult task for artificial intelligence agents. In this paper we explore the potential learning advantages a natural constraint on information flow might confer onto artificial agents in continuous control tasks. We focus on the model-free reinforcement learning (RL) setting and formalize our approach in terms of an information-theoretic constraint on the complexity of learned policies. We show that our approach emerges in a principled fashion from the application of rate-distortion theory. We implement a novel Capacity-Limited Actor-Critic (CLAC) algorithm and situate it within a broader family of RL algorithms such as the Soft Actor Critic (SAC) and Mutual Information Reinforcement Learning (MIRL) algorithm. Our experiments using continuous control tasks show that compared to alternative approaches, CLAC offers improvements in generalization between training and modified test environments. This is achieved in the CLAC model while displaying the high sample efficiency of similar methods.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 2; 2025: 2; 2026: 1.
6 papers.
- 2024Position: Theory of Mind Benchmarks are Broken for Large Language Modelscited by 31
- 2024Enabling Realtime Reinforcement Learning at Scale with Staggered Asynchronous Inferencecited by 7
- 2025The Effectiveness of Approximate Regularized Replay for Efficient Supervised Fine-Tuning of Large Language Modelscited by 2
- 2025On Policy Stochasticity in Mutual Information Optimal Control of Linear Systemscited by 1
- 2021Deep imagination is a close to optimal policy for planning in large decision trees under limited resourcescited by 0
- 2026Mutual Information Optimal Density Control of Linear Systems and Generalized Schr"odinger Bridges with Reference Refinementcited by 0
- 2026Mutual Information Optimal Density Control of Linear Systems and Generalized Schr"odinger Bridges with Reference Refinement10 May 2026
- 2025The Effectiveness of Approximate Regularized Replay for Efficient Supervised Fine-Tuning of Large Language Models26 Dec 2025
- 2025On Policy Stochasticity in Mutual Information Optimal Control of Linear Systems29 Jul 2025
- 2024Position: Theory of Mind Benchmarks are Broken for Large Language Models27 Dec 2024
- 2024Enabling Realtime Reinforcement Learning at Scale with Staggered Asynchronous Inference18 Dec 2024
- 2021Deep imagination is a close to optimal policy for planning in large decision trees under limited resources13 Apr 2021