Weak-Driven Learning: How Weak Agents make Strong Agents Stronger
Zehao Chen, Gongxun Li, Tianxiang Ai, Yifei Li, Zixuan Huang, Wang Zhou, Fuzhen Zhuang, Xianglong Liu, Jianxin Li, Deqing Wang, Yikun Ban
TL;DR
Weak-Driven Learning reframes post-training optimization by using weaker historical checkpoints as corrective signals to extend learning beyond saturation. The WMSS framework jointly trains a strong agent with a weak reference via logit mixing, guided by a curriculum that emphasizes informative, hard regions and correction of forgetting. Theoretical analysis shows gradient amplification for hard negatives and sustained learning pressure in saturated regimes, while experiments on math reasoning and code generation demonstrate consistent, cost-free inference gains across model scales. This approach offers a data-efficient, self-reinforcing path to stronger agents without increasing inference cost or relying on external teachers.
Abstract
As post-training optimization becomes central to improving large language models, we observe a persistent saturation bottleneck: once models grow highly confident, further training yields diminishing returns. While existing methods continue to reinforce target predictions, we find that informative supervision signals remain latent in models' own historical weak states. Motivated by this observation, we propose WMSS (Weak Agents Can Make Strong Agents Stronger), a post-training paradigm that leverages weak checkpoints to guide continued optimization. By identifying recoverable learning gaps via entropy dynamics and reinforcing them through compensatory learning, WMSS enables strong agents to improve beyond conventional post-training saturation. Experiments on mathematical reasoning and code generation datasets show that agents trained with our approach achieve effective performance improvements, while incurring zero additional inference cost.
