Abstract:What can representational similarity matrices (RSMs) tell us about a neural code? As the popularity of these summary statistics grows, so too does the need for a more complete characterization of their properties. Here, we show that symmetries in network inputs can confound RSM-based analyses. Stimulus symmetries render many representations functionally equivalent, but these different configurations can lead to different RSMs. These different RSMs reflect qualitatively different representational geometries. We show that stochastic gradient descent or energetic regularization can generate sparse, drifting codes, leading in turn to drifting RSMs. Moreover, we demonstrate that these phenomena are present in networks trained to encode image data, where the symmetry is latent. Our results illustrate the challenges inherent in comparing nonlinear neural codes, when functionally-equivalent representations are not related by a simple rotation.
| Comments: | 40 pages |
| Subjects: | Neurons and Cognition (q-bio.NC); Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.21324 [q-bio.NC] |
| (or arXiv:2605.21324v1 [q-bio.NC] for this version) | |
| https://doi.org/10.48550/arXiv.2605.21324 arXiv-issued DOI via DataCite (pending registration) |
From: Farhad Pashakhanloo [view email]
[v1]
Wed, 20 May 2026 15:51:21 UTC (10,006 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。