Pith. sign in

Mechanistic Decomposition of Sentence Representations

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Sentence embeddings are central to modern NLP and AI systems, yet little is known about their internal structure. While we can compare these embeddings using measures such as cosine similarity, the contributing features are not human-interpretable, and the content of an embedding seems untraceable, as it is masked by complex neural transformations and a final pooling operation that combines individual token embeddings. To alleviate this issue, we propose a new method to mechanistically decompose sentence embeddings into interpretable components, by using dictionary learning on token-level representations. We analyze how pooling compresses these features into sentence representations, and assess the latent features that reside in a sentence embedding. This bridges token-level mechanistic interpretability with sentence-level analysis, making for more transparent and controllable representations. In our studies, we obtain several interesting insights into the inner workings of sentence embedding spaces, for instance, that many semantic and syntactic aspects are linearly encoded in the embeddings.

fields

cs.CL 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

Riemannian Geometry for Pre-trained Language Model Embeddings

cs.CL · 2026-07-08 · conditional · novelty 6.0

Aggregating per-token pullback metrics via the Fréchet mean on the SPD manifold outperforms Euclidean mean pooling for sentence classification, with most of the gain attributable to geometric aggregation rather than learned encoder structure.

citing papers explorer

Showing 1 of 1 citing paper.

  • Riemannian Geometry for Pre-trained Language Model Embeddings cs.CL · 2026-07-08 · conditional · none · ref 52 · internal anchor

    Aggregating per-token pullback metrics via the Fréchet mean on the SPD manifold outperforms Euclidean mean pooling for sentence classification, with most of the gain attributable to geometric aggregation rather than learned encoder structure.