aspireai.
PUBLIC EDITION

Causal Attribution Pruning found attention heads by masking them, and beat Wanda by up to 61 percent relative accuracy on ARC-Challenge at 20 percent sparsity

AspireAI community · arXiv (2606.19350)
Most pruning criteria ask how important a weight looks; Causal Attribution Pruning asks what happens if you switch it off. For each attention head it masks that head during forward passes over a small calibration set of reasoning problems and measures the resulting accuracy loss, then uses those interventional scores to decide which weights to remove. Against the Wanda baseline the authors report relative accuracy gains of up to 61 percent on ARC-Challenge at 20 percent sparsity, with the method beating Wanda in most model-benchmark configurations at 10 to 20 percent sparsity on Llama-3-8B-Instruct and Mistral-7B-Instruct. The gain is relative and concentrated in one benchmark, and the method has a stated ceiling of its own: because MLP attribution stays coarse, the advantage disappears at 50 percent sparsity.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.