O1-Pruner: Length-Harmonizing Fine-Tuning for O1-Like Reasoning Pruning (2026.findings-acl)
Copied to clipboard
Haotian Luo, Haiying He, Yibo Wang, Shiwei Liu, Wei Li, Xiaochun Cao, Dacheng Tao, Naiqiang Tan, Li Shen
| Challenge: | Recent long-thought reasoning models adopt extended reasoning processes similar to how humans ponder over complex problems. |
| Approach: | They propose a model that uses RL-style fine-tuning to reduce inference overhead while maintaining accuracy. |
| Outcome: | The proposed model reduces inference overhead while maintaining accuracy. |
Similar Papers
Too Long, Do Re-weighting for Efficient LLM Reasoning Compression (2026.acl-long)
Copied to clipboard
Zhong-Zhi Li, Xiao Liang, Zihao Tang, Lei Ji, Peijie Wang, Haotian Xu, Xing W, Haizhen Huang, Weiwei Deng, Yeyun Gong, Zhijiang Guo, Xiao Liu, Fei Yin, Cheng-Lin Liu
| Challenge: | Large Language Models (LLMs) have recently achieved remarkable progress on complex reasoning tasks by leveraging extended Chain-of-Thought (CoT) techniques. |
| Approach: | They propose a method that uses Extended Chain-of-Thought (EFT) to reduce the number of output tokens by nearly 40% while maintaining the accuracy of the reasoning. |
| Outcome: | The proposed method reduces the number of output tokens by nearly 40% while maintaining the accuracy of the reasoning. |
Correct, Concise and Complete: Multi-stage Training For Adaptive Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) increase test-time computation, often in the form of chain-of-thought (CoT) however, reasoning traces can become unnecessarily long, increasing computation costs without improving accuracy and sometimes even degrading performance. |
| Approach: | They propose a multi-stage efficient reasoning method that combines supervised fine-tuning with reinforcement learning using an adaptive length penalty. |
| Outcome: | The proposed method reduces response length by an average of 28% for 8B models and 40% for 32B models while incurring only minor performance drops of 1.6 and 2.5 points, respectively. |
Beyond Token Length: Step Pruner for Efficient and Accurate Reasoning in Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing reinforcement learning methods for large reasoning models suffer from excessive verbosity, known as "overthinking." Existing models penalize generated tokens to promote conciseness, but these methods encounter two challenges: they may develop hacking behavior in later stages of training by discarding reasoning steps. |
| Approach: | They propose a framework that steers large reasoning models toward more efficient reasoning . they prioritize correctness while imposing penalties for redundant steps . |
| Outcome: | The proposed framework reduces token usage by 69.7% on AIME24. |
One Missing Piece for Open-Source Reasoning Models: A Dataset to Mitigate Cold-Starting Short CoT LLMs in RL (2025.acl-industry)
Copied to clipboard
Hyungjoo Chae, Dongjin Kang, Jihyuk Kim, Beong-woo Kwak, Sunghyun Park, Haeju Park, Jinyoung Yeo, Moontae Lee, Kyungjae Lee
| Challenge: | Existing large reasoning models are limited by their closed nature and high API costs and safety issues. |
| Approach: | They propose to build a long CoT dataset with existing short CoT LLMs that are not trained for inference-time scaling. |
| Outcome: | The proposed model achieves quality comparable to—or slightly below—R1 and is able to think longer and provide control over the thought budget to better manage the overthinking problem. |
Unlocking Recursive Thinking of LLMs: Alignment via Refinement (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for recursive reasoning are limited due to lack of expert-curated data. |
| Approach: | They propose a method that unlocks the potential of Large Language Models for recursive reasoning through long-form Chain of Thought. |
| Outcome: | The proposed method outperforms preference optimization methods on the openAI o1-series models by 20% on 3k synthetic samples. |
Fine-Tuning on Diverse Reasoning Chains Drives Within-Inference CoT Refinement in LLMs (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to generate multiple independent CoTs, combining them through ensembling or other post-hoc strategies, have been shown to be effective in boosting performance. |
| Approach: | They propose a method where LLMs are fine-tuned to generate a sequence of Diverse Chains of Thought (DCoT) within a single inference step. |
| Outcome: | The proposed model can generate multiple chains of thought within a single inference step without external feedback. |
Your Reasoning Model Knows What Counts: Self-Guided Chain-of-Thought Pruning for Efficient Reasoning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to Chain-of-Thought reasoning are often degraded because they disregard the model’s intrinsic reasoning dependency. |
| Approach: | They propose a self-guided pruning framework that leverages the model’s intrinsic likelihood landscape to identify segments that are extraneous to its specific reasoning pattern. |
| Outcome: | The proposed framework reduces output length while maintaining or improving accuracy on multiple benchmarks. |
Structured Pruning for Diverse Best-of-N Reasoning Optimization (2025.findings-acl)
Copied to clipboard
| Challenge: | Extensive experiments on the MATH dataset demonstrate that our method significantly outperforms traditional best-of-N and random head selection strategies. |
| Approach: | They propose a contrastive learning framework that dynamically selects the optimal head and layer to prune during inference by aligning question embeddings with head embedds. |
| Outcome: | The proposed approach outperforms best-of-N and random head selection strategies on the MATH500 and GSM8K datasets. |
Optimizing Length Compression in Large Reasoning Models (2026.acl-long)
Copied to clipboard
| Challenge: | Large Reasoning Models suffer from producing unnecessary and verbose reasoning chains. |
| Approach: | They propose a post-training method that uses a Length Reward and a Compress Reward to remove the invalid portion of the thinking process. |
| Outcome: | The proposed method reduces sequence length by 50% with only a marginal (2%) drop in accuracy. |
Think Clearly: Improving Reasoning via Redundant Token Pruning (2025.findings-emnlp)
Copied to clipboard
Daewon Choi, Jimin Lee, Jihoon Tack, Woomin Song, Saket Dingliwal, Sai Muralidhar Jayanthi, Bhavana Ganesh, Jinwoo Shin, Aram Galstyan, Sravan Babu Bodapati
| Challenge: | Recent large language models show promising capabilities in long-form reasoning . however, they tend to include substantial redundancy in reasoning paths . |
| Approach: | They propose a structure-aware pruning method that prioritizes removing redundant tokens . they remove redundant token and then resume the reasoning generation . |
| Outcome: | The proposed method shows strong performance on reasoning-intensive benchmarks without training. |