mlsanityData to 14 Oct 2026

DPI: Exploiting Parameter Heterogeneity for Interference-Free Fine-Tuning

arXiv 2601.17777 ↗First posted 25 Jan 2026cs.CL cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Supervised fine-tuning (SFT) is a crucial step for adapting large language models (LLMs) to downstream tasks. However, conflicting objectives across heterogeneous SFT tasks often induce the "seesaw effect": optimizing for one task may degrade performance on others, particularly when model parameters are updated indiscriminately. In this paper, we propose a principled approach to disentangle and isolate task-specific parameter regions, motivated by the hypothesis that parameter heterogeneity underlies cross-task interference. Specifically, we first independently fine-tune LLMs on diverse SFT tasks and identify each task's core parameter region as the subset of parameters exhibiting the largest updates. Tasks with highly overlapping core parameter regions are merged for joint training, while disjoint tasks are organized into different stages. During multi-stage SFT, core parameters acquired in prior tasks are frozen, thereby preventing overwriting by subsequent tasks. To verify the effectiveness of our method, we conducted intensive experiments on multiple public datasets. The results showed that our dynamic parameter isolation strategy consistently reduced data conflicts and achieved consistent performance improvements compared to multi-stage and multi-task tuning baselines.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 25 of its 32 references that are in the map. First posted on arXiv 25 Jan 2026.

Builds on

25 of 32 references.

References · 25

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  3. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,780
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  5. 2020Gradient Surgery for Multi-Task Learningcited by 1,256
  6. 2018Experience Replay for Continual Learningcited by 1,095
  7. 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 834
  8. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
  9. 2024TableBench: A Comprehensive and Complex Benchmark for Table Question Answeringcited by 128
  10. 2023Time-aware Multiway Adaptive Fusion Network for Temporal Knowledge Graph Question Answeringcited by 27
  11. 2024Question Calibration and Multi-Hop Modeling for Temporal Question Answeringcited by 25
  12. 2022DABERT: Dual Attention Enhanced BERT for Semantic Matchingcited by 21
13 more
  1. 2023Dual Path Modeling for Semantic Matching by Perceiving Subtle Conflictscited by 21
  2. 2022Improving Semantic Matching through Dependency-Enhanced Pre-trained Model with Adaptive Fusioncited by 18
  3. 2022Searching for Optimal Subword Tokenization in Cross-domain NERcited by 17
  4. 2022Robust Lottery Tickets for Pre-trained Language Modelscited by 16
  5. 2025Who Stole Your Data? A Method for Detecting Unauthorized RAG Theftcited by 15
  6. 2025Progressive Mastery: Customized Curriculum Learning with Guided Prompting for Mathematical Reasoningcited by 13
  7. 2025Not All Parameters Are Created Equal: Smart Isolation Boosts Fine-Tuning Performancecited by 13
  8. 2023Unleashing Potential of Evidence in Knowledge-Intensive Dialogue Generationcited by 11
  9. 2024Resolving Word Vagueness with Scenario-guided Adapter for Natural Language Inferencecited by 11
  10. 2025Structural Reward Model: Enhancing Interpretability, Efficiency, and Scalability in Reward Modelingcited by 11
  11. 2025HoPE: Hyperbolic Rotary Positional Encoding for Stable Long-Range Dependency Modeling in Large Language Modelscited by 10
  12. 2024Comateformer: Combined Attention Transformer for Semantic Sentence Matchingcited by 9
  13. 2025DeCoRL: Decoupling Reasoning Chains via Parallel Sub-Step Generation and Cascaded Reinforcement for Interpretable and Scalable RLHFcited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 5.

5 papers.