Paper Overview
- Field: Machine Learning
- Authors: Jinya Sakurai, Xun Xu, Jaehong Yoon
- Published: 2026-10-22
- arXiv: 2610.31576
- The team trains a learned unmasking policy on trajectory-contraction targets, using both token confidence and hidden states.
- The resulting 856K-parameter policy achieves the best accuracy–NFE frontier and the highest throughput on GSM8K with LLaDA-8B-Instruct.
- The policy largely transfers to Dream-7B-Instruct without task-specific retraining, demonstrating generalization across masked diffusion models.
Abstract
Masked diffusion language models generate tokens in parallel, but efficiency depends on which predictions are committed. The authors find that labeling predictions matching the final output is overly permissive at low NFE (number of function evaluations), and hidden states are weak alone but can complement confidence-based signals. About a 10% NFE reduction suffices to offset policy overhead for policies up to 7.5M parameters.
Method and Results
Takeaway
Carefully designed lightweight unmasking policies can meaningfully improve the speed–accuracy trade-off of masked diffusion language models, with overhead costs that are easily repaid by modest NFE savings.
---
*Auto-collected on 2026-10-26*