Pith. sign in

REVIEW 7 cited by

Unlocking Efficient Long-to-Short LLM Reasoning with Model Merging

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.20641 v2 pith:NHRPTQBL submitted 2025-03-26 cs.CL

classification cs.CL
keywords reasoningmergingmodelmodelssystemwhileefficiencyefficient
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The transition from System 1 to System 2 reasoning in large language models (LLMs) has marked significant advancements in handling complex tasks through deliberate, iterative thinking. However, this progress often comes at the cost of efficiency, as models tend to overthink, generating redundant reasoning steps without proportional improvements in output quality. Long-to-Short (L2S) reasoning has emerged as a promising solution to this challenge, aiming to balance reasoning depth with practical efficiency. While existing approaches, such as supervised fine-tuning (SFT), reinforcement learning (RL), and prompt engineering, have shown potential, they are either computationally expensive or unstable. Model merging, on the other hand, offers a cost-effective and robust alternative by integrating the quick-thinking capabilities of System 1 models with the methodical reasoning of System 2 models. In this work, we present a comprehensive empirical study on model merging for L2S reasoning, exploring diverse methodologies, including task-vector-based, SVD-based, and activation-informed merging. Our experiments reveal that model merging can reduce average response length by up to 55% while preserving or even improving baseline performance. We also identify a strong correlation between model scale and merging efficacy with extensive evaluations on 1.5B/7B/14B/32B models. Furthermore, we investigate the merged model's ability to self-critique and self-correct, as well as its adaptive response length based on task complexity. Our findings highlight model merging as a highly efficient and effective paradigm for L2S reasoning, offering a practical solution to the overthinking problem while maintaining the robustness of System 2 reasoning. This work can be found on Github https://github.com/hahahawu/Long-to-Short-via-Model-Merging.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Scaling Up, Speeding Up: A Benchmark of Speculative Decoding for Efficient LLM Test-Time Scaling

    cs.CL 2025-08 conditional novelty 6.0 of 10

    N-gram based speculative decoding methods, especially SAM and hybrid SAM[EAGLE-3], achieve strong speedups in LLM test-time scaling by exploiting repetitive reasoning patterns.

  2. MiCoTA: Bridging the Learnability Gap with Intermediate CoT and Teacher Assistants

    cs.CL 2025-07 conditional novelty 6.0 of 10

    Training small language models on intermediate-length reasoning chains from a merged mid-sized teacher assistant improves their math reasoning scores over direct distillation from a large teacher.

  3. Learning Composable Chains-of-Thought

    cs.CL 2025-05 conditional novelty 6.0 of 10

    Training atomic reasoning models on prefix and suffix tagged CoT data, then merging or multitask-combining them, improves compositional generalization on unseen skill combinations.

  4. Thinking Fast and Right: Balancing Accuracy and Reasoning Length with Adaptive Rewards

    cs.CL 2025-05 conditional novelty 6.0 of 10

    An adaptive length-penalty reward for RL-trained LLMs reduces reasoning length by over 50% with small accuracy loss by automatically tightening and relaxing the penalty based on the model's current accuracy.

  5. Anchoring Refusal Direction: Mitigating Safety Risks in Tuning via Projection Constraint

    cs.CL 2025-09 conditional novelty 5.0 of 10

    ProCon anchors each sample's hidden-state projection onto the LLM's initial refusal direction during instruction fine-tuning, reducing refusal-direction drift and safety risks with limited task-performance loss.

  6. Reasoning on a Budget: A Survey of Adaptive and Controllable Test-Time Compute in LLMs

    cs.AI 2025-07 conditional novelty 5.0 of 10

    The survey's L1/L2 taxonomy and benchmark show that current reasoning models waste compute on easy problems and underthink hard ones, motivating more adaptive inference.

  7. Towards Concise and Adaptive Thinking in Large Reasoning Models: A Survey

    cs.AI 2025-07 conditional novelty 3.0 of 10

    A comprehensive review that categorizes methods for shortening and adaptively triggering chain-of-thought reasoning in large language models.

Pith tools