Leveraging inference-time search in large language models has proven effective in further enhancing a trained model's capability to solve complex mathematical and reasoning problems. However, this approach significantly increases computational costs and inference time, as the model must generate and evaluate multiple candidate solutions to identify a viable reasoning path. To address this, we propose an effective approach that integrates search capabilities directly into the model by fine-tuning it using both successful (learning) and failed reasoning paths (forgetting) derived from diverse search methods. While fine-tuning the model with these data might seem straightforward, we identify a critical issue: the model's search capability tends to degrade rapidly if fine-tuning is performed naively. We show that this degradation can be substantially mitigated by employing a smaller learning rate. Extensive experiments on the challenging Game-of-24 and Countdown mathematical reasoning benchmarks show that our approach not only outperforms both standard fine-tuning and inference-time search baselines but also significantly reduces inference time by 180.
View on arXiv@article{ni2025_2504.11364,
title={ Teaching Large Language Models to Reason through Learning and Forgetting },
author={ Tianwei Ni and Allen Nie and Sapana Chaudhary and Yao Liu and Huzefa Rangwala and Rasool Fakoor },
journal={arXiv preprint arXiv:2504.11364},
year={ 2025 }
}