Identifying Policy Gradient Subspaces
Not on the map. Why?
Abstract (arXiv)
Policy gradient methods hold great potential for solving complex continuous control tasks. Still, their training efficiency can be improved by exploiting structure within the optimization problem. Recent work indicates that supervised learning can be accelerated by leveraging the fact that gradients lie in a low-dimensional and slowly-changing subspace. In this paper, we conduct a thorough evaluation of this phenomenon for two popular deep policy gradient methods on various simulated benchmark tasks. Our results demonstrate the existence of such gradient subspaces despite the continuously changing data distribution inherent to reinforcement learning. These findings reveal promising directions for future work on more efficient reinforcement learning, e.g., through improving parameter-space exploration or enabling second-order optimization.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 30 of its 46 references that are in the map. First posted on arXiv 12 Jan 2024.
Builds on
30 of 46 references.
References · 30
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2018QT-Opt: Scalable Deep Reinforcement Learning for Vision-Based Robotic Manipulationcited by 730
- 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 658
- 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 555
- 2020dm_control: Software and Tasks for Continuous Controlcited by 368
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
- 2016Deep Reinforcement Learning for Robotic Manipulation with Asynchronous Off-Policy Updatescited by 342
- 2018Multi-Goal Reinforcement Learning: Challenging Robotics Environments and Request for Researchcited by 256
- 2018Gradient Descent Happens in a Tiny Subspacecited by 208
- 2017Parameter Space Noise for Explorationcited by 158
18 more
- 2023Extreme Parkour with Legged Robotscited by 120
- 2018Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learningcited by 101
- 2020Bypassing the Ambient Dimension: Private SGD with Gradient Subspace Identificationcited by 88
- 2021A Survey of Exploration Methods in Reinforcement Learningcited by 68
- 2021Subspace Adversarial Trainingcited by 41
- 2021How many degrees of freedom do we need to train deep networks: a loss landscape perspectivecited by 28
- 2022Building a Subspace of Policies for Scalable Continual Learningcited by 28
- 2022DEP-RL: Embodied Exploration for Reinforcement Learning in Overactuated and Musculoskeletal Systemscited by 27
- 2021Is High Variance Unavoidable in RL? A Case Study in Continuous Controlcited by 26
- 2020Improving Neural Network Training in Low Dimensional Random Basescited by 19
- 2021Learning a subspace of policies for online adaptation in Reinforcement Learningcited by 14
- 2013Fast large-scale optimization by unifying stochastic gradient and quasi-Newton methodscited by 9
- 2022Cliff Diving: Exploring Reward Surfaces in Reinforcement Learning Environmentscited by 9
- 2022Few-Shot Learning by Dimensionality Reduction in Gradient Spacecited by 8
- 2022A Novel Stochastic Gradient Descent Algorithm for Learning Principal Subspacescited by 7
- 2020Quasi-Newton's method in the class gradient defined high-curvature subspacecited by 3
- 2021Unified Data Collection for Visual-Inertial Calibration via Deep Reinforcement Learningcited by 3
- 2023The Ladder in Chaos: A Simple and Effective Improvement to General DRL Algorithms by Policy Path Trimming and Boostingcited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 4.
5 papers.
- 2024Does SGD really happen in tiny subspaces?cited by 35
- 2025SubTrack++ : Gradient Subspace Tracking for Scalable LLM Trainingcited by 14
- 2025Low-Rank Agent-Specific Adaptation (LoRASA) for Multi-Agent Policy Learningcited by 4
- 2025Geometrically Principled Randomized Optimization for Efficient LLM Trainingcited by 1
- 2025Can We Optimize Deep RL Policy Weights as Trajectory Modeling?cited by 0
- 2025Geometrically Principled Randomized Optimization for Efficient LLM Training2 Oct 2025
- 2025Can We Optimize Deep RL Policy Weights as Trajectory Modeling?6 Mar 2025
- 2025Low-Rank Agent-Specific Adaptation (LoRASA) for Multi-Agent Policy Learning8 Feb 2025
- 2025SubTrack++ : Gradient Subspace Tracking for Scalable LLM Training3 Feb 2025
- 2024Does SGD really happen in tiny subspaces?25 May 2024