VLDB 2026 Research / reviewers in the wild / expert
Michael Hanna 0001
dblp:306/9666-1
· DBLP profile ↗
7ranked-venue papers
5as first author
7since 2021 · last 2025
0009-0006-5574-3137ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 7 · 5 first-author · 7 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 · 64% Deep learning architectures and training · 18% Language models and text generation · 18% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › interpretability
mechanistic interpretability |
2.3 | 3 | 2025 | MIB: A Mechanistic Interpretability Benchmark · ICML 2025 LLM Circuit Analyses Are Consistent Across Training and Scale · NeurIPS 2024 How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language model · NeurIPS 2023 |
Machine learning › Trustworthy machine learning
interpretability |
1.5 | 2 | 2025 | MIB: A Mechanistic Interpretability Benchmark · ICML 2025 How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language model · NeurIPS 2023 |
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
circuit analysis |
1.4 | 2 | 2024 | LLM Circuit Analyses Are Consistent Across Training and Scale · NeurIPS 2024 How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language model · NeurIPS 2023 |
Machine learning › Deep learning architectures and training
scaling laws |
0.8 | 1 | 2024 | LLM Circuit Analyses Are Consistent Across Training and Scale · NeurIPS 2024 |
Machine learning › Deep learning architectures and training
training dynamics |
0.8 | 1 | 2024 | LLM Circuit Analyses Are Consistent Across Training and Scale · NeurIPS 2024 |
Natural language and speech › Language models and text generation › natural language understanding
linguistic knowledge in language models |
0.7 | 1 | 2023 | When Language Models Fall in Love: Animacy Processing in Transformer Language Models · EMNLP 2023 |
Natural language and speech › Language models and text generation › pre-trained language model
decoder-only language model |
0.2 | 1 | 2024 | LLM Circuit Analyses Are Consistent Across Training and Scale · NeurIPS 2024 |
Natural language and speech › Language models and text generation › mathematical reasoning
numerical reasoning |
0.2 | 1 | 2023 | How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language model · NeurIPS 2023 |
Natural language and speech › Language models and text generation
pre-trained language model |
0.2 | 1 | 2023 | How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language model · NeurIPS 2023 |
Natural language and speech › Language models and text generation › language modeling › language model architecture
transformer language model |
0.2 | 1 | 2023 | When Language Models Fall in Love: Animacy Processing in Transformer Language Models · EMNLP 2023 |
Methods — techniques the papers use, named apart from their topics
sparse autoencoder · 1.6distributed alignment search · 0.9attribution patching · 0.9circuit analysis · 0.8mechanistic interpretability · 0.7circuit identification · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | MIB: A Mechanistic Interpretability BenchmarkabstractHow can we know whether new mechanistic interpretability methods achieve real improvements?
In pursuit of lasting evaluation standards, we propose MIB, a Mechanistic Interpretability Benchmark, with two tracks spanning four tasks and five models. MIB favors methods that precisely and concisely recover relevant causal pathways or causal variables in neural language models. The circuit localization track compares methods that locate the model components---and connections between them---most important for performing a task (e.g., attribution patching or information flow routes). The causal variable track compares methods that featurize a hidden vector, e.g., sparse autoencoders (SAE) or distributed alignment search (DAS), and align those features to a task-relevant causal variable. Using MIB, we find that attribution and mask optimization methods perform best on circuit localization. For causal variable localization, we find that the supervised DAS method performs best, while SAEs features are not better than neurons, i.e., non-featurized hidden vectors. These findings illustrate that MIB enables meaningful comparisons, and increases our confidence that there has been real progress in the field. Aaron Mueller, Atticus Geiger, Sarah Wiegreffe, Dana Arad, Iván Arcuschin, Adam Belfki, Yik Siu Chan, Jaden Fiotto-Kaufman, Tal Haklay, Michael Hanna 0001, Rohan Gupta, Yaniv Nikankin, Hadas Orgad, Nikhil Prakash, Anja Reusch, Aruna Sankaranarayanan, Shun Shao, Alessandro Stolfo, Martin Tutek, Amir Zur, David Bau, Yonatan Belinkov |
ICML | 10 |
| 2025 | Incremental Sentence Processing Mechanisms in Autoregressive Transformer Language ModelsabstractMichael Hanna, Aaron Mueller. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2025. Michael Hanna 0001, Aaron Mueller |
NAACL (Long Papers) | 1 |
| 2024 | LLM Circuit Analyses Are Consistent Across Training and ScaleabstractMost currently deployed LLMs undergo continuous training or additional finetuning. By contrast, most research into LLMs' internal mechanisms focuses on models at one snapshot in time (the end of pre-training), raising the question of whether their results generalize to real-world settings. Existing studies of mechanisms over time focus on encoder-only or toy models, which differ significantly from most deployed models. In this study, we track how model mechanisms, operationalized as circuits, emerge and evolve across 300 billion tokens of training in decoder-only LLMs, in models ranging from 70 million to 2.8 billion parameters. We find that task abilities and the functional components that support them emerge consistently at similar token counts across scale. Moreover, although such components may be implemented by different attention heads over time, the overarching algorithm that they implement remains. Surprisingly, both these algorithms and the types of components involved therein tend to replicate across model scale. Finally, we find that circuit size correlates with model size and can fluctuate considerably over time even when the same algorithm is implemented. These results suggest that circuit analyses conducted on small models at the end of pre-training can provide insights that still apply after additional training and over model scale. Curt Tigges, Michael Hanna 0001, Qinan Yu, Stella Biderman |
NeurIPS | 2 |
| 2023 | The Functional Relevance of Probed Information: A Case StudyabstractRecent studies have shown that transformer models like BERT rely on number information encoded in their representations of sentences' subjects and head verbs when performing subject-verb agreement.However, probing experiments suggest that subject number is also encoded in the representations of all words in such sentences.In this paper, we use causal interventions to show that BERT only uses the subject plurality information encoded in its representations of the subject and words that agree with it in number.We also demonstrate that current probing metrics are unable to determine which words' representations contain functionally relevant information.This both provides a revised view of subject-verb agreement in language models, and suggests potential pitfalls for current probe usage and evaluation. Michael Hanna 0001, Roberto Zamparelli, David Marecek |
EACL | 1 |
| 2023 | When Language Models Fall in Love: Animacy Processing in Transformer Language ModelsabstractAnimacy-whether an entity is alive and sentient-is fundamental to cognitive processing, impacting areas such as memory, vision, and language.However, animacy is not always expressed directly in language: in English it often manifests indirectly, in the form of selectional constraints on verbs and adjectives.This poses a potential issue for transformer language models (LMs): they often train only on text, and thus lack access to extralinguistic information from which humans learn about animacy.We ask: how does this impact LMs' animacy processing-do they still behave as humans do?We answer this question using open-source LMs.Like previous studies, we find that LMs behave much like humans when presented with entities whose animacy is typical.However, we also show that even when presented with stories about atypically animate entities, such as a peanut in love, LMs adapt: they treat these entities as animate, though they do not adapt as well as humans.Even when the context indicating atypical animacy is very short, LMs pick up on subtle clues and change their behavior.We conclude that despite the limited signal through which LMs can learn about animacy, they are indeed sensitive to the relevant lexical semantic nuances available in English. Michael Hanna 0001, Yonatan Belinkov, Sandro Pezzelle |
EMNLP | 1 |
| 2023 | How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelabstractPre-trained language models can be surprisingly adept at tasks they were not explicitly trained on, but how they implement these capabilities is poorly understood. In this paper, we investigate the basic mathematical abilities often acquired by pre-trained language models. Concretely, we use mechanistic interpretability techniques to explain the (limited) mathematical abilities of GPT-2 small. As a case study, we examine its ability to take in sentences such as "The war lasted from the year 1732 to the year 17", and predict valid two-digit end years (years > 32). We first identify a circuit, a small subset of GPT-2 small's computational graph that computes this task's output. Then, we explain the role of each circuit component, showing that GPT-2 small's final multi-layer perceptrons boost the probability of end years greater than the start year. Finally, we find related tasks that activate our circuit. Our results suggest that GPT-2 small computes greater-than using a complex but general mechanism that activates across diverse contexts. Michael Hanna 0001, Ollie Liu, Alexandre Variengien |
NeurIPS | 1 |
| 2022 | ACT-Thor: A Controlled Benchmark for Embodied Action Understanding in Simulated EnvironmentsabstractArtificial agents are nowadays challenged to perform embodied AI tasks. To succeed, agents must understand the meaning of verbs and how their corresponding actions transform the surrounding world. In this work, we propose ACT-Thor, a novel controlled benchmark for embodied action understanding. We use the AI2-THOR simulated environment to produce a controlled setup in which an agent, given a before-image and an associated action command, has to determine what the correct after-image is among a set of possible candidates. First, we assess the feasibility of the task via a human evaluation that resulted in 81.4% accuracy, and very high inter-annotator agreement (84.9%). Second, we design both unimodal and multimodal baselines, using state-of-the-art visual feature extractors. Our evaluation and error analysis suggest that only models that have a very structured representation of the actions together with powerful visual features can perform well on the task. However, they still fall behind human performance in a zero-shot scenario where the model is exposed to unseen (action, object) pairs. This paves the way for a systematic way of evaluating embodied AI agents that understand grounded actions. Michael Hanna 0001, Federico Pedeni, Alessandro Suglia, Alberto Testoni, Raffaella Bernardi |
COLING | 1 |