paper-with-me

홈 › Papers

Concrete Subspace Learning based Interference Elimination for Multi-task Model Fusion

2023-12-11 · Anke Tang, Li Shen, Yong Luo, Liang Ding, Han Hu, Bo Du, DaCheng Tao

Merging models fine-tuned from a common, extensively pre-trained large model but specialized for different tasks has been demonstrated as a cheap and scalable strategy to construct a multi-task model that performs well across diverse tasks. Recent research, exemplified by task arithmetic, highlights that this multi-task model can be derived through arithmetic operations on task vectors. Nevertheless, current merging techniques frequently resolve potential conflicts among parameters from task-specific models by evaluating individual attributes, such as the parameters' magnitude or sign, overlooking their collective impact on the overall functionality of the model. In this work, we propose the CONtinuous relaxation of disCRETE (Concrete) subspace learning method to identify a common low-dimensional subspace and utilize its shared information to track the interference problem without sacrificing much performance. Specifically, we model the problem as a bi-level optimization problem and introduce a meta-learning framework to find the Concrete subspace mask through gradient-based techniques. At the upper level, we focus on learning a shared Concrete mask to identify the subspace, while at the inner level, model merging is performed to maximize the performance of the merged model. We conduct extensive experiments on both vision domain and language domain, and the results demonstrate the effectiveness of our method. The code is available at https://github.com/tanganke/subspace_fusion

📄 PDF Abstract BibTeX arXiv:2312.06173

Code (1)

tanganke/subspace_fusion 공식 구현 pytorch

Tasks

Meta-LearningTask Arithmetic

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

Inference, interference and invariance: How the Quantum Fourier Transform can help to learn from data

2024-08-30 · David Wakeham, Maria Schuld

How can we take inspiration from a typical quantum algorithm to design heuristics for machine learning? A common blueprint, used from Deutsch-Josza to Shor's algorithm, is to place labeled information in superposition vi…

BiLoRA: Almost-Orthogonal Parameter Spaces for Continual Learning

2025-01-01 · CVPR 2025 1 · Hao Zhu, Yifei Zhang, Junhao Dong, Piotr Koniusz

Continual learning requires models to learn tasks sequentially while maintaining a delicate balance between stability (retaining knowledge of previous tasks) and plasticity (adapting to new tasks). A key challenge is…

Continual Learningparameter-efficient fine-tuning

Essential Subspace Merging for Multi-Task Learning

2026-06-17 · Longhua Li, Lei Qi, Xin Geng, Qi Tian arxiv

Model merging aims to enable multi-task learning by integrating the capabilities of multiple models fine-tuned from the same pre-trained checkpoint into a single model. Its core challenge is inter-task interference among…

Multi-Task Learning

Dysco: Dynamic Subspace Boosting to Mitigate LoRA Interference in Federated Learning

2026-07-15 · Haobo Zhang, Jiankun Wang, Suraj Rajendran, Weishen Pan 외 arxiv

Federated fine-tuning of large pre-trained models increasingly relies on Low-Rank Adaptation (LoRA) to reduce communication and computation, but heterogeneous clients can make adapter aggregation unstable. We identify th…

Federated Learning

Compositional Subspace Representation Fine-tuning for Adaptive Large Language Models

2025-03-13 · Andy Zhou

Adapting large language models to multiple tasks can cause cross-skill interference, where improvements for one skill degrade another. While methods such as LoRA impose orthogonality constraints at the weight level, they…

Instruction Following