Arrow Research search

Author name cluster

Tom McGrath

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

NeurIPS Conference 2023 Conference Paper

Tracr: Compiled Transformers as a Laboratory for Interpretability

  • David Lindner
  • Janos Kramar
  • Sebastian Farquhar
  • Matthew Rahtz
  • Tom McGrath
  • Vladimir Mikulik

We show how to "compile" human-readable programs into standard decoder-only transformer models. Our compiler, Tracr, generates models with known structure. This structure can be used to design experiments. For example, we use it to study "superposition" in transformers that execute multi-step algorithms. Additionally, the known structure of Tracr-compiled models can serve as ground-truth for evaluating interpretability methods. Commonly, because the "programs" learned by transformers are unknown it is unclear whether an interpretation succeeded. We demonstrate our approach by implementing and examining programs including computing token frequencies, sorting, and parenthesis checking. We provide an open-source implementation of Tracr at https: //github. com/google-deepmind/tracr.

NeurIPS Conference 2020 Conference Paper

Meta-trained agents implement Bayes-optimal agents

  • Vladimir Mikulik
  • Grégoire Delétang
  • Tom McGrath
  • Tim Genewein
  • Miljan Martic
  • Shane Legg
  • Pedro Ortega

Memory-based meta-learning is a powerful technique to build agents that adapt fast to any task within a target distribution. A previous theoretical study has argued that this remarkable performance is because the meta-training protocol incentivises agents to behave Bayes-optimally. We empirically investigate this claim on a number of prediction and bandit tasks. Inspired by ideas from theoretical computer science, we show that meta-learned and Bayes-optimal agents not only behave alike, but they even share a similar computational structure, in the sense that one agent system can approximately simulate the other. Furthermore, we show that Bayes-optimal agents are fixed points of the meta-learning dynamics. Our results suggest that memory-based meta-learning is a general technique for numerically approximating Bayes-optimal agents; that is, even for task distributions for which we currently don't possess tractable models.

v2026.09.13