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

David Saxton

dblp:95/8795 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

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
Language models and text generation · 33% Probabilistic and Bayesian machine learning · 30% Knowledge representation and reasoning · 22%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › mathematical reasoning
mathematical problem solving
0.412019
Analysing Mathematical Reasoning Abilities of Neural Models · ICLR (Poster) 2019
Natural language and speech › Language models and text generation
mathematical reasoning
0.412019
Analysing Mathematical Reasoning Abilities of Neural Models · ICLR (Poster) 2019
Knowledge, reasoning and agents › Knowledge representation and reasoning
neural reasoning
0.412019
Analysing Mathematical Reasoning Abilities of Neural Models · ICLR (Poster) 2019
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process › neural processes
conditional neural process
0.312018
Conditional Neural Processes · ICML 2018
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.312018
Conditional Neural Processes · ICML 2018
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic-based reasoning
logical entailment
0.312018
Can Neural Networks Understand Logical Entailment? · ICLR (Poster) 2018
Natural language and speech › Language models and text generation › natural language understanding › sentence pair modeling
natural language inference
0.312018
Can Neural Networks Understand Logical Entailment? · ICLR (Poster) 2018
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process
neural processes
0.312018
Conditional Neural Processes · ICML 2018
Machine learning › Reinforcement learning
exploration
0.212016
Unifying Count-Based Exploration and Intrinsic Motivation · NIPS 2016
Machine learning › Reinforcement learning › exploration
intrinsic motivation
0.212016
Unifying Count-Based Exploration and Intrinsic Motivation · NIPS 2016

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

neural language model · 0.4stochastic process · 0.3neural network · 0.3gradient descent · 0.3pseudo-count · 0.2density model · 0.2
YearPublicationVenuePosition
2019 Analysing Mathematical Reasoning Abilities of Neural Models
David Saxton, Edward Grefenstette, Felix Hill, Pushmeet Kohli
ICLR (Poster)1
2018 Can Neural Networks Understand Logical Entailment?
Richard Evans 0001, David Saxton, David Amos, Pushmeet Kohli, Edward Grefenstette
ICLR (Poster)2
2018 Conditional Neural Processes
abstract
Deep neural networks excel at function approximation, yet they are typically trained from scratch for each new function. On the other hand, Bayesian methods, such as Gaussian Processes (GPs), exploit prior knowledge to quickly infer the shape of a new function at test time. Yet, GPs are computationally expensive, and it can be hard to design appropriate priors. In this paper we propose a family of neural models, Conditional Neural Processes (CNPs), that combine the benefits of both. CNPs are inspired by the flexibility of stochastic processes such as GPs, but are structured as neural networks and trained via gradient descent. CNPs make accurate predictions after observing only a handful of training data points, yet scale to complex functions and large datasets. We demonstrate the performance and versatility of the approach on a range of canonical machine learning tasks, including regression, classification and image completion.
Marta Garnelo, Dan Rosenbaum, Chris J. Maddison, Tiago Ramalho, David Saxton, Murray Shanahan, Yee Whye Teh, Danilo Jimenez Rezende, S. M. Ali Eslami
ICML5
2016 Unifying Count-Based Exploration and Intrinsic Motivation
abstract
We consider an agent's uncertainty about its environment and the problem of generalizing this uncertainty across states. Specifically, we focus on the problem of exploration in non-tabular reinforcement learning. Drawing inspiration from the intrinsic motivation literature, we use density models to measure uncertainty, and propose a novel algorithm for deriving a pseudo-count from an arbitrary density model. This technique enables us to generalize count-based exploration algorithms to the non-tabular case. We apply our ideas to Atari 2600 games, providing sensible pseudo-counts from raw pixels. We transform these pseudo-counts into exploration bonuses and obtain significantly improved exploration in a number of hard games, including the infamously difficult Montezuma's Revenge.
Marc G. Bellemare, Sriram Srinivasan 0005, Georg Ostrovski, Tom Schaul, David Saxton, Rémi Munos
NIPS5
1984 Implementation of the RELP vocoder using the TMS320
abstract
A very small, high quality RELP Vocoder has been implemented with commercially available Integrated Circuits. This full-duplex, single-card design uses two TI TMS320 Digital Signal Processors. One processor implements the RELP Vocoder Analysis algorithm and the second implements the Synthesis algorithm. The Vocoder operates with a software-controlled, flexible data rate between 9.6 and 32 KBPS. It occupies less than 35 square inches with a power consumption of less than 5 W. A real-time demonstration is available.
Mark Dankberg, Ronald A. Iltis, David Saxton, Phillip Wilson
ICASSP3