Pith. sign in

REVIEW 1 cited by

Recurrent Neural Networks Learn to Store and Generate Sequences using Non-Linear Representations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.10920 v1 pith:M6V5KM57 submitted 2024-08-20 cs.LG cs.AIcs.NE

classification cs.LGcs.AIcs.NE
keywords learnlinearnetworksneuralrepresentationsrnnsindicateinterventions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The Linear Representation Hypothesis (LRH) states that neural networks learn to encode concepts as directions in activation space, and a strong version of the LRH states that models learn only such encodings. In this paper, we present a counterexample to this strong LRH: when trained to repeat an input token sequence, gated recurrent neural networks (RNNs) learn to represent the token at each position with a particular order of magnitude, rather than a direction. These representations have layered features that are impossible to locate in distinct linear subspaces. To show this, we train interventions to predict and manipulate tokens by learning the scaling factor corresponding to each sequence position. These interventions indicate that the smallest RNNs find only this magnitude-based solution, while larger RNNs have linear representations. These findings strongly indicate that interpretability research should not be confined by the LRH.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Low-Rank Adapting Models for Sparse Autoencoders

    cs.LG 2025-01 conditional novelty 6.0 of 10

    LoRA fine-tuning of the language model around a fixed SAE reduces the SAE-insertion loss gap by 30-55% and matches end-to-end SAEs 2-20x faster.

Pith tools