Yibo Wang
Author directoryOther people with similar names: Yibo Wang, Yibo Wang
Unverified author pages with similar names: Yibo Wang
2026
O1-Pruner: Length-Harmonizing Fine-Tuning for O1-Like Reasoning Pruning
Haotian Luo | Haiying He | Yibo Wang | Shiwei Liu | Wei Li | Xiaochun Cao | Dacheng Tao | Naiqiang Tan | Li Shen
Findings of the Association for Computational Linguistics: ACL 2026
Haotian Luo | Haiying He | Yibo Wang | Shiwei Liu | Wei Li | Xiaochun Cao | Dacheng Tao | Naiqiang Tan | Li Shen
Findings of the Association for Computational Linguistics: ACL 2026
Recently, long-thought reasoning LLMs, such as OpenAI’s O1, adopt extended reasoning processes similar to how humans ponder over complex problems. This reasoning paradigm significantly enhances the model’s problem-solving abilities and achieves promising results. However, long-thought reasoning process leads to a substantial increase in inference time. A pressing challenge is reducing the inference overhead of long-thought LLMs while ensuring accuracy. In this paper, we identify that long-thought reasoning models struggle to effectively allocate token budgets based on problem difficulty and reasoning redundancies. To address this, we propose Length-Harmonizing Fine-Tuning (O1-Pruner), aiming at minimizing reasoning overhead while maintaining accuracy. This effective fine-tuning method first estimates the LLM’s baseline performance through pre-sampling and then uses RL-style fine-tuning to encourage the model to generate shorter reasoning processes under accuracy constraints. This allows the model to achieve efficient reasoning with lower redundancy while maintaining accuracy. Experiments on various mathematical reasoning benchmarks show that O1-Pruner not only significantly reduces inference overhead but also achieves higher accuracy, providing a novel and promising solution to this challenge.
Beyond ’Aha!’: Toward Systematic Meta-Abilities Alignment in Large Reasoning Models
Zhiyuan Hu | Yibo Wang | Hanze Dong | Yuhui Xu | Amrita Saha | Caiming Xiong | Bryan Hooi | Junnan Li
Findings of the Association for Computational Linguistics: ACL 2026
Zhiyuan Hu | Yibo Wang | Hanze Dong | Yuhui Xu | Amrita Saha | Caiming Xiong | Bryan Hooi | Junnan Li
Findings of the Association for Computational Linguistics: ACL 2026
Large reasoning models (LRMs) already possess a latent capacity for long chain-of-thought reasoning. Prior work has shown that outcome-based reinforcement learning (RL) can incidentally elicit advanced reasoning behaviors such as self-correction, backtracking, and verification–phenomena often referred to as the model’s ”aha moment”. However, the timing and consistency of these emergent behaviors remain unpredictable and uncontrollable, limiting the scalability and reliability of LRMs’ reasoning capabilities. To address these limitations, we move beyond reliance on prompts and unpredictable ”aha moments”. Instead, we explicitly align models with three meta-abilities: deduction, induction, and abduction, using automatically generated, self-verifiable tasks. Our three-stage pipeline (individual alignment, parameter-space merging, domain-specific reinforcement learning) boosts performance by over 10% relative to instruction-tuned baselines. Furthermore, domain-specific RL from the aligned checkpoint yields an additional gain in performance ceiling for both 7B and 32B models across math, coding, and science benchmarks, showing that explicit meta-ability alignment offers a scalable and dependable foundation for reasoning. Code and data can be found in Software and Data part in submission page.
VTC-R1: Vision-Text Compression for Efficient Long-Context Reasoning
Yibo Wang | Yongcheng Jing | Shunyu Liu | Hao Guan | Rong-Cheng Tu | Chengyu Wang | Jun Huang | Dacheng Tao
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yibo Wang | Yongcheng Jing | Shunyu Liu | Hao Guan | Rong-Cheng Tu | Chengyu Wang | Jun Huang | Dacheng Tao
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Long-context reasoning has significantly empowered large language models to tackle complex tasks, yet it introduces severe efficiency bottlenecks due to the computational complexity. Existing efficient approaches often rely on complex additional training or external models for compression, which limits scalability and discards critical fine-grained information. In this paper, we first propose VTC-R1, a new efficient reasoning paradigm that integrates vision-text compression into iterative reasoning. Instead of processing lengthy textual traces, VTC-R1 renders intermediate reasoning segments into compact images, which are iteratively fed back into vision-language models as "optical memory". We construct a training dataset based on OpenR1-Math-220K achieving 3.4× token compression and fine-tune representative VLMs–Glyph and Qwen3-VL. Extensive experiments on benchmarks such as MATH500, AIME25, AMC23 and GPQA-D demonstrate that VTC-R1 consistently outperforms standard long-context reasoning. And VTC-R1 improves inference efficiency, achieving 2.7× speedup in end-to-end latency, highlighting its potential as a scalable solution for reasoning-intensive applications.