Deleting under 0.05% of weights matches full fine-tuning, NYU paper shows
burny_tech · x · 2026-11-13
- Researchers from NYU and University of Calgary propose Deletion Tuning: instead of learning new weight values, it learns a binary mask over each transformer block's gate projection, zeroing fewer than 0.05% of pretrained weights with no other modification.
- Across three post-training regimes (RLVR, SFT, on-policy distillation), it matches full fine-tuning: on a 30B model it scores 58.54% vs 58.43% for FFT, with an adapter roughly 4,000x smaller.
- It forgets far less than conventional methods — prior-task accuracy stays near baseline under RL, while FFT, LoRA, and random sparse fine-tuning lose up to 5.4 points.
- The authors analyze stable rank, spectrum drift, and principal-weight overlap to explain why masking alone suffices.
The takeaway: acquiring new capabilities may require only learning which existing connections to disable, not new weights.
More from Research
- One Chart Explains the Linear Algebra Behind Modern AI, from Vectors to SVD — HankYeomans · 2026-11-13
- Codex agent shrinks a 27M-param transformer to 11.46M with equal loss via weight sharing — yoshiyama_akira · 2026-11-13
- Google open-sources Harness²: Agent = Model + Harness, recursive agent harnessing framework — 2C_ornot2C · 2026-11-13
- Question's Gambit: first-step reranking lifts agentic search accuracy to 90.5% — CShorten30 · 2026-11-13
- Terence Tao: major Riemann hypothesis progress came from AI-generated ideas nobody yet understands — burny_tech · 2026-11-13
- Recasting spatial-spectral coupling as attention scales 3D shape matching to high-res meshes — ssh4net · 2026-11-13