2.6k citations · 5.6k across the 24 of their papers we have counts for
6 papers · 1 filter
Learnability and Complexity of Quantum Samples
Murphy Yuezhen Niu, Andrew M. Dai, Li Li +5
Given a quantum circuit, a quantum computer can sample the output distribution exponentially faster in the number of bits than classical computers. A similar exponential separation…
SMYRF: Efficient Attention using Asymmetric Clustering
Giannis Daras, Nikita Kitaev, Augustus Odena +1
We propose a novel type of balanced clustering algorithm to approximate attention. Attention complexity is reduced from to , where is the sequence length.…
BUSTLE: Bottom-Up Program Synthesis Through Learning-Guided Exploration
Augustus Odena, Kensen Shi, David Bieber +3
Program synthesis is challenging largely because of the difficulty of search in a large space of programs. Human programmers routinely tackle the task of writing complex programs b…
Learning to Represent Programs with Property Signatures
Augustus Odena, Charles Sutton
We introduce the notion of property signatures, a representation for programs and program specifications meant for consumption by machine learning algorithms. Given a function with…
Top-k Training of GANs: Improving GAN Performance by Throwing Away Bad Samples
Samarth Sinha, Zhengli Zhao, Anirudh Goyal +2
We introduce a simple (one line of code) modification to the Generative Adversarial Network (GAN) training algorithm that materially improves results with no increase in computatio…
Improved Consistency Regularization for GANs
Zhengli Zhao, Sameer Singh, Honglak Lee +3
Recent work has increased the performance of Generative Adversarial Networks (GANs) by enforcing a consistency cost on the discriminator. We improve on this technique in several wa…