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

Raphaël Millière

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

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

Artificial intelligence and machine learning · 1 · 1 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
1 paper
Trustworthy machine learning · 50% Knowledge representation and reasoning · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › interpretability
mechanistic interpretability
0.912025
How Do Transformers Learn Variable Binding in Symbolic Programs? · ICML 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
symbolic computation
0.912025
How Do Transformers Learn Variable Binding in Symbolic Programs? · ICML 2025
Machine learning › Trustworthy machine learning › interpretability › neural network interpretation
transformer interpretability
0.912025
How Do Transformers Learn Variable Binding in Symbolic Programs? · ICML 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
variable binding
0.912025
How Do Transformers Learn Variable Binding in Symbolic Programs? · ICML 2025

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

causal intervention · 0.9attention analysis · 0.9
YearPublicationVenuePosition
2025 How Do Transformers Learn Variable Binding in Symbolic Programs?
abstract
Variable binding—the ability to associate variables with values—is fundamental to symbolic computation and cognition. Although classical architectures typically implement variable binding via addressable memory, it is not well understood how modern neural networks lacking built-in binding operations may acquire this capacity. We investigate this by training a Transformer to dereference queried variables in symbolic programs where variables are assigned either numerical constants or other variables. Each program requires following chains of variable assignments up to four steps deep to find the queried value, and also contains irrelevant chains of assignments acting as distractors. Our analysis reveals a developmental trajectory with three distinct phases during training: (1) random prediction of numerical constants, (2) a shallow heuristic prioritizing early variable assignments, and (3) the emergence of a systematic mechanism for dereferencing assignment chains. Using causal interventions, we find that the model learns to exploit the residual stream as an addressable memory space, with specialized attention heads routing information across token positions. This mechanism allows the model to dynamically track variable bindings across layers, resulting in accurate dereferencing. Our results show how Transformer models can learn to implement systematic variable binding without explicit architectural support, bridging connectionist and symbolic approaches.
Atticus Geiger, Raphaël Millière
ICML3