Efficient Learning of Sparse Invariant Representations

05/26/2011
by   Karol Gregor, et al.
0

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 learned features are selective to a range of orientations and spatial frequencies, but robust to a wide range of positions, similar to complex cells in the primary visual cortex. We give a hierarchical version of the algorithm, and give guarantees of fast convergence under certain conditions.

READ FULL TEXT

page 4

page 5

page 6

page 11

page 12

page 13

page 14

page 15

research
06/20/2012

Shift-Invariance Sparse Coding for Audio Classification

Sparse coding is an unsupervised learning algorithm that learns a succin...
research
03/09/2021

Dynamic Range Mode Enumeration

The range mode problem is a fundamental problem and there is a lot of wo...
research
11/20/2018

Gen-Oja: A Simple and Efficient Algorithm for Streaming Generalized Eigenvector Computation

In this paper, we study the problems of principal Generalized Eigenvecto...
research
12/04/2018

From biological vision to unsupervised hierarchical sparse coding

The formation of connections between neural cells is emerging essentiall...
research
10/24/2017

Max-Margin Invariant Features from Transformed Unlabeled Data

The study of representations invariant to common transformations of the ...
research
11/18/2015

Unitary-Group Invariant Kernels and Features from Transformed Unlabeled Data

The study of representations invariant to common transformations of the ...

Please sign up or login with your details

Forgot password? Click here to reset