LoGRA: Scaling LLM Reinforcement Learning with Low-Rank Gradient Sketches
AuthorsShaokun Zhang, Yifan Zhang, Jian Hu, Yueying Li, Hao Zhang, Binfeng Xu, Jan Kautz, Yi Dong
AffiliationsNVIDIA
LoGRA makes reinforcement learning for large language models more memory-efficient by compressing gradients and controlling update size.
Key results
Average training memory reduction versus dense training.
Average training memory reduction versus dense training.
Qwen3.8-27B trained with LoGRA while dense Adam ran out of memory.
The Qwen3.8-27B run exceeded this many steps on one eight-GPU node.
Peak Reasoning-Gym Hard score during the 27B training run.
What the paper found
NVIDIA’s LoGRA reduces the memory burden of reinforcement-learning post-training by accumulating low-rank gradient sketches directly during backpropagation, rather than storing full gradients. For each selected attention or MLP matrix, it stores a compact projected gradient and applies the resulting low-rank update; the same factors also synchronize the updated policy with the rollout engine. A predicted-KL controller estimates how much an update will change next-token probabilities and scales the step to respect a chosen policy-change budget. On Qwen models evaluated with DAPO-Math-7.5K and MATH-500, LoGRA cuts average training memory by 21.8% at 1.5B and 45.7% at 7B, while retaining competitive reasoning performance. It also makes 27B-model RL training practical: Qwen3.8-27B trained for over 1100 steps on a single eight-GPU node, where dense Adam ran out of memory, and its Reasoning-Gym Hard held-out score rose from 39.69% to a peak of 65.52%. The key contribution is combining compressed gradients, compact policy synchronization, and KL-based step control to make larger-scale RL training feasible without relying on adapter-only updates.
Original abstract
Reinforcement learning (RL) has greatly advanced the capabilities of large language models (LLMs), but its memory demands remain a barrier to broader adoption. We introduce LoGRA, an approach to RL post-training that reduces memory by retaining useful learning signals in low-rank gradient sketches. These compact representations support both model updates and efficient policy synchronization. To prevent overly large updates from disrupting learning, we complement gradient compression with predicted-KL step control, which estimates policy changes before applying each update and adjusts its magnitude accordingly. Across reasoning tasks, LoGRA reduces average training memory by up to 45.7\% without sacrificing performance. It also enables stable training of a 27B-parameter model for over 1,100 steps on a single eight-GPU node, where dense Adam runs out of memory, making previously memory-infeasible RL training practical. Code is available in the \href{https://github.com/skzhang1/labs-molt/tree/logra/examples/scripts/logra}{Molt library}.
Read the original paperMore in Reinforcement Learning
Browse all 57 papers →Gains and Collapse in On-Policy Distillation:A Reinforcement Learning Perspective
Han Cui, Jianhao Yan, Yun Luo, Hongbo Zhang, Zhizhang Fu, Yue Zhang
This paper explains why on-policy distillation can either improve language models or make them repetitive by amplifying behaviors that a teacher implicitly rewards.
Self-Retrospection Distillation: Turning Post-hoc Experiences into Prior Foresight
Haoxiang Zhang, Qinglin Chen, Hiroaki Hayashi, Zhuofeng Li, Siming Zhang, Jiaxin Zhang, Jixuan Chen, Fang Wu, Pan Lu, Silvio Savarese, Julian McAuley, Chien-Sheng Wu
SRD turns an agent’s hindsight about completed attempts into foresight that improves future decisions, especially when reinforcement-learning rewards provide little or no learning signal.
Res-HIL: Human-Guided Residual Reinforcement Learning for Sample-Efficient Dexterous Manipulation
Mariia Iavorskaia, Christian Dietz, Sebastian Albrecht, Majid Khadiv
Res-HIL lets humans efficiently improve robot manipulation skills by teaching a small corrective policy on top of an existing imitation policy.