← Search

David Budden

14 accepted papers

2022

The CLRS Algorithmic Reasoning Benchmark

ICML 2022spotlight

Learning representations of algorithms is an emerging area of machine learning, seeking to bridge concepts from neural networks with classical algorithms. Several important works have investigated whether neural networks can effectively reason like algorithms, typically by learning to execute them.…

2022

Unified Scaling Laws for Routed Language Models

ICML 2022oral

The performance of a language model has been shown to be effectively modeled as a power-law in its parameter count. Here we study the scaling behaviors of Routing Networks: architectures that conditionally use only a subset of their parameters while processing an input. For these models, parameter c…

2021

Gated Linear Networks

AAAI 2021technical

This paper presents a new family of backpropagation-free neural architectures, Gated Linear Networks (GLNs). What distinguishes GLNs from contemporary neural networks is the distributed and local nature of their credit assignment mechanism; each neuron directly predicts the target, forgoing the abil…

Cited by 48SourcePDFScholar
2020

A Combinatorial Perspective on Transfer Learning

NeurIPS 2020poster

Human intelligence is characterized not only by the capacity to learn complex skills, but the ability to rapidly adapt and acquire new skills within an ever-changing environment. In this work we study how the learning of modular solutions can allow for effective generalization to both unseen and pot…

2020

Gaussian Gated Linear Networks

NeurIPS 2020poster

We propose the Gaussian Gated Linear Network (G-GLN), an extension to the recently proposed GLN family of deep neural networks. Instead of using backpropagation to learn features, GLNs have a distributed and local credit assignment mechanism based on optimizing a convex objective. This gives rise to…

2020

Modular Meta-Learning with Shrinkage

NeurIPS 2020spotlight

Many real-world problems, including multi-speaker text-to-speech synthesis, can greatly benefit from the ability to meta-learn large models with only a few task- specific components. Updating only these task-specific modules then allows the model to be adapted to low-data tasks for as many steps as…

Cited by 51SourcePDFScholar
2020

Online Learning in Contextual Bandits using Gated Linear Networks

NeurIPS 2020poster

We introduce a new and completely online contextual bandit algorithm called Gated Linear Contextual Bandits (GLCB). This algorithm is based on Gated Linear Networks (GLNs), a recently introduced deep learning architecture with properties well-suited to the online setting. Leveraging data-dependent g…

2020

Scaling data-driven robotics with reward sketching and batch reinforcement learning

RSS 2020poster

By harnessing a growing dataset of robot experience, we learn control policies for a diverse and increasing set of related manipulation tasks. To make this possible, we introduce reward sketching: an effective way of eliciting human preferences to learn the reward function for a new task. This rewar…

2020

Task-Relevant Adversarial Imitation Learning

CoRL 2020

We show that a critical vulnerability in adversarial imitation is the tendency of discriminator networks to learn spurious associations between visual features and expert labels. When the discriminator focuses on task-irrelevant features, it does not provide an informative reward signal, leading to

Cited by 0SourcePDFScholar
2019

Sample Efficient Adaptive Text-to-Speech

ICLR 2019poster

We present a meta-learning approach for adaptive text-to-speech (TTS) with few data. During training, we learn a multi-speaker model using a shared conditional WaveNet core and independent learned embeddings for each speaker. The aim of training is not to produce a neural network with fixed weights,…

Cited by 177SourcePDFScholar
2018

Distributed Distributional Deterministic Policy Gradients

ICLR 2018poster

This work adopts the very successful distributional perspective on reinforcement learning and adapts it to the continuous control setting. We combine this within a distributed framework for off-policy learning in order to develop what we call the Distributed Distributional Deep Deterministic Policy…

Cited by 726SourcePDFScholar
2018

Distributed Prioritized Experience Replay

ICLR 2018poster

We propose a distributed architecture for deep reinforcement learning at scale, that enables agents to learn effectively from orders of magnitude more data than previously possible. The algorithm decouples acting from learning: the actors interact with their own instances of the environment by selec…

Cited by 0SourcePDFScholar
2018

Playing hard exploration games by watching YouTube

NeurIPS 2018spotlight

Deep reinforcement learning methods traditionally struggle with tasks where environment rewards are particularly sparse. One successful method of guiding exploration in these domains is to imitate trajectories provided by a human demonstrator. However, these demonstrations are typically collected un…

Cited by 329SourcePDFScholar
2017

Deep Tensor Convolution on Multicores

ICML 2017poster

Deep convolutional neural networks (ConvNets) of 3-dimensional kernels allow joint modeling of spatiotemporal features. These networks have improved performance of video and volumetric image analysis, but have been limited in size due to the low memory ceiling of GPU hardware. Existing CPU implement…