Decoding Alignment without Encoding Alignment: A critique of similarity analysis in neuroscience
Johannes Bertram, Luciano Dyballa, T. Anderson Keller, Savik Kinger, Steven W. Zucker: Decoding Alignment without Encoding Alignment: A critique of similarity analysis in neuroscience.
Endorsed by
⧉ Cite
APA
BibTeX
📄 Transcript
Same alignment score, different computation. Comparing computation across brains and deep networks usually means decoding: probe each system with shared stimuli and compare population states with alignment metrics like RSA, CKA, and DSA. But this treats a population as a monolith. The key idea is the complementary encoding manifold, which maps neurons themselves as points in stimulus-response space, so global topology, discrete clusters versus a smooth continuum, becomes visible. The authors measure it with Gromov-Wasserstein optimal transport, a correspondence-free score of manifold shape. In a controlled MNIST experiment, a clustering loss drops Gromov-Wasserstein similarity from 1.00 to 0.28 while task accuracy stays constant, and decoding metrics barely move. Read the paper for details.
Abstract
=-1 Decoding approaches are widely used in neuroscience and machine learning to compare stimulus representations across neural systems, such as different brain regions, organisms, and deep learning models. Popular methods include decoding (perceptual) manifolds and alignment metrics such as Representational Similarity Analysis (RSA) and Dynamic Similarity Analysis (DSA), where similarity in decoding representations is interpreted as evidence for similar computation. This paper demonstrates a fundamental weakness behind this approach: it is misleading to assume that representational geometry is representative of a neuronal population as a whole, when such representations may actually be shaped by a very small subset of neurons. We show that the complementary encoding paradigm addresses this issue directly: it characterizes how neurons are organized globally in terms of their responses to a set of data, providing insight into how the decoding representation is implemented by neurons within a population. We demonstrate across experiments in biological systems and deep learning models that (i) surprisingly, similar decoding behavior and high representational alignment can arise from small, non-representative subpopulations of neurons; and critically, (ii) alignment metrics are insensitive to encoding manifold topology (how function is distributed across neurons), despite this being a key signature of differentiation across biological systems. A controlled MNIST experiment provides causal evidence: decoding metrics remain unchanged even when encoding topology is causally manipulated via the training loss. Overall, similarity in decoding behavior, as measured by classic alignment metrics, does not imply similarity in function or computation, motivating the use of encoding manifolds as a complementary tool for comparing neural systems. We provide a Neural Manifold Explorer tool.
✓ Claims & sources (7)
Each claim in this video, with the span of the paper it comes from.
Key point Decoding metrics like RSA, CKA, and DSA treat a neural population as a monolith.
Decoding metrics treat the neural population as a monolith and operate on population-level summaries, potentially obscuring internal structure and functional heterogeneity.
Key point Similar decoding behavior can arise from small, non-representative subpopulations of neurons.
surprisingly, similar decoding behavior and high representational alignment can arise from small, non-representative subpopulations of neurons
Key point The encoding manifold maps neurons as points in stimulus-response space to expose global organization.
the encoding manifold inverts this, representing neurons as points in stimulus-response space, where nearby neurons are similarly tuned and global topology (discrete clusters vs. smooth continuum) reflects functional architecture
Key point Gromov-Wasserstein optimal transport scores encoding-manifold shape without needing neuron correspondence.
they apply Gromov-Wasserstein (GW) optimal transport as an intrinsic, correspondence-free measure of encoding manifold coverage (two manifolds with the same shape score zero), suitable for comparing populations of different sizes
Key point In MNIST, a clustering loss drops GW similarity from 1.00 to 0.28 while task accuracy holds constant.
an auxiliary clustering loss of strength lambda increasing from 0 to 50 drops GW similarity monotonically from 1.00 to 0.28 while task accuracy is held constant
Key point Static decoding metrics saturate near ceiling at or above 5% of neurons under information-maximizing selection.
all static decoding metrics saturate near ceiling at or above 5% of neurons under information-maximizing selection strategies, and RSA and CKA remain near ceiling even under random selection at moderate fractions
Key point Decoding metrics stayed unchanged even as encoding topology was causally manipulated by the loss.
A controlled MNIST experiment provides causal evidence: decoding metrics remain unchanged even when encoding topology is causally manipulated via the training loss.