mlsanityData to 13 Oct 2026

Bias-Restrained Prefix Representation Finetuning for Mathematical Reasoning

arXiv 2511.10707 ↗First posted 13 Nov 2025cs.LG cs.AIcited by 1

On the map: LLM reasoning → Mathematical reasoning

Abstract (arXiv)

Parameter-Efficient finetuning (PEFT) enhances model performance on downstream tasks by updating a minimal subset of parameters. Representation finetuning (ReFT) methods further improve efficiency by freezing model weights and optimizing internal representations with fewer parameters than PEFT, outperforming PEFT on several tasks. However, ReFT exhibits a significant performance decline on mathematical reasoning tasks. To address this problem, the paper demonstrates that ReFT's poor performance on mathematical tasks primarily stems from its struggle to generate effective reasoning prefixes during the early inference phase. Moreover, ReFT disturbs the numerical encoding and the error accumulats during the CoT stage. Based on these observations, this paper proposes Bias-REstrained Prefix Representation FineTuning (BREP ReFT), which enhances ReFT's mathematical reasoning capability by truncating training data to optimize the generation of initial reasoning prefixes, intervening on the early inference stage to prevent error accumulation, and constraining the intervention vectors' magnitude to avoid disturbing numerical encoding. Extensive experiments across diverse model architectures demonstrate BREP's superior effectiveness, efficiency, and robust generalization capability, outperforming both standard ReFT and weight-based PEFT methods on the task of mathematical reasoning. The source code is available at https://github.com/LiangThree/BREP.

Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Placed in Mathematical reasoning, one of 17 directions in LLM reasoning. Builds on 29 of its 52 references that are in the map. First posted on arXiv 13 Nov 2025.

Builds on

29 of 52 references.

References · 29

  1. 2023GPT-4 Technical Reportcited by 18,278
  2. 2024The Llama 3 Herd of Modelscited by 14,486
  3. 2021Training Verifiers to Solve Math Word Problemscited by 9,916
  4. 2025Qwen3 Technical Reportcited by 8,510
  5. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,270
  6. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,898
  7. 2023Qwen Technical Reportcited by 3,310
  8. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,163
  9. 2023PaLM 2 Technical Reportcited by 1,162
  10. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 868
  11. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 865
  12. 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 706
17 more
  1. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 665
  2. 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 654
  3. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 321
  4. 2023Emergent Linear Representations in World Models of Self-Supervised Sequence Modelscited by 316
  5. 2023The Unlocking Spell on Base LLMs: Rethinking Alignment via In-Context Learningcited by 255
  6. 2022Delta Tuning: A Comprehensive Study of Parameter Efficient Methods for Pre-trained Language Modelscited by 180
  7. 2023Parameter-Efficient Orthogonal Finetuning via Butterfly Factorizationcited by 113
  8. 2023Sparse Low-rank Adaptation of Pre-trained Language Modelscited by 96
  9. 2022ATTEMPT: Parameter-Efficient Multi-task Tuning via Attentional Mixtures of Soft Promptscited by 85
  10. 2023Aligning Large Language Models with Human Preferences through Representation Engineeringcited by 71
  11. 2023IncreLoRA: Incremental Parameter Allocation Method for Parameter-Efficient Fine-tuningcited by 45
  12. 2024Advancing Parameter Efficiency in Fine-tuning via Representation Editingcited by 37
  13. 2025Unlocking General Long Chain-of-Thought Reasoning Capabilities of Large Language Models via Representation Engineeringcited by 34
  14. 2025The First Few Tokens Are All You Need: An Efficient and Effective Unsupervised Prefix Fine-Tuning Method for Reasoning Modelscited by 31
  15. 2025Improving Reasoning Performance in Large Language Models via Representation Engineeringcited by 21
  16. 2025Shallow Preference Signals: Large Language Model Aligns Even Better with Truncated Data?cited by 5
  17. 2025Enhancing Chain-of-Thought Reasoning with Critical Representation Fine-tuningcited by 3

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2024ReFT: Representation Finetuning for Language Models
  2. 2024ReFT: Reasoning with Reinforced Fine-Tuning
  3. 2026The Fine-Tuning Trap: Evaluating Negative Transfer and the Role of PEFT in Sub-1B Mathematical Reasoning
  4. 2026Which Tokens Should SFT Actually Learn? A Token-Trimming Perspective on Mathematical Reasoning
  5. 2025Systematic Optimization of Open Source Large Language Models for Mathematical Reasoning
  6. 2025Nested-ReFT: Efficient Reinforcement Learning for Large Language Model Fine-Tuning via Off-Policy Rollouts
  7. 2023Scaling Relationship on Learning Mathematical Reasoning with Large Language Models
  8. 2025Maximizing Prefix-Confidence at Test-Time Efficiently Improves Mathematical Reasoning