atlas

Research map / Architectures and efficiency / Pruning and efficient tuning

Enhancing In-Context Learning Performance with just SVD-Based Weight Pruning: A Theoretical Perspective

NeurIPS 2024 · Architectures and efficiency › Pruning and efficient tuning · approach: Layer-wise pruning of LLMs · 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 SVD-based low-rank weight pruning can improve in-context learning, with deep-layer pruning more stable, explains this via implicit GD trajectories and mutual-information generalization bounds, and proposes a derivative-free pruning search (Algorithm 1).

Problem

Why SVD-based weight pruning enhances in-context learning (ICL) performance and why deep and shallow layers respond differently to pruning, plus how to exploit this for downstream tasks.

Approach

Models ICL in linear attention as implicit gradient descent over layers, derives mutual-information generalization bounds over the full implicit GD trajectory, and uses the resulting view (norm control of implicit gradients, condition numbers) to justify SVD pruning and a greedy layer/clipping-rate search.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Apply SVD-based weight pruning across layers and module typesGPT-J-6B and Llama2-7B · SST-2, RTE, COPAICL performanceMixed
Prune weights in deep layers rather than shallow layersGPT-J-6B and Llama2-7B · SST-2, RTE, COPAstability of ICL performanceHelped
Sharply reduce weights in shallow layersGPT-J-6B and Llama2-7B · SST-2, RTE, COPAICL performanceHurt
Use Algorithm 1 to select a layer and search for its clipping rateGPT-J-6B and Llama2-7B · SST-2, AGNEWS, EMOC, MRPC, RTE, CB, COPAtest performanceHelped
Reduce the number of ICL shotsSVD-based weight pruning · SST-2rate of performance collapse after sharp shallow-layer pruningHelped

Surprising findings

Limitations

Experimental setup

Datasets: SST-2 RTE COPA AGNEWS EMOC MRPC CB

Benchmarks: SST-2 AGNEWS EMOC MRPC RTE CB COPA

Metrics: accuracy

Baselines: ICL without pruning

Builds on: linear attention as implicit gradient descent information-theoretic generalization bounds Eckart-Young-Mirsky theorem

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