← 返回论文检索
ICML 2026PosterAccept (regular)

Re-FORC: Adaptive Reward Prediction for Efficient Chain-of-Thought Reasoning

Renos Zabounidis, Aditya Golatkar, Michael Kleinman, Alessandro Achille, Wei Xia, Stefano Soatto

School of Computer Science, Carnegie Mellon University · Amazon · UCLA · Amazon Web Services

PDF 由论文原始站点提供,PaperCompass 不保存论文文件。

摘要

We propose Re-FORC, an adaptive reward prediction method that, given a context, enables prediction of the expected future rewards as a function of the number of future thinking tokens. Re-FORC trains a lightweight adapter on reasoning models, demonstrating improved prediction with longer reasoning and larger models. Re-FORC enables: 1) early stopping of unpromising reasoning chains, reducing compute by 26\% while maintaining accuracy, 2) optimized model and thinking length selection that achieves 4\% higher accuracy at equal compute and 55\% less compute at equal accuracy compared to the largest model, 3) adaptive test-time scaling, which increases accuracy by 11\% in high compute regime, and 7\% in low compute regime. Re-FORC allows dynamic reasoning with length control via cost-per-token thresholds while estimating computation time upfront.