Latent reasoners think in continuous vectors, so standard token-level RL does not apply. SLPO defines a surrogate likelihood over latent transitions, cold-starts a stop head from answer correctness, and optimizes with RLOO/GRPO — unlocking Pass@k style scaling without decoding every thought as text.
Supervise continue-vs-stop from verifiable answers over candidate latent lengths, before any RL.
Score continuous transitions with a diagonal-Gaussian density from MC-dropout forwards, jointly with answer and stopping likelihoods.
Adaptive stopping reallocates latent compute at inference, improving Acc and Pass@k on COCONUT and CODI.
If you find SLPO useful, please cite:
@misc{you2026slpo,
title = {SLPO: Scaling Latent Reasoning via a Surrogate Policy},
author = {You, Runyang and Liu, Zhiyuan and Li, Yongqi and Li, Wenjie},
year = {2026},
eprint = {2607.19691},
archivePrefix = {arXiv},
primaryClass = {cs.CL},
url = {https://arxiv.org/abs/2607.19691}
}