Researchers have introduced Task Vector Bases, a novel framework designed to compress large collections of task vectors used in task arithmetic. This method reduces storage and computational demands by representing task vectors as linear combinations of a smaller set of basis vectors. The framework theoretically guarantees the preservation of addition generalization and enables principled unlearning, with error bounds tied to reconstruction quality. Empirical results demonstrate that the proposed basis construction methods outperform heuristic baselines and can even match the performance of full task vector sets across various applications while offering significant efficiency gains. AI
IMPACT This framework could significantly improve the efficiency of storing and applying knowledge transfer techniques in large-scale AI systems.
RANK_REASON This is a research paper detailing a new framework for compressing task vectors in machine learning. [lever_c_demoted from research: ic=1 ai=1.0]
- alphaXiv
- arXiv
- CatalyzeX Code Finder for Papers
- CORE Recommender
- DagsHub
- Gotit.pub
- Hugging Face
- IArxiv Recommender
- ScienceCast
- Siqi Zeng
- task arithmetic
- Task Vector Bases
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →