197 citations · 238 across the 4 of their papers we have counts for
4 papers
Learning Representations by Maximizing Compression
Karol Gregor, Yann LeCun
We give an algorithm that learns a representation of data through compression. The algorithm 1) predicts bits sequentially from those previously seen and 2) has a structure and a n…
Efficient Learning of Sparse Invariant Representations
Karol Gregor, Yann LeCun
We propose a simple and efficient algorithm for learning sparse invariant representations from unlabeled data with fast inference. When trained on short movies sequences, the learn…
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCun
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of th…
Convolutional Matching Pursuit and Dictionary Training
Arthur Szlam, Koray Kavukcuoglu, Yann LeCun
Matching pursuit and K-SVD is demonstrated in the translation invariant setting