Fast LLM Post-training via Decoupled and Fastest-of-N Speculation

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Cheng, Rongxin, Zhou, Kai, Wei, Xingda, Liu, Siyuan, Han, Mingcong, Ai, Mingjing, Zhou, Yeju, Zhong, Baoquan, Xiao, Wencong, Chen, Rong, Chen, Haibo
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866917165244874752
author Cheng, Rongxin
Zhou, Kai
Wei, Xingda
Liu, Siyuan
Han, Mingcong
Ai, Mingjing
Zhou, Yeju
Zhong, Baoquan
Xiao, Wencong
Chen, Rong
Chen, Haibo
author_facet Cheng, Rongxin
Zhou, Kai
Wei, Xingda
Liu, Siyuan
Han, Mingcong
Ai, Mingjing
Zhou, Yeju
Zhong, Baoquan
Xiao, Wencong
Chen, Rong
Chen, Haibo
contents Rollout dominates the training time in large language model (LLM) post-training, where the trained model is used to generate tokens given a batch of prompts. This work, SpecActor, achieves fast rollout with speculative decoding that deploys a fast draft path to accelerate the unparallelizable generation, while the correctness is guaranteed by fast parallel verification of the outputs with the original model. SpecActor addresses two foundational challenges that hinder speculation efficiency: (1) a Decoupled speculation method that overcomes the computation inefficiency issue when executing speculative decoding with relative large per-worker batch size -- a common configuration in training but unfriendly to speculation, and (2) a Fastest-of-N speculation method that selects and combines different draft methods according to the rollout progress to approximate the optimal draft method even when the best one is unknown a priori. Extensive evaluations on production traces show that SpecActor accelerates mean rollout speed by 2.0--2.4x, with up to 2.7x speedup, over common post-training baselines. The results are consistent across both dense and MoE models and across different RL algorithms. Notably, SpecActor is 1.1--2.6x faster compared to vanilla speculative rollout in different traces. The accelerated rollout achieves 1.4--2.3x faster end-to-end training time.
format Preprint
id arxiv_https___arxiv_org_abs_2511_16193
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Fast LLM Post-training via Decoupled and Fastest-of-N Speculation
Cheng, Rongxin
Zhou, Kai
Wei, Xingda
Liu, Siyuan
Han, Mingcong
Ai, Mingjing
Zhou, Yeju
Zhong, Baoquan
Xiao, Wencong
Chen, Rong
Chen, Haibo
Distributed, Parallel, and Cluster Computing
Artificial Intelligence
Rollout dominates the training time in large language model (LLM) post-training, where the trained model is used to generate tokens given a batch of prompts. This work, SpecActor, achieves fast rollout with speculative decoding that deploys a fast draft path to accelerate the unparallelizable generation, while the correctness is guaranteed by fast parallel verification of the outputs with the original model. SpecActor addresses two foundational challenges that hinder speculation efficiency: (1) a Decoupled speculation method that overcomes the computation inefficiency issue when executing speculative decoding with relative large per-worker batch size -- a common configuration in training but unfriendly to speculation, and (2) a Fastest-of-N speculation method that selects and combines different draft methods according to the rollout progress to approximate the optimal draft method even when the best one is unknown a priori. Extensive evaluations on production traces show that SpecActor accelerates mean rollout speed by 2.0--2.4x, with up to 2.7x speedup, over common post-training baselines. The results are consistent across both dense and MoE models and across different RL algorithms. Notably, SpecActor is 1.1--2.6x faster compared to vanilla speculative rollout in different traces. The accelerated rollout achieves 1.4--2.3x faster end-to-end training time.
title Fast LLM Post-training via Decoupled and Fastest-of-N Speculation
topic Distributed, Parallel, and Cluster Computing
Artificial Intelligence
url https://arxiv.org/abs/2511.16193