activity
20092026
most citedCompetition-Level Code Generation with AlphaCode

1k citations · 8k across the 112 of their papers we have counts for

collaborators
Showing 2019 · cs.LGShow all

11 papers · 2 filters

cs.LG2019

Achieving Robustness in the Wild via Adversarial Mixing with Disentangled Representations

Sven Gowal, Chongli Qin, Po-Sen Huang +4

Recent research has made the surprising finding that state-of-the-art deep learning models sometimes fail to generalize to small variations of the input. Adversarial training has b…

cs.LG2019★ 3 cited

Learning Transferable Graph Exploration

Hanjun Dai, Yujia Li, Chenglong Wang +3

This paper considers the problem of efficient exploration of unseen environments, a key challenge in AI. We propose a `learning to explore' framework where we learn a policy from a…

cs.LG2019★ 51 cited

An Alternative Surrogate Loss for PGD-based Adversarial Testing

Sven Gowal, Jonathan Uesato, Chongli Qin +3

Adversarial testing methods based on Projected Gradient Descent (PGD) are widely used for searching norm-bounded perturbations that cause the inputs of neural networks to be miscla…

cs.LG2019★ 41 cited

Branch and Bound for Piecewise Linear Neural Network Verification

Rudy Bunel, Jingyue Lu, Ilker Turkaslan +3

The success of Deep Learning and its potential use in many safety-critical applications has motivated research on formal verification of Neural Network (NN) models. In this context…

cs.LG2019★ 2 cited

Structured agents for physical construction

Victor Bapst, Alvaro Sanchez-Gonzalez, Carl Doersch +4

Physical construction---the ability to compose objects, subject to physical dynamics, to serve some function---is fundamental to human intelligence. We introduce a suite of challen…

cs.LG2019★ 237 cited

Graph Matching Networks for Learning the Similarity of Graph Structured Objects

Yujia Li, Chenjie Gu, Thomas Dullien +2

This paper addresses the challenging problem of retrieval and matching of graph structured objects, and makes two key contributions. First, we demonstrate how Graph Neural Networks…

cs.LG2019★ 174 cited

Are Labels Required for Improving Adversarial Robustness?

Jonathan Uesato, Jean-Baptiste Alayrac, Po-Sen Huang +3

Recent work has uncovered the interesting (and somewhat surprising) finding that training models to be invariant to adversarial perturbations requires substantially larger datasets…

cs.LG2019★ 36 cited

Reinforced Genetic Algorithm Learning for Optimizing Computation Graphs

Aditya Paliwal, Felix Gimeno, Vinod Nair +4

We present a deep reinforcement learning approach to minimizing the execution cost of neural network computation graphs in an optimizing compiler. Unlike earlier learning-based wor…

cs.LG2019★ 1 cited

Knowing When to Stop: Evaluation and Verification of Conformity to Output-size Specifications

Chenglong Wang, Rudy Bunel, Krishnamurthy Dvijotham +3

Models such as Sequence-to-Sequence and Image-to-Sequence are widely used in real world applications. While the ability of these neural architectures to produce variable-length out…

cs.LG2019★ 87 cited

Analysing Mathematical Reasoning Abilities of Neural Models

David Saxton, Edward Grefenstette, Felix Hill +1

Mathematical reasoning---a core ability within human intelligence---presents some unique challenges as a domain: we do not come to understand and solve mathematical problems primar…

cs.LG2019★ 9 cited

Verification of Non-Linear Specifications for Neural Networks

Chongli Qin, Krishnamurthy, Dvijotham +7

Prior work on neural network verification has focused on specifications that are linear functions of the output of the network, e.g., invariance of the classifier output under adve…