arXiv Machine Learning

Accelerating Visual On-Policy Distillation with Batched Speculative Jacobi Rollouts

The paper introduces HB‑SJD, a batched Speculative Jacobi Decoding backend that accelerates visual on‑policy distillation (OPD) by allowing images to advance independently and processing multiple tokens in parallel without a draft model. HB‑SJD switches between Full and Compact execution as images finish, reducing rollout and overall training time while maintaining generation quality. Experiments with LlamaGen demonstrate significant speedups without altering the teacher, distillation objective, or optimization procedure.

arXiv AI
Aug 11

RL-Native Distillation: Exploiting Scored Trajectories for Few-Step Image Generation

arXiv:2608. 09226v1 Announce Type: cross Abstract: Efficient text-to-image generation requires both reinforcement-learning (RL)-based reward alignment and few-step distillation, yet these procedures are typically performed sequentially, increasing training cost and risking the loss of reward gains during compression.

By Yuhan Li, Fangao Zeng, Sicong Kang, Mengfei Xu, Hao Zhou, Wei Li, Pipei Huang, Bingbing Ni
Hugging Face Trending Papers
Aug 10

RL-Native Distillation: Exploiting Scored Trajectories for Few-Step Image Generation

Efficient text-to-image generation requires both reinforcement-learning (RL)-based reward alignment and few-step distillation, yet these procedures are typically performed sequentially, increasing training cost and risking the loss of reward gains during compression. We instead take an RL-native perspective: diffusion RL already generates reward-scored finite-step trajectories, whose intermediate states provide a natural source of distillation supervision rather than a disposable byproduct of sampling.

arXiv Computer Vision
Aug 31

Token-Budget Distillation: Transferring Full-Token Semantics to Compressed Video Vision-Language Models

Token-Budget Distillation (TBD) is a parameter‑efficient fine‑tuning framework that adapts video vision‑language models to a fixed token budget. It freezes the pretrained backbone, updates only LoRA adapters, and incorporates FlashVID visual token compression. TBD uses a dual‑path teacher‑student design with full‑token supervision and compressed student optimization, enabling the student to recover full‑token semantics while remaining efficient under aggressive token reduction.

By Xiaoyang Guo, Guoping Luo, Jusheng Zhang, Keze Wang, Wenhao Wang
arXiv Computer Vision
Sep 25

ViRDM: Taming Representation Distribution Matching for Few-Step Causal Video Generation

ViRDM is a new post‑training method for few‑step causal video generation that eliminates the need for a large teacher model and an online critic. By applying representation distribution matching (RDM) with a precomputed target distribution, a lightweight VAE decoder, and staged vector–Jacobian products, ViRDM overcomes memory, optimization, and temporal dynamics challenges. The approach reduces GPU memory usage and training time, achieving state‑of‑the‑art VBench performance with only 20 generator updates and 16 A100 GPU‑hours.

By Zichong Meng, Chongjian Ge, Chun-Hao P. Huang, Yang Zhou, Huaizu Jiang