mlsanityData to 14 Oct 2026

HEFT: A Coarse-to-Fine Hierarchy for Enhancing the Efficiency and Accuracy of Language Model Reasoning

arXiv 2509.09801 ↗First posted 11 Sep 2025cs.CL cs.AI cs.LGcited by 0

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

The adaptation of large language models (LLMs) to specialized reasoning tasks is fundamentally constrained by computational resources. Parameter-Efficient Fine-Tuning (PEFT) methods have emerged as a powerful solution, yet the landscape of these techniques is diverse, with distinct methods operating in either the model's weight space or its representation space. This paper investigates the hypothesis that a synergistic combination of these paradigms can unlock superior performance and efficiency. We introduce HEFT (Hierarchical Efficient Fine-Tuning), a novel hierarchical adaptation strategy that composes two distinct PEFT methods in a coarse-to-fine manner: first, a broad, foundational adaptation in the weight space using Low-Rank Adaptation (LoRA), followed by a precise, surgical refinement of internal activations using Representation Fine-Tuning (ReFT). We evaluate this approach by fine-tuning a Llama-2-7B model on the BoolQ benchmark, a challenging dataset for inferential reasoning. Our results reveal a profound synergistic effect. A model fine-tuned for only three epochs with our HEFT strategy achieves an accuracy of 85.17%, exceeding the performance of models trained for 20 epochs with either LoRA-only (85.05%) or ReFT-only (83.36%) methodologies. This work demonstrates that the thoughtful composition of PEFT methods is a potent algorithmic innovation, offering a more efficient and effective path toward advancing the reasoning capabilities of language models. By achieving superior results with a fraction of the computational budget, our findings present a principled approach to overcoming the obstacles inherent in adapting large-scale models for complex cognitive tasks.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 19 of its 20 references that are in the map. First posted on arXiv 11 Sep 2025.

Builds on

19 of 20 references.

Closest ancestors · 1

Same direction, newest first

  1. 2025Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models20 Mar

Other references · 18

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  4. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  5. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  6. 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
  7. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
  8. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 896
  9. 2022Towards Reasoning in Large Language Models: A Surveycited by 596
  10. 2023The Falcon Series of Open Language Modelscited by 535
  11. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 377
  12. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
6 more
  1. 2024ReFT: Representation Finetuning for Language Modelscited by 197
  2. 2022On the Effectiveness of Parameter-Efficient Fine-Tuningcited by 141
  3. 2024LoRA vs Full Fine-tuning: An Illusion of Equivalencecited by 109
  4. 2025A Survey on Parameter-Efficient Fine-Tuning for Foundation Models in Federated Learningcited by 17
  5. 2024Does Combining Parameter-efficient Modules Improve Few-shot Transfer Accuracy?cited by 9
  6. 2025FedReFT: Federated Representation Fine-Tuning with All-But-Me Aggregationcited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025UFT: Unifying Supervised and Reinforcement Fine-Tuning
  2. 2026The Fine-Tuning Trap: Evaluating Negative Transfer and the Role of PEFT in Sub-1B Mathematical Reasoning
  3. 2026Flexi-LoRA with Input-Adaptive Ranks: Efficient Finetuning for Speech and Reasoning Tasks
  4. 2025Enhancing Large Language Model Reasoning via Selective Critical Token Fine-Tuning
  5. 2025The First Few Tokens Are All You Need: An Efficient and Effective Unsupervised Prefix Fine-Tuning Method for Reasoning Models
  6. 2024KaSA: Knowledge-Aware Singular-Value Adaptation of Large Language Models
  7. 2023Towards Better Parameter-Efficient Fine-Tuning for Large Language Models: A Position Paper
  8. 2025DiaBlo: Diagonal Blocks Are Sufficient For Finetuning