Timber: Training-free Instruct Model Refining with Base via Effective Rank
Not on the map. Why?
Abstract (arXiv)
Post-training, which elicits a pretrained Base model into the corresponding Instruct model, is widely considered to be superficial. In this work, we first reinforce this hypothesis by providing novel quantitative evidence from the weight level that the effective rank (eRank) remains negligibly changed. However, this superficiality also suffers a critical trade-off, improving the exploitation capabilities at the cost of limiting its exploration. To tackle this issue, we propose Timber, a simple yet effective training-free method that enhances the exploration capability of the Instruct model while preserving its exploitation. The key insight is to partially revert Instruct towards the paired Base model by subtle yet targeted refinement of the weight deltas. Extensive experiments on Llama and Qwen series demonstrate that Timber consistently improves vanilla Instruct models, particularly on Pass@k performance. Our findings offer new insights into the post-training stage at the weight level and practical strategies to refine the Instruct model without training.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 34 of its 39 references that are in the map. First posted on arXiv 28 Sep 2025.
Builds on
34 of 39 references.
References · 34
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2025Qwen3 Technical Reportcited by 8,820
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2023Let's Verify Step by Stepcited by 3,789
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
- 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,392
- 2025s1: Simple test-time scalingcited by 1,341
22 more
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
- 2023Instruction-Following Evaluation for Large Language Modelscited by 1,228
- 2022Mass-Editing Memory in a Transformercited by 1,001
- 2025Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?cited by 982
- 2021Knowledge Neurons in Pretrained Transformerscited by 601
- 2022Towards Reasoning in Large Language Models: A Surveycited by 596
- 2025LIMO: Less is More for Reasoningcited by 498
- 2025Logic-RL: Unleashing LLM Reasoning with Rule-Based Reinforcement Learningcited by 262
- 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunitiescited by 254
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
- 2024When Attention Sink Emerges in Language Models: An Empirical Viewcited by 208
- 2025The Surprising Effectiveness of Negative Reinforcement in LLM Reasoningcited by 162
- 2025Pass@k Training for Adaptively Balancing Exploration and Exploitation of Large Reasoning Modelscited by 138
- 2024Planning In Natural Language Improves LLM Search For Code Generationcited by 83
- 2024Language Models Resist Alignment: Evidence From Data Compressioncited by 53
- 2025Reinforcement Learning Finetunes Small Subnetworks in Large Language Modelscited by 49
- 2025Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectivescited by 48
- 2024Diff-eRank: A Novel Rank-Based Metric for Evaluating Large Language Modelscited by 35
- 2025Towards Higher Effective Rank in Parameter-efficient Fine-tuning using Khatri--Rao Productcited by 10
- 2025Riemannian Optimization for LoRA on the Stiefel Manifoldcited by 10
- 2025How Instruction and Reasoning Data shape Post-Training: Data Quality through the Lens of Layer-wise Gradientscited by 8
- 2024Unconstrained Model Merging for Enhanced LLM Reasoningcited by 7
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.