Autoregressive policies achieve real-time execution via tokenization horizon adjustment and constrained decoding

The paper proposes that autoregressive policies can achieve real-time execution by adjusting the tokenization horizon and applying constrained decoding, thereby guaranteeing strict latency bounds and enabling multi-trajectory decoding. In simulated and real-world environments, the autoregressive policy significantly improves task completion speed over synchronous inference and consistently outperforms equivalent-level flow-matching policies. The authors note that autoregressive policies also have inherent advantages of faster convergence and better generalization in instruction following. The work was published at CoRL 2026.