mlsanityData to 14 Oct 2026

Wasserstein Distances, Neuronal Entanglement, and Sparsity

arXiv 2405.15756 ↗First posted 24 May 2024cs.LG cs.AIcited by 6

On the map: Mechanistic interpretability → Circuits and mechanistic analysis

Abstract (arXiv)

Disentangling polysemantic neurons is at the core of many current approaches to interpretability of large language models. Here we attempt to study how disentanglement can be used to understand performance, particularly under weight sparsity, a leading post-training optimization technique. We suggest a novel measure for estimating neuronal entanglement: the Wasserstein distance of a neuron's output distribution to a Gaussian. Moreover, we show the existence of a small number of highly entangled "Wasserstein Neurons" in each linear layer of an LLM, characterized by their highly non-Gaussian output distributions, their role in mapping similar inputs to dissimilar outputs, and their significant impact on model accuracy. To study these phenomena, we propose a new experimental framework for disentangling polysemantic neurons. Our framework separates each layer's inputs to create a mixture of experts where each neuron's output is computed by a mixture of neurons of lower Wasserstein distance, each better at maintaining accuracy when sparsified without retraining. We provide strong evidence that this is because the mixture of sparse experts is effectively disentangling the input-output relationship of individual neurons, in particular the difficult Wasserstein neurons.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Placed in Circuits and mechanistic analysis, one of 13 directions in Mechanistic interpretability. Builds on 33 of its 51 references that are in the map. First posted on arXiv 24 May 2024.

Builds on

33 of 51 references.

Closest ancestors · 1

Same direction, newest first

  1. 2024Universal Neurons in GPT2 Language Models22 Jan

Other references · 32

  1. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  4. 2016Pointer Sentinel Mixture Modelscited by 3,096
  5. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
  6. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  7. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  8. 2024Mixtral of Expertscited by 1,823
  9. 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
  10. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
  11. 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,554
  12. 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
20 more
  1. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
  2. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  3. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
  4. 2022Toy Models of Superpositioncited by 971
  5. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  6. 2017Crowdsourcing Multiple Choice Science Questionscited by 765
  7. 2024QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMscited by 634
  8. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  9. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
  10. 2023SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compressioncited by 367
  11. 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 322
  12. 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 294
  13. 2023Atom: Low-bit Quantization for Efficient and Accurate LLM Servingcited by 272
  14. 2024Extreme Compression of Large Language Models via Additive Quantizationcited by 232
  15. 2018Gradient Descent Happens in a Tiny Subspacecited by 217
  16. 2020Compositional Explanations of Neuronscited by 172
  17. 2016Linear Algebraic Structure of Word Senses, with Applications to Polysemycited by 165
  18. 2020Machine Learning in Python: Main developments and technology trends in data science, machine learning, and artificial intelligencecited by 82
  19. 2022Engineering Monosemanticity in Toy Modelscited by 13
  20. 2023SWAP: Sparse Entropic Wasserstein Regression for Robust Network Pruningcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 4; 2026: 2.

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2023Finding Neurons in a Haystack: Case Studies with Sparse Probing
  2. 2026Sparsely gated tiny linear experts
  3. 2025Disentangling Polysemantic Neurons with a Null-Calibrated Polysemanticity Index and Causal Patch Interventions
  4. 2025Expand Neurons, Not Parameters
  5. 2026Entangled Representations Amplify Collateral Damage in Unlearning
  6. 2024PURE: Turning Polysemantic Neurons Into Pure Features by Identifying Relevant Circuits
  7. 2026Hidden not Deleted: How Networks Suppress Entangled Features
  8. 2023Disentangling Neuron Representations with Concept Vectors