atlas

Research map / Architectures and efficiency / Pruning and efficient tuning

Localizing Task Information for Improved Model Merging and Compression

ICML 2024 · Architectures and efficiency › Pruning and efficient tuning · approach: Low-rank compression and merging · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Shows that task-specific information survives merging via binary task masks (TALL-masks) that localize each task vector in the multi-task vector, and proposes Consensus Merging, which removes catastrophic and selfish weights to improve task arithmetic and TIES, plus a mask-based compression scheme.

Problem

Model merging via task arithmetic loses significant performance versus individual fine-tuned models; the paper asks whether this is due to information erasure or task interference, and how to compress many fine-tuned checkpoints.

Approach

Task-specific binary masks, built by thresholding each task vector against the residual of the multi-task vector, recover nearly full single-task performance from the merged vector; mask agreement statistics reveal catastrophic (used by no task) and selfish (used by one task) weights, and removing them (consensus mask with threshold k) improves existing merging methods.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Apply consensus masking to Task arithmeticTask arithmetic on 8 QA tasks · 8 QA tasksaccuracy: 63.8 -> 68.6Helped
Apply consensus masking to TIESTIES on 8 QA tasks · 8 QA tasksaccuracy: 62.8 -> 69.1Helped
Apply consensus masking to Task arithmeticTask arithmetic on all 11 NLP tasks · All 11 tasksaccuracy: 63.6 -> 67.5Helped
Apply consensus masking to Task arithmeticTask arithmetic on 20 vision tasks · 20 tasks, CLIP ViT-B/32accuracy: 60.6 -> 65.4Helped
Apply consensus masking to Task arithmeticTask arithmetic on 20 vision tasks · 20 tasks, CLIP ViT-L/14accuracy: 74.0 -> 78.9Helped
Localize task-specific parameters with TALL masksTask arithmetic compression · 20 tasks, CLIP ViT-B/32accuracy: 60.6 -> 90.6Helped
Use consensus threshold k=2 rather than k=1 (ablation)Consensus Task Arithmetic · 20 tasks, CLIP ViT-B/32accuracy: 64.5 -> 65.4Helped
Use consensus threshold k=2 rather than k=1 (ablation)Consensus TIES · 20 tasks, CLIP ViT-B/32accuracy: 64.5 -> 63.2Hurt
Remove selfish weights as well as catastrophic weights (ablation)Consensus merging with (IA)³ NLP models · 7 NLP tasksaccuracy: 70.9 -> 66.6Hurt
Preserve task-specific information with TALL masks rather than magnitude maskingCheckpoint compression · 20 tasks, CLIP ViT-B/32accuracy: 75.3 -> 90.6Helped

Surprising findings

Limitations

Experimental setup

Datasets: Cars DTD EuroSAT GTSRB MNIST RESISC45 SUN397 SVHN CIFAR100 STL10 Flowers102 OxfordIIITPet

Benchmarks: 8-task vision benchmark 14-task vision benchmark 20-task vision benchmark 7 NLP tasks 8 QA tasks 11 NLP tasks

Metrics: absolute accuracy normalized accuracy storage (Gb)

Baselines: Weight averaging Task arithmetic TIES Magnitude Pruning Magnitude Masking Fisher merging

Builds on: task arithmetic TIES-merging magnitude pruning

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy