Reinforced Context Order Recovery for Adaptive Reasoning and Planning

Long Ma (School of Software Technology, Dalian University of Technology) · Fangwei Zhong (Beijing Normal University) · Yizhou Wang (Peking University)
$\mathcal{v}$-information frameworkadaptive selectionadaptive token generationcausal language modelsdata-dependent token generationdiscrete diffusion modelsground-truth orderlogical ordermodel performanceoracle modelsplanning datasetsreasoning datasetsreinforced context order recoveryreinforcement learningself-supervised learningtoken prediction statistics

Modern causal language models, followed by rapid developments in discrete diffusion models, can now produce a wide variety of interesting and useful content. However, these families of models are predominantly trained to output tokens with a fixed (left-to-right) or random order, which may deviate from the logical order in which tokens are generated originally. In this paper, we observe that current causal and diffusion models encounter difficulties in problems that require adaptive token generation orders to solve tractably, which we characterize with the $\mathcal{V}$-information framework. Motivated by this, we propose Reinforced Context Order Recovery (ReCOR), a reinforcement-learning-based framework to extract adaptive, data-dependent token generation orders from text data without annotations. Self-supervised by token prediction statistics, ReCOR estimates the hardness of predicting every unfilled token and adaptively selects the next token during both training and inference. Experiments on challenging reasoning and planning datasets demonstrate the superior performance of ReCOR compared with baselines, sometimes outperforming oracle models supervised with the ground-truth order.