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

Neil C. Rabinowitz

dblp:156/0289 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
3since 2021 · last 2022
0000-0002-4030-1567ORCID · verified

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

Artificial intelligence and machine learning · 8 · 1 first-author · 3 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
8 papers
Reinforcement learning · 47% Trustworthy machine learning · 17% Knowledge representation and reasoning · 10%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
exploration
1.022022
Semantic Exploration from Language Abstractions and Pretrained Representations · NeurIPS 2022
Making Efficient Use of Demonstrations to Solve Hard Exploration Problems · ICLR 2020
Machine learning › Trustworthy machine learning
interpretability
0.922022
Explainability Via Causal Self-Talk · NeurIPS 2022
On the importance of single directions for generalization · ICLR (Poster) 2018
Machine learning › Reinforcement learning
model-based reinforcement learning
0.722019
Relational Forward Models for Multi-Agent Learning · ICLR (Poster) 2019
The Predictron: End-To-End Learning and Planning · ICML 2017
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning
0.612022
Tell me why! Explanations support learning relational and causal structure · ICML 2022
Machine learning › Reinforcement learning
deep reinforcement learning
0.612022
Explainability Via Causal Self-Talk · NeurIPS 2022
Machine learning › Reinforcement learning › goal-conditioned reinforcement learning
language-conditioned reinforcement learning
0.612022
Tell me why! Explanations support learning relational and causal structure · ICML 2022
Computer vision › Vision and language
multimodal representation
0.612022
Semantic Exploration from Language Abstractions and Pretrained Representations · NeurIPS 2022
Machine learning › Reinforcement learning › exploration
novelty-based exploration
0.612022
Semantic Exploration from Language Abstractions and Pretrained Representations · NeurIPS 2022
Machine learning › Trustworthy machine learning › interpretability › natural language explanation
self-explanation
0.612022
Explainability Via Causal Self-Talk · NeurIPS 2022
Machine learning › Reinforcement learning › exploration › exploration in markov decision processes
hard exploration
0.412020
Making Efficient Use of Demonstrations to Solve Hard Exploration Problems · ICLR 2020
Robotics › Robot manipulation
learning from demonstration
0.412020
Making Efficient Use of Demonstrations to Solve Hard Exploration Problems · ICLR 2020
Knowledge, reasoning and agents › Multi-agent systems
multi-agent learning
0.412019
Relational Forward Models for Multi-Agent Learning · ICLR (Poster) 2019
Machine learning › Transfer learning and domain adaptation
few-shot learning
0.312018
Machine Theory of Mind · ICML 2018
Machine learning › Transfer learning and domain adaptation
meta-learning
0.312018
Machine Theory of Mind · ICML 2018
Knowledge, reasoning and agents › Knowledge representation and reasoning
theory of mind
0.312018
Machine Theory of Mind · ICML 2018
Machine learning › Reinforcement learning
value prediction
0.312017
The Predictron: End-To-End Learning and Planning · ICML 2017
Machine learning › Representation and self-supervised learning › pre-training
pre-trained representations
0.212022
Semantic Exploration from Language Abstractions and Pretrained Representations · NeurIPS 2022
Machine learning › Learning theory
generalization
0.112018
On the importance of single directions for generalization · ICLR (Poster) 2018

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

deep reinforcement learning · 1.1vision-language pretraining · 0.6on-policy RL · 0.6off-policy RL · 0.6language prediction · 0.6explanation training · 0.6causal models · 0.6demonstration-based learning · 0.4relational model · 0.4graph neural network · 0.4
YearPublicationVenuePosition
2022 Tell me why! Explanations support learning relational and causal structure
abstract
Inferring the abstract relational and causal structure of the world is a major challenge for reinforcement-learning (RL) agents. For humans, language{—}particularly in the form of explanations{—}plays a considerable role in overcoming this challenge. Here, we show that language can play a similar role for deep RL agents in complex environments. While agents typically struggle to acquire relational and causal knowledge, augmenting their experience by training them to predict language descriptions and explanations can overcome these limitations. We show that language can help agents learn challenging relational tasks, and examine which aspects of language contribute to its benefits. We then show that explanations can help agents to infer not only relational but also causal structure. Language can shape the way that agents to generalize out-of-distribution from ambiguous, causally-confounded training, and explanations even allow agents to learn to perform experimental interventions to identify causal relationships. Our results suggest that language description and explanation may be powerful tools for improving agent learning and generalization.
Andrew K. Lampinen, Nicholas A. Roy, Ishita Dasgupta 0001, Stephanie C. Y. Chan, Allison C. Tam, James L. McClelland, Adam Santoro, Neil C. Rabinowitz, Jane X. Wang, Felix Hill
ICML9
2022 Explainability Via Causal Self-Talk
abstract
Explaining the behavior of AI systems is an important problem that, in practice, is generally avoided. While the XAI community has been developing an abundance of techniques, most incur a set of costs that the wider deep learning community has been unwilling to pay in most situations. We take a pragmatic view of the issue, and define a set of desiderata that capture both the ambitions of XAI and the practical constraints of deep learning. We describe an effective way to satisfy all the desiderata: train the AI system to build a causal model of itself. We develop an instance of this solution for Deep RL agents: Causal Self-Talk. CST operates by training the agent to communicate with itself across time. We implement this method in a simulated 3D environment, and show how it enables agents to generate faithful and semantically-meaningful explanations of their own behavior. Beyond explanations, we also demonstrate that these learned models provide new ways of building semantic control interfaces to AI systems.
Nicholas A. Roy, Junkyung Kim, Neil C. Rabinowitz
NeurIPS3
2022 Semantic Exploration from Language Abstractions and Pretrained Representations
abstract
Effective exploration is a challenge in reinforcement learning (RL). Novelty-based exploration methods can suffer in high-dimensional state spaces, such as continuous partially-observable 3D environments. We address this challenge by defining novelty using semantically meaningful state abstractions, which can be found in learned representations shaped by natural language. In particular, we evaluate vision-language representations, pretrained on natural image captioning datasets. We show that these pretrained representations drive meaningful, task-relevant exploration and improve performance on 3D simulated environments. We also characterize why and how language provides useful abstractions for exploration by considering the impacts of using representations from a pretrained model, a language oracle, and several ablations. We demonstrate the benefits of our approach with on- and off-policy RL algorithms and in two very different task domains---one that stresses the identification and manipulation of everyday objects, and one that requires navigational exploration in an expansive world. Our results suggest that using language-shaped representations could improve exploration for various algorithms and agents in challenging environments.
Allison C. Tam, Neil C. Rabinowitz, Andrew K. Lampinen, Nicholas A. Roy, Stephanie C. Y. Chan, DJ Strouse, Jane X. Wang, Andrea Banino, Felix Hill
NeurIPS2
2020 Making Efficient Use of Demonstrations to Solve Hard Exploration Problems
Caglar Gulcehre, Tom Le Paine, Bobak Shahriari, Misha Denil, Matt Hoffman 0001, Hubert Soyer, Richard Tanburn, Steven Kapturowski, Neil C. Rabinowitz, Duncan Williams, Gabriel Barth-Maron, Ziyu Wang 0001, Nando de Freitas
ICLR9
2019 Relational Forward Models for Multi-Agent Learning
Andrea Tacchetti, H. Francis Song, Pedro A. M. Mediano, Vinícius Flores Zambaldi, János Kramár, Neil C. Rabinowitz, Thore Graepel, Matt M. Botvinick, Peter W. Battaglia
ICLR (Poster)6
2018 On the importance of single directions for generalization
Ari S. Morcos, David G. T. Barrett, Neil C. Rabinowitz, Matt M. Botvinick
ICLR (Poster)3
2018 Machine Theory of Mind
abstract
Theory of mind (ToM) broadly refers to humans’ ability to represent the mental states of others, including their desires, beliefs, and intentions. We design a Theory of Mind neural network {–} a ToMnet {–} which uses meta-learning to build such models of the agents it encounters. The ToMnet learns a strong prior model for agents’ future behaviour, and, using only a small number of behavioural observations, can bootstrap to richer predictions about agents’ characteristics and mental states. We apply the ToMnet to agents behaving in simple gridworld environments, showing that it learns to model random, algorithmic, and deep RL agents from varied populations, and that it passes classic ToM tasks such as the "Sally-Anne" test of recognising that others can hold false beliefs about the world.
Neil C. Rabinowitz, Frank Perbet, H. Francis Song, Chiyuan Zhang, S. M. Ali Eslami, Matt M. Botvinick
ICML1
2017 The Predictron: End-To-End Learning and Planning
abstract
One of the key challenges of artificial intelligence is to learn models that are effective in the context of planning. In this document we introduce the predictron architecture. The predictron consists of a fully abstract model, represented by a Markov reward process, that can be rolled forward multiple “imagined” planning steps. Each forward pass of the predictron accumulates internal rewards and values over multiple planning depths. The predictron is trained end-to-end so as to make these accumulated values accurately approximate the true value function. We applied the predictron to procedurally generated random mazes and a simulator for the game of pool. The predictron yielded significantly more accurate predictions than conventional deep neural network architectures.
David Silver 0001, Hado van Hasselt, Matteo Hessel, Tom Schaul, Arthur Guez, Tim Harley, Gabriel Dulac-Arnold, David P. Reichert, Neil C. Rabinowitz, André Barreto 0001, Thomas Degris
ICML9