activity
20092026
most citedCompetition-Level Code Generation with AlphaCode

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

collaborators
Showing 2016Show all

18 papers · 1 filter

cs.CV2016

Multi-way Particle Swarm Fusion

Chen Liu, Hang Yan, Pushmeet Kohli +1

This paper proposes a novel MAP inference framework for Markov Random Field (MRF) in parallel computing environments. The inference framework, dubbed Swarm Fusion, is a natural gen…

cs.CV2016★ 4 cited

Deep Multi-Modal Image Correspondence Learning

Chen Liu, Jiajun Wu, Pushmeet Kohli +1

Inference of correspondences between images from different modalities is an extremely important perceptual ability that enables humans to understand and recognize cross-modal conce…

cs.LG2016★ 1 cited

Learning to superoptimize programs - Workshop Version

Rudy Bunel, Alban Desmaison, M. Pawan Kumar +2

Superoptimization requires the estimation of the best program for a given computational task. In order to deal with large programs, superoptimization techniques perform a stochasti…

cs.LG2016★ 2 cited

Summary - TerpreT: A Probabilistic Programming Language for Program Induction

Alexander L. Gaunt, Marc Brockschmidt, Rishabh Singh +4

We study machine learning formulations of inductive program synthesis; that is, given input-output examples, synthesize source code that maps inputs to corresponding outputs. Our k…

stat.ML2016★ 7 cited

Inducing Interpretable Representations with Variational Autoencoders

N. Siddharth, Brooks Paige, Alban Desmaison +5

We develop a framework for incorporating structured graphical models in the \emph{encoders} of variational autoencoders (VAEs) that allows us to induce interpretable representation…

cs.LG2016★ 33 cited

Batched Gaussian Process Bandit Optimization via Determinantal Point Processes

Tarun Kathuria, Amit Deshpande, Pushmeet Kohli

Gaussian Process bandit optimization has emerged as a powerful tool for optimizing noisy black box functions. One example in machine learning is hyper-parameter optimization where…

cs.AI2016★ 103 cited

Neuro-Symbolic Program Synthesis

Emilio Parisotto, Abdel-rahman Mohamed, Rishabh Singh +3

Recent years have seen the proposal of a number of neural architectures for the problem of Program Induction. Given a set of input-output examples, these architectures are able to…

cs.CV2016★ 18 cited

Memory-augmented Attention Modelling for Videos

Rasool Fakoor, Abdel-rahman Mohamed, Margaret Mitchell +2

We present a method to improve video description generation by modeling higher-order interactions between video frames and described concepts. By storing past visual attention in t…

cs.LG2016★ 17 cited

Learning to superoptimize programs

Rudy Bunel, Alban Desmaison, M. Pawan Kumar +2

Code super-optimization is the task of transforming any given program to a more efficient version while preserving its input-output behaviour. In some sense, it is similar to the p…

cs.LG2016★ 43 cited

Learning Continuous Semantic Representations of Symbolic Expressions

Miltiadis Allamanis, Pankajan Chanthirasegaran, Pushmeet Kohli +1

Combining abstract, symbolic reasoning with continuous neural reasoning is a grand challenge of representation learning. As a step in this direction, we propose a new architecture,…

cs.CV2016★ 1 cited

Deep disentangled representations for volumetric reconstruction

Edward Grant, Pushmeet Kohli, Marcel van Gerven

We introduce a convolutional neural network for inferring a compact disentangled graphical description of objects from 2D images that can be used for volumetric reconstruction. The…

cs.CV2016

Efficient Continuous Relaxations for Dense CRF

Alban Desmaison, Rudy Bunel, Pushmeet Kohli +2

Dense conditional random fields (CRF) with Gaussian pairwise potentials have emerged as a popular framework for several computer vision applications such as stereo correspondence a…

cs.LG2016★ 81 cited

TerpreT: A Probabilistic Programming Language for Program Induction

Alexander L. Gaunt, Marc Brockschmidt, Rishabh Singh +4

We study machine learning formulations of inductive program synthesis; given input-output examples, we try to synthesize source code that maps inputs to corresponding outputs. Our…

cs.AI2016★ 28 cited

Adaptive Neural Compilation

Rudy Bunel, Alban Desmaison, Pushmeet Kohli +2

This paper proposes an adaptive neural-compilation framework to address the problem of efficient program learning. Traditional code optimisation strategies used in compilers are ba…

cs.CL2016★ 110 cited

Visual Storytelling

Ting-Hao, Huang, Francis Ferraro +13

We introduce the first dataset for sequential vision-to-language, and explore how this data may be used for the task of visual storytelling. The first release of this dataset, SIND…

cs.CL2016★ 97 cited

A Corpus and Evaluation Framework for Deeper Understanding of Commonsense Stories

Nasrin Mostafazadeh, Nathanael Chambers, Xiaodong He +5

Representation and learning of commonsense knowledge is one of the foundational problems in the quest to enable deep language understanding. This issue is particularly challenging…

cs.CV2016

Learning to Navigate the Energy Landscape

Julien Valentin, Angela Dai, Matthias Nießner +4

In this paper, we present a novel and efficient architecture for addressing computer vision problems that use `Analysis by Synthesis'. Analysis by synthesis involves the minimizati…

cs.CV2016★ 10 cited

DeepContext: Context-Encoding Neural Pathways for 3D Holistic Scene Understanding

Yinda Zhang, Mingru Bai, Pushmeet Kohli +2

While deep neural networks have led to human-level performance on computer vision tasks, they have yet to demonstrate similar gains for holistic scene understanding. In particular,…