Abstract:This work reformulates language generation as a stochastic optimal control problem, providing a unified theoretical perspective to analyze autoregressive and diffusion models and explain their limitations (Efficiency-Fidelity Paradox, Irreversibility Error Propagation, Optimization Tractability and Fidelity) in terms of combination of trajectory singularity, adjoint state vanishing, and gradient absence. To address these issues, we approximate the solution to the Hamilton-Jacobi-Bellman (HJB) equation, yielding an optimal policy that acts as a closed-loop controller. To bypass the intractability of directly solving the HJB PDE, we employ Flow Matching as the optimal trajectory solver within the rectified latent control space. This allows our Manta-LM with Global Integral Operator to approximate the global vector field, effectively realizing a model that simultaneously achieves high-fidelity text generation and efficient, low-cost parallel sampling. Empirically, our method achieves strong performance on language modeling and conditional generation tasks, while exhibiting improved stability, efficiency, and controllability.
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2605.14531 [cs.CL] |
| (or arXiv:2605.14531v1 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2605.14531 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Ziyi Dong [view email]
[v1]
Thu, 14 May 2026 08:13:43 UTC (4,241 KB)