An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Models
<|reference_start|>An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Models: The optimal training configurations of large language models (LLMs) with respect to model sizes and compute budgets have been extensively studied. But how to optimally configure LLMs during inference has not been explored in sufficient depth. We study compute-optimal inference: designing models and inference strategies that optimally trade off additional inference-time compute for improved performance. As a first step towards understanding and designing compute-optimal inference methods, we assessed the effectiveness and computational efficiency of multiple inference strategies such as Greedy Search, Majority Voting, Best-of-N, Weighted Voting, and their variants on two different Tree Search algorithms, involving different model sizes and computational budgets. We found that a smaller language model with a novel tree search algorithm typically achieves a Pareto-optimal trade-off. These results highlight the potential benefits of deploying smaller models equipped with more sophisticated decoding algorithms in budget-constrained scenarios, e.g., on end-devices, to enhance problem-solving accuracy. For instance, we show that the Llemma-7B model can achieve competitive accuracy to a Llemma-34B model on MATH500 while using $2\times$ less FLOPs. Our findings could potentially apply to any generation task with a well-defined measure of success.<|reference_end|>
@article{wu2024inference,
    title={Inference Scaling Laws: An Empirical Analysis of Compute-Optimal
  Inference for Problem-Solving with Language Models},
    author={Yangzhen Wu, Zhiqing Sun, Shanda Li, Sean Welleck, Yiming Yang},
    journal={arXiv preprint arXiv:2408.00724},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.00724},
    primaryClass={cs.AI}
}