Name
Affiliation
Papers
GEOFFREY E HINTON
university college london
214
Collaborators
Citations 
PageRank 
199
40435
4751.69
Referers 
Referees 
References 
68207
1861
1848
Search Limit
1001000
Title
Citations
PageRank
Year
Pix2seq: A Language Modeling Framework for Object Detection00.342022
Unsupervised Part Representation by Flow Capsules00.342021
Teaching with Commentaries00.342021
CvxNet: Learnable Convex Decomposition70.422020
Imputer: Sequence Modelling via Imputation and Dynamic Programming00.342020
Big Self-Supervised Models are Strong Semi-Supervised Learners00.342020
A Simple Framework for Contrastive Learning of Visual Representations20.362020
Analyzing and Improving Representations with the Soft Nearest Neighbor Loss.10.352019
Similarity of Neural Network Representations Revisited.20.362019
When Does Label Smoothing Help?70.402019
Assessing the Scalability of Biologically-Motivated Deep Learning Algorithms and Architectures00.342018
Who Said What: Modeling Individual Labelers Improves Classification120.652018
Illustrative Language Understanding: Large-Scale Visual Grounding With Image Search00.342018
Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer.953.022017
Distilling a Neural Network Into a Soft Decision Tree.180.642017
Regularizing Neural Networks by Penalizing Confident Output Distributions.421.242017
Attend, Infer, Repeat: Fast Scene Understanding with Generative Models00.342016
Layer Normalization.00.342016
A Simple Way to Initialize Recurrent Networks of Rectified Linear Units.943.552015
Distilling the Knowledge in a Neural Network.69621.802015
Application of Deep Belief Networks for Natural Language Understanding832.322014
Grammar as a Foreign Language.23710.732014
Autoregressive product of multi-frame predictions can improve the accuracy of hybrid models.00.342014
Tensor Analyzers.00.342013
Modeling Documents with Deep Boltzmann Machines.643.622013
Discovering Multiple Constraints that are Frequently Approximately Satisfied124.732013
Efficient parametric projection pursuit density estimation11.322012
Deep Lambertian Networks.10.352012
Conditional Restricted Boltzmann Machines for Structured Output Prediction362.242012
Visualizing non-metric similarities in multiple maps281.182012
Two Distributed-State Models For Generating High-Dimensional Time Series421.862011
Transforming auto-encoders747.462011
Modeling the joint density of two images under a variety of transformations171.532011
Deep belief nets for natural language call-routing291.082011
A better way to learn features: technical perspective50.412011
Comparing classification methods for longitudinal fMRI studies.120.742010
Gated Softmax Classification.210.982010
Phone Recognition Using Restricted Boltzmann Machines116.642010
Learning to detect roads in high-resolution aerial images333.152010
Rectified Linear Units Improve Restricted Boltzmann Machines130095.702010
Learning to combine foveal glimpses with a third-order Boltzmann machine.935.692010
Deep belief networks411.482009
Learning Generative Texture Models with extended Fields-of-Experts1327.912009
Deep Boltzmann Machines00.342009
Semantic hashing24817.092009
Replicated Softmax: an Undirected Topic Model.00.342009
Zero-shot Learning with Semantic Output Codes.2287.932009
Products of Hidden Markov Models: it takes N1 to tango30.442009
Deep Boltzmann Machines17216.882009
Workshop summary: Workshop on learning feature hierarchies10.352009
  • 1
  • 2