24.4k citations
- Stanford UniversityUS10 papers
- Courant Institute of Mathematical SciencesUS8 papers
- New York UniversityUS8 papers
- Carnegie Mellon UniversityUS7 papers
- Microsoft (United States)US7 papers
- Google DeepMind (United Kingdom)GB6 papers
- University of California, BerkeleyUS6 papers
- Columbia UniversityUS5 papers
- University of Illinois Urbana-ChampaignUS5 papers
- University of MichiganUS5 papers
- University of OxfordGB5 papers
- University of WashingtonUS5 papers
5 papers · 2 filters
ACCAMS: Additive Co-Clustering to Approximate Matrices Succinctly
Alex Beutel, Amr Ahmed, Alexander J. Smola
Matrix completion and approximation are popular tools to capture a user's preferences for recommendation and to approximate missing data. Instead of using low-rank factorization we…
Multiple Object Recognition with Visual Attention
Jimmy Ba, Volodymyr Mnih, Koray Kavukcuoglu
We present an attention-based model for recognizing multiple objects in images. The proposed model is a deep recurrent neural network trained with reinforcement learning to attend…
Move Evaluation in Go Using Deep Convolutional Neural Networks
Chris J. Maddison, Aja Huang, Ilya Sutskever +1
The game of Go is more challenging than other board games, due to the difficulty of constructing a position or move evaluation function. In this paper we investigate whether deep c…
Skip-gram Language Modeling Using Sparse Non-negative Matrix Probability Estimation
Noam Shazeer, Joris Pelemans, Ciprian Chelba
We present a novel family of language model (LM) estimation techniques named Sparse Non-negative Matrix (SNM) estimation. A first set of experiments empirically evaluating it on th…
Differentially- and non-differentially-private random decision trees
Mariusz Bojarski, Anna Choromanska, Krzysztof Choromanski +1
We consider supervised learning with random decision trees, where the tree construction is completely random. The method is popularly used and works well in practice despite the si…