Skip to content

LeanGRPO: Eliminating Redundant Recomputation in Diffusion RL

Sep 2026 · 0 citations · 62 references
Computer Science

TL;DR

LeanGRPO is presented by restructuring the data-parallel layout and introducing two recompute-free training schedules for trajectory-logprob diffusion RL, which achieves up to 1.83x end-to-end speedup while preserving the original optimization objective.

Abstract

Diffusion reinforcement learning (RL) has recently achieved significant success in post-training image and video generative models. However, most diffusion RL methods, including DanceGRPO and FlowGRPO, recompute selected timesteps with gradient tracking after rollout. Under on-policy training with the same backend for rollout and update, this recomputation is mathematically redundant. Intuitively, the rollout and policy update steps can reuse the same feed-forward backbone to avoid redundant computation, but doing so can incur a large memory overhead during rollout. To address the issue, we present LeanGRPO by restructuring the data-parallel layout and introducing two recompute-free training schedules for trajectory-logprob diffusion RL: (1) LeanGRPO-Retain enables gradient tracking during rollout and directly reuses the resulting computation graphs and saved activations for backward during update, requiring no recomputation; and (2) LeanGRPO-Reweight also enables gradients during rollout, but immediately backpropagates each selected step using a provisional advantage and delays gradient synchronization, then corrects the provisional gradients with the true advantage after the trajectory is completed. These schedules target different model scales and input sizes. Across FlowGRPO/DanceGRPO with FLUX.1-dev and Wan, LeanGRPO achieves up to 1.83x end-to-end speedup while preserving the original optimization objective.

View source

Similar papers

Preprint Aug 2026

Accelerating Visual On-Policy Distillation with Batched Speculative Jacobi Rollouts

Visual on-policy distillation (OPD) improves the training of compact visual autoregressive models by learning from trajectories generated by the current student. However, these online rollouts are still produced token by token with autoregressive decoding, which adds substantial cost to every on-policy training step. S...

Bingqi Shan, Zhehao Yu, Keng-Hong Lin et al. · 0 citations
#natural language process... Preprint Oct 2026

LoGRA: Scaling LLM Reinforcement Learning with Low-Rank Gradient Sketches

Reinforcement learning has greatly advanced the capabilities of large language models, 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 su...

Shao-Kun Zhang, Yi-Fan Zhang, Jian Hu et al. · 0 citations
#machine learning Preprint Aug 2026

HARTS: Efficient Agentic Reinforcement Learning for Hybrid-Attention Models over Arbitrary Rollout Trees

HARTS is the first system to demonstrate arbitrary-rollout-tree prefix-sharing speedups on a real hybrid-attention model, and its numerical differences are comparable to baseline self-rerun variation, and its reward trend is similar to the baseline over the first 120 steps of SWE-bench training.

Bo-Yuan Meng, Pei-Hua Bao, Hong Liu et al. · 0 citations
#machine learning Preprint Sep 2026

Diffusion as a Training Curriculum for Timestep-Free Iterative Reasoning

This work adds a persistent hidden state to a diffusion denoiser and removes its timestep conditioning, leaving a single shared update that can be run to arbitrary depth, and develops an anytime solver that keeps improving with inference depth far beyond the rollout lengths and backpropagation window used in training.

M. Drozdova, Aidan Sirbu, Pietro Miotti et al. · 3 citations
#artificial intelligence Preprint Oct 2026

ThunderSyncRL: Lossless Acceleration of Agentic Reinforcement Learning

Language models are moving beyond generating answers to pursuing long-horizon goals in interactive environments. Post-training these agents requires long, heterogeneous trajectories, and synchronous systems leave learner engines idle until rollout and verification finish. To squeeze out these pipeline bubbles, asynchro...

Seil Kang, Hangoo Kang, Tarun Suresh et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Learn from the Gap: Differential-Aware Advantage Pruning with Adaptive Rollout Sampling for GRPO

This work proposes FastRL, a novel plug-and-play reinforcement learning framework that simultaneously improves training efficiency and the effectiveness of policy learning, and introduces an advantage-aware pruning strategy to selectively preserve high-advantage trajectories while maximizing inter-trajectory gradient d...

Jia-Hua Yang, Zhiwei Yang, Xian-Peng Zhang et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.