Tom Lieberum

dblp:318/3300 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Trustworthy machine learning · 69% Representation and self-supervised learning · 14% Deep learning architectures and training · 13%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
1.422024
Improving Sparse Decomposition of Language Model Activations with Gated Sparse Autoencoders · NeurIPS 2024
Progress measures for grokking via mechanistic interpretability · ICLR 2023
Machine learning › Trustworthy machine learning › interpretability
mechanistic interpretability
1.422024
Improving Sparse Decomposition of Language Model Activations with Gated Sparse Autoencoders · NeurIPS 2024
Progress measures for grokking via mechanistic interpretability · ICLR 2023
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
sparse autoencoder
0.812024
Improving Sparse Decomposition of Language Model Activations with Gated Sparse Autoencoders · NeurIPS 2024
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › sparse coding
sparse feature learning
0.812024
Improving Sparse Decomposition of Language Model Activations with Gated Sparse Autoencoders · NeurIPS 2024
Machine learning › Deep learning architectures and training › training dynamics
grokking
0.712023
Progress measures for grokking via mechanistic interpretability · ICLR 2023

Methods — techniques the papers use, named apart from their topics

l1 penalty · 0.8gated sparse autoencoder · 0.8
YearPublicationVenuePosition
2024 Improving Sparse Decomposition of Language Model Activations with Gated Sparse Autoencoders
abstract
Recent work has found that sparse autoencoders (SAEs) are an effective technique for unsupervised discovery of interpretable features in language models' (LMs) activations, by finding sparse, linear reconstructions of those activations. We introduce the Gated Sparse Autoencoder (Gated SAE), which achieves a Pareto improvement over training with prevailing methods. In SAEs, the L1 penalty used to encourage sparsity introduces many undesirable biases, such as shrinkage -- systematic underestimation of feature activations. The key insight of Gated SAEs is to separate the functionality of (a) determining which directions to use and (b) estimating the magnitudes of those directions: this enables us to apply the L1 penalty only to the former, limiting the scope of undesirable side effects. Through training SAEs on LMs of up to 7B parameters we find that, in typical hyper-parameter ranges, Gated SAEs solve shrinkage, are similarly interpretable, and require half as many firing features to achieve comparable reconstruction fidelity.
Senthooran Rajamanoharan, Arthur Conmy, Lewis Smith, Tom Lieberum, Vikrant Varma, János Kramár, Rohin Shah, Neel Nanda
NeurIPS4
2023 Progress measures for grokking via mechanistic interpretability
Neel Nanda, Lawrence Chan, Tom Lieberum, Jess Smith, Jacob Steinhardt
ICLR3