HackerPapers

arXiv:2210.01892cs.NE

Polysemanticity and Capacity in Neural Networks

Adam Scherlis, Kshitij Sachan, Adam S. Jermyn, Joe Benton, Buck Shlegeris

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Individual neurons in neural networks often represent a mixture of unrelated features. This phenomenon, called polysemanticity, can make interpreting neural networks more difficult and so we aim to understand its causes. We propose doing so through the lens of feature \emph{capacity}, which is the fractional dimension each feature consumes in the embedding space. We show that in a toy model the optimal capacity allocation tends to monosemantically represent the most important features, polysemantically represent less important features (in proportion to their impact on the loss), and entirely ignore the least important features. Polysemanticity is more prevalent when the inputs have higher kurtosis or sparsity and more prevalent in some architectures than others. Given an optimal allocation of capacity, we go on to study the geometry of the embedding space. We find a block-semi-orthogonal structure, with differing block sizes in different models, highlighting the impact of model architecture on the interpretability of its neurons.

arXiv comments
22 pages, 7 figures. Improved notation and corrected an error in the description of the most general efficient matrices
Journal reference
DOI
Subjects
cs.NENeural and Evolutionary Computing cs.AIArtificial Intelligence cs.LGMachine Learning

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Oct 2022 to Oct 2022.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. The AI Scaling Hypothesis 1 comment

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.