Pith. sign in

REVIEW 2 cited by

Discovering the Compositional Structure of Vector Representations with Role Learning Networks

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 1910.09113 v3 pith:F5NWZBLL submitted 2019-10-21 cs.LG cs.CLstat.ML

classification cs.LGcs.CLstat.ML
keywords structurecompositionalsymbolicnetworksperformanalysisneuralrepresentations
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

How can neural networks perform so well on compositional tasks even though they lack explicit compositional representations? We use a novel analysis technique called ROLE to show that recurrent neural networks perform well on such tasks by converging to solutions which implicitly represent symbolic structure. This method uncovers a symbolic structure which, when properly embedded in vector space, closely approximates the encodings of a standard seq2seq network trained to perform the compositional SCAN task. We verify the causal importance of the discovered symbolic structure by showing that, when we systematically manipulate hidden embeddings based on this symbolic structure, the model's output is changed in the way predicted by our analysis.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Compositional Generalization Across Distributional Shifts with Sparse Tree Operations

    cs.AI 2024-12 conditional novelty 6.0 of 10

    Sparse Differentiable Tree Machine represents trees as sparse coordinate lists, enabling efficient tree operations via bit-shifts and extending the Differentiable Tree Machine to sequence-to-sequence tasks with strong...

  2. A polar coordinate system represents syntax in large language models

    cs.CL 2024-12 conditional novelty 6.0 of 10

    A trained linear probe reveals that LLM activations encode syntactic relation types and directions as directions (angles) and relation existence as distances in a low-dimensional subspace.

Pith tools