arXiv AI By Zhaofeng Zhong, Wei Yuan, Tong Chen, Liang Qu, Xiangyu Zhao, Quoc Viet Hung Nguyen, Hongzhi Yin

QA-Merging: Query-Adaptive Reasoning via Layer Selective Model Merging

Read the original on arXiv AI →

arXiv:2601. 03506v2 Announce Type: replace-cross Abstract: Recent large reasoning models (LRMs) have achieved strong performance on complex reasoning tasks by generating a long chain-of-thought (Long-CoT).

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jun 30

Reconsidering Overthinking: Penalizing Internal and External Redundancy in CoT Reasoning

arXiv:2508. 02178v3 Announce Type: replace Abstract: Large reasoning models (LRMs) often exhibit overthinking, producing verbose Chain-of-Thought (CoT) traces that increase inference cost and obscure the underlying reasoning process.

By Taihang Zhen, Jialiang Hong, Kai Chen, Guang Yang, Junlan Feng, Wenpeng Zhu, Jing Huo, Yang Gao, Depeng Wang, Haitao Wan, Xi Yang, Fanyu Meng, Yuyao Zhang, Ji Qi, Xiangyu Zhou
arXiv AI
Jun 8

DyCon: Dynamic Reasoning Control via Evolving Difficulty Modeling

arXiv:2606. 07108v1 Announce Type: new Abstract: Recent advances in Large Reasoning Models (LRMs) demonstrate remarkable performance improvements by iteratively reflecting, exploring, and executing complex tasks, yet suffer from inefficiencies due to redundant reasoning, known as "overthinking".

By Tengyao Tu, Yulin Li, Hui-Ling Zhen, Libo Qin, Zhoujun Wei, Jinghua Piao, Zhuotao Tian, Yong Li, Min Zhang
Hugging Face Trending Papers
Aug 11

Towards Efficient Reasoning in LLM-Based Recommender Systems via Model Merging

Large language model-based recommender systems are increasingly adopting slow-thinking models that generate step-by-step reasoning before making predictions, often achieving higher accuracy than fast-thinking models that predict directly. However, their reasoning traces are often unnecessarily verbose, increasing inference costs without commensurate accuracy gains.

arXiv Computation and Language
Aug 27

GRIP: Granular Reward-Guided Parameter Interpolation for Efficient Reasoning

GRIP (Granular Reward-guided Interpolation of Parameters) is a lightweight framework that blends a reasoning-oriented large language model with an instruction-tuned model by assigning learnable interpolation ratios to individual modules. The ratios are optimized while keeping both source models frozen, using a reward signal that prefers correct and concise responses. Experiments demonstrate that GRIP improves the accuracy-efficiency trade-off compared to fixed or search-based merging baselines and uncover module-wise fusion patterns linked to efficient reasoning.

By Lam So, Canhui Wu, Han Lin