mlsanityData to 14 Oct 2026

Emergent Hierarchical Monosemantic Neurons from the Group-Contrastive Forward-Forward Algorithm

arXiv 2607.16295 ↗First posted 13 Jul 2026cs.CV cs.AIcited by 0

On the map: Mechanistic interpretability → SAE features and their applications

Abstract (arXiv)

Mechanistic interpretability has made significant strides in understanding neural network representations, with sparse dictionary learning (SDL) methods, most prominently sparse autoencoders, as a central paradigm. However, recent work has reported several limitations of this paradigm: SDL objectives are non-identifiable; SDL methods rely heavily on the Linear Representation Hypothesis; and a growing body of evidence points to concepts that are encoded non-linearly and are therefore not expressible as any single direction. We hypothesise that a different route to monosemanticity is available. Biological visual systems exhibit highly selective neurons organised into hierarchies of increasing abstraction, and this organisation emerges from local, layer-wise learning rules rather than from a global error signal; we therefore ask whether a biologically plausible learning algorithm will likewise yield monosemantic neurons. To test this, we propose Group-Contrastive Forward-Forward (GCFF), a forward-forward training algorithm that combines class-specific routing with within-class contrastive objectives, reaching monosemanticity through architectural constraints rather than sparsity. Because GCFF attaches multiple non-linear layers to the representation under study, its neurons can therefore capture the non-linear concepts. On CLIP representations, a single trained GCFF module recovers monosemantic neurons whose abstraction increases progressively with depth, reaching environmental properties that hold independently of an image's foreground, without any sparsity constraint or supervision of abstraction level. We further demonstrate that GCFF can train networks from scratch, achieving state-of-the-art performance among forward-forward algorithms on various image classification benchmarks.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in SAE features and their applications, one of 13 directions in Mechanistic interpretability. Builds on 27 of its 38 references that are in the map. First posted on arXiv 13 Jul 2026.

Builds on

27 of 38 references.

Closest ancestors · 3

Same direction, newest first

  1. 2026Scaling Monosemanticity: Extracting Interpretable Features from Claude 3 Sonnet28 May
  2. 2024Scaling and evaluating sparse autoencoders6 Jun
  3. 2023Sparse Autoencoders Find Highly Interpretable Features in Language Models15 Sep

Other references · 24

  1. 2016The Mythos of Model Interpretabilitycited by 721
  2. 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 716
  3. 2024Mechanistic Interpretability for AI Safety -- A Reviewcited by 422
  4. 2022The Forward-Forward Algorithm: Some Preliminary Investigationscited by 266
  5. 2024Not All Language Model Features Are One-Dimensionally Linearcited by 212
  6. 2024Transcoders Find Interpretable LLM Feature Circuitscited by 200
  7. 2024The Geometry of Categorical and Hierarchical Concepts in Large Language Modelscited by 159
  8. 2025Learning Multi-Level Features with Matryoshka Sparse Autoencoderscited by 143
  9. 2021Neural population geometry: An approach for understanding biological and artificial neural networkscited by 52
  10. 2023SymBa: Symmetric Backpropagation-Free Contrastive Learning with Forward-Forward Algorithm for Optimizing Convergencecited by 28
  11. 2025Transcoders Beat Sparse Autoencoders for Interpretabilitycited by 25
  12. 2023Layer Collaboration in the Forward-Forward Algorithmcited by 21
12 more
  1. 2023The Cascaded Forward Algorithm for Neural Network Trainingcited by 17
  2. 2024Self-Contrastive Forward-Forward Algorithmcited by 17
  3. 2023Emergent representations in networks trained with the Forward-Forward algorithmcited by 11
  4. 2025Rep2Text: Decoding Full Text from a Single LLM Token Representationcited by 7
  5. 2025Human-like Content Analysis for Generative AI with Language-Grounded Sparse Encoderscited by 6
  6. 2025BrainExplore: Large-Scale Discovery of Interpretable Visual Representations in the Human Braincited by 5
  7. 2023The Integrated Forward-Forward Algorithm: Integrating Forward-Forward and Shallow Backpropagation With Local Lossescited by 4
  8. 2025How does My Model Fail? Automatic Identification and Interpretation of Physical Plausibility Failure Modes with Matryoshka Transcoderscited by 4
  9. 2025A Unified Theory of Sparse Dictionary Learning in Mechanistic Interpretability: Piecewise Biconvexity and Spurious Minimacited by 3
  10. 2026Bridging Mechanistic Interpretability and Prompt Engineering with Gradient Ascent for Interpretable Persona Controlcited by 3
  11. 2025CXR-LanIC: Language-Grounded Interpretable Classifier for Chest X-Ray Diagnosiscited by 2
  12. 2026Toward Identifiable Sparse Autoencoderscited by 2

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026MonoLoss: A Training Objective for Interpretable Monosemantic Representations
  2. 2025From superposition to sparse codes: interpretable representations in neural networks
  3. 2026Convergent Evolution in Neural Representation Space: Emergent Order in Deep Belief Networks ↗
  4. 2025Evaluating Sparse Autoencoders for Monosemantic Representation
  5. 2024Improving Neuron-level Interpretability with White-box Language Models
  6. 2026Measuring Monosemanticity in Sparse Autoencoders via Latent Activation Coherence
  7. 2026Sparse Transformer: a Controlled Testbed for Mechanistic Interpretability
  8. 2025Analyzing Hierarchical Structure in Vision Models with Sparse Autoencoders