Automated Feature Labeling with Token-Space Gradient Descent
Not on the map. Why?
Abstract (arXiv)
We present a novel approach to feature labeling using gradient descent in token-space. While existing methods typically use language models to generate hypotheses about feature meanings, our method directly optimizes label representations by using a language model as a discriminator to predict feature activations. We formulate this as a multi-objective optimization problem in token-space, balancing prediction accuracy, entropy minimization, and linguistic naturalness. Our proof-of-concept experiments demonstrate successful convergence to interpretable single-token labels across diverse domains, including features for detecting animals, mammals, Chinese text, and numbers. Although our current implementation is constrained to single-token labels and relatively simple features, the results suggest that token-space gradient descent could become a valuable addition to the interpretability researcher's toolkit.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 11 references that are in the map. First posted on arXiv 1 Apr 2025.
Builds on
5 of 11 references.
References · 5
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2024Improving Dictionary Learning with Gated Sparse Autoencoderscited by 171
- 2024Automatically Interpreting Millions of Features in Large Language Modelscited by 106
- 2024Identifying Functionally Important Features with End-to-End Sparse Dictionary Learningcited by 64
- 2017HotFlip: White-Box Adversarial Examples for Text Classificationcited by 12
Built on by
Not cited yet.