Bingo: Boosting Efficient Reasoning of LLMs via Dynamic and Significance-based Reinforcement Learning

Hanbing Liu, Lang Cao, Yuanyi Ren, Mengyu Zhou, Haoyu Dong +3 more
6/9/2025
cs.LGcs.CL

No official code found. Best implementation: microsoft/Bingo (6 stars, MIT, last commit 2026-04-13).

Abstract

Large language models have demonstrated impressive reasoning capabilities, yet they often suffer from inefficiencies due to unnecessarily verbose or redundant outputs. While many works have explored reinforcement learning (RL) to enhance reasoning abilities, most primarily focus on improving accuracy, with limited attention to reasoning efficiency. Some existing approaches introduce direct length-based rewards to encourage brevity, but this often leads to noticeable drops in accuracy. In this paper, we propose Bingo, an RL framework that advances length-based reward design to boost efficient reasoning. Bingo incorporates two key mechanisms: a significance-aware length reward, which gradually guides the model to reduce only insignificant tokens, and a dynamic length reward, which initially encourages elaborate reasoning for hard questions but decays over time to improve overall efficiency. Experiments across multiple reasoning benchmarks show that Bingo improves both accuracy and efficiency. It outperforms the vanilla reward and several other length-based reward baselines in RL, achieving a favorable trade-off between accuracy and efficiency. These results underscore the potential of training LLMs explicitly for efficient reasoning.

View on arXivView PDF

Code Implementations(1)

microsoft/BingoCommunity58%
MIT

[Preprint'25] Code and data repo of the paper "BINGO: Boosting Efficient Reasoning of LLMs via Dynamic and Significance-based Reinforcement Learning"

62Shell, PythonAug 8, 20256 months agoMIT

Similar Papers

Cite this paper

@article{liu2025bingo,
  title  = {Bingo: Boosting Efficient Reasoning of LLMs via Dynamic and Significance-based Reinforcement Learning},
  author = {Hanbing Liu and Lang Cao and Yuanyi Ren and Mengyu Zhou and Haoyu Dong and Xiaojun Ma and Shi Han and Dongmei Zhang},
  year   = {2025},
  eprint = {2506.08125},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.08125v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.08125.svg)](https://codeofpaper.com/paper/2506.08125)

Discussion