Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Can Rager

dblp:338/7382 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 4 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
4 papers
Trustworthy machine learning · 62% Efficient and distributed learning · 12% Deep learning architectures and training · 9%

Topics — the 8 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
2.532025
SAEBench: A Comprehensive Benchmark for Sparse Autoencoders in Language Model Interpretability · ICML 2025
Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Models · ICLR 2025
Measuring Progress in Dictionary Learning for Language Model Interpretability with Board Game Models · NeurIPS 2024
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
sparse autoencoder
1.622025
SAEBench: A Comprehensive Benchmark for Sparse Autoencoders in Language Model Interpretability · ICML 2025
Measuring Progress in Dictionary Learning for Language Model Interpretability with Board Game Models · NeurIPS 2024
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
circuit discovery
0.912025
Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Models · ICLR 2025
Machine learning › Efficient and distributed learning
distributed training
0.912025
NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals · ICLR 2025
Machine learning › Trustworthy machine learning
language model interpretability
0.912025
SAEBench: A Comprehensive Benchmark for Sparse Autoencoders in Language Model Interpretability · ICML 2025
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › sparse coding
dictionary learning
0.812024
Measuring Progress in Dictionary Learning for Language Model Interpretability with Board Game Models · NeurIPS 2024
Machine learning › Efficient and distributed learning
inference serving
0.312025
NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals · ICLR 2025
Natural language and speech › Language models and text generation
large language model
0.312025
NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals · ICLR 2025

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

sparse autoencoder · 2.5intervention graph · 0.9feature disentanglement metrics · 0.9feature ablation · 0.9deferred remote execution · 0.9p-annealing · 0.8
YearPublicationVenuePosition
2025 NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals
abstract
We introduce NNsight and NDIF, technologies that work in tandem to enable scientific study of the representations and computations learned by very large neural networks. NNsight is an open-source system that extends PyTorch to introduce deferred remote execution. The National Deep Inference Fabric (NDIF) is a scalable inference service that executes NNsight requests, allowing users to share GPU resources and pretrained models. These technologies are enabled by the Intervention Graph, an architecture developed to decouple experimental design from model runtime. Together, this framework provides transparent and efficient access to the internals of deep neural networks such as very large language models (LLMs) without imposing the cost or complexity of hosting customized models individually. We conduct a quantitative survey of the machine learning literature that reveals a growing gap in the study of the internals of large-scale AI. We demonstrate the design and use of our framework to address this gap by enabling a range of research methods on huge models. Finally, we conduct benchmarks to compare performance with previous approaches. Code, documentation, and tutorials are available at https://nnsight.net/.
Jaden Fiotto-Kaufman, Alexander R. Loftus, Eric Todd, Jannik Brinkmann, Koyena Pal, Dmitrii Troitskii, Michael Ripa, Adam Belfki, Can Rager, Caden Juang, Aaron Mueller, Samuel Marks, Arnab Sen Sharma, Francesca Lucchetti, Nikhil Prakash, Carla E. Brodley, Arjun Guha, Jonathan Bell 0001, Byron C. Wallace, David Bau
ICLR9
2025 Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Models
abstract
We introduce methods for discovering and applying **sparse feature circuits**. These are causally implicated subnetworks of human-interpretable features for explaining language model behaviors. Circuits identified in prior work consist of polysemantic and difficult-to-interpret units like attention heads or neurons, rendering them unsuitable for many downstream applications. In contrast, sparse feature circuits enable detailed understanding of unanticipated mechanisms in neural networks. Because they are based on fine-grained units, sparse feature circuits are useful for downstream tasks: We introduce SHIFT, where we improve the generalization of a classifier by ablating features that a human judges to be task-irrelevant. Finally, we demonstrate an entirely unsupervised and scalable interpretability pipeline by discovering thousands of sparse feature circuits for automatically discovered model behaviors.
Samuel Marks, Can Rager, Eric J. Michaud, Yonatan Belinkov, David Bau, Aaron Mueller
ICLR2
2025 SAEBench: A Comprehensive Benchmark for Sparse Autoencoders in Language Model Interpretability
abstract
Sparse autoencoders (SAEs) are a popular technique for interpreting language model activations, and there is extensive recent work on improving SAE effectiveness. However, most prior work evaluates progress using unsupervised proxy metrics with unclear practical relevance. We introduce SAEBench, a comprehensive evaluation suite that measures SAE performance across eight diverse metrics, spanning interpretability, feature disentanglement and practical applications like unlearning. To enable systematic comparison, we open-source a suite of over 200 SAEs across seven recently proposed SAE architectures and training algorithms. Our evaluation reveals that gains on proxy metrics do not reliably translate to better practical performance. For instance, while Matryoshka SAEs slightly underperform on existing proxy metrics, they substantially outperform other architectures on feature disentanglement metrics; moreover, this advantage grows with SAE scale. By providing a standardized framework for measuring progress in SAE development, SAEBench enables researchers to study scaling trends and make nuanced comparisons between different SAE architectures and training methodologies. Our interactive interface enables researchers to flexibly visualize relationships between metrics across hundreds of open-source SAEs at www.neuronpedia.org/sae-bench
Adam Karvonen, Can Rager, Johnny Lin, Curt Tigges, Joseph Isaac Bloom, David Chanin, Yeu-Tong Lau, Eoin Farrell, Callum McDougall, Kola Ayonrinde, Demian Till, Matthew Wearden, Arthur Conmy, Samuel Marks, Neel Nanda
ICML2
2024 Measuring Progress in Dictionary Learning for Language Model Interpretability with Board Game Models
abstract
What latent features are encoded in language model (LM) representations? Recent work on training sparse autoencoders (SAEs) to disentangle interpretable features in LM representations has shown significant promise. However, evaluating the quality of these SAEs is difficult because we lack a ground-truth collection of interpretable features which we expect good SAEs to identify. We thus propose to measure progress in interpretable dictionary learning by working in the setting of LMs trained on Chess and Othello transcripts. These settings carry natural collections of interpretable features—for example, “there is a knight on F3”—which we leverage into metrics for SAE quality. To guide progress in interpretable dictionary learning, we introduce a new SAE training technique, $p$-annealing, which demonstrates improved performance on our metric.
Adam Karvonen, Benjamin Wright, Can Rager, Rico Angell, Jannik Brinkmann, Logan Smith, Claudio Mayrink Verdun, David Bau, Samuel Marks
NeurIPS3