Supernodes and Halos: Loss-Critical Hubs in LLM Feed-Forward Layers
Not on the map. Why?
Abstract (arXiv)
We study the organization of channel-level importance in transformer feed-forward networks (FFNs). Using a Fisher-style loss proxy (LP) based on activation-gradient second moments, we show that loss sensitivity is concentrated in a small set of channels within each layer. In Llama-3.1-8B, the top 1% of channels per layer accounts for a median of 58.7% of LP mass, with a range of 33.0% to 86.1%. We call these loss-critical channels supernodes. Although FFN layers also contain strong activation outliers, LP-defined supernodes overlap only weakly with activation-defined outliers and are not explained by activation power or weight norms alone. Around this core, we find a weaker but consistent halo structure: some non-supernode channels share the supernodes' write support and show stronger redundancy with the protected core. We use one-shot structured FFN pruning as a diagnostic test of this organization. At 50% FFN sparsity, baselines that prune many supernodes degrade sharply, whereas our SCAR variants explicitly protect the supernode core; the strongest variant, SCAR-Prot, reaches perplexity 54.8 compared with 989.2 for Wanda-channel. The LP-concentration pattern appears across Mistral-7B, Llama-2-7B, and Qwen2-7B, remains visible in targeted Llama-3.1-70B experiments, and increases during OLMo-2-7B pretraining. These results suggest that LLM FFNs develop a small learned core of loss-critical channels, and that preserving this core is important for reliable structured pruning.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 35 of its 54 references that are in the map. First posted on arXiv 26 Apr 2026.
Builds on
35 of 54 references.
References · 35
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2023Mistral 7Bcited by 3,164
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2024Qwen2 Technical Reportcited by 2,120
23 more
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 906
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 856
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2021Knowledge Neurons in Pretrained Transformerscited by 601
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2022Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Spacecited by 532
- 20242 OLMo 2 Furiouscited by 340
- 2024Massive Activations in Large Language Modelscited by 294
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
- 2023Quantizable Transformers: Removing Outliers by Helping Attention Heads Do Nothingcited by 151
- 2021Group Fisher Pruning for Practical Network Compressioncited by 131
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
- 2021M-FAC: Efficient Matrix-Free Approximations of Second-Order Informationcited by 54
- 2024The Super Weight in Large Language Modelscited by 52
- 2023Scaling Laws for Sparsely-Connected Foundation Modelscited by 43
- 2024OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decompositioncited by 20
- 2025SlimLLM: Accurate Structured Pruning for Large Language Modelscited by 18
Built on by
Citing papers per year: 2026: 1.
1 paper.