### Abstract

We describe a novel unsupervised method for learning sparse, overcomplete features. The model uses a linear encoder, and a linear decoder preceded by a sparsifying non-linearity that turns a code vector into a quasi-binary sparse code vector. Given an input, the optimal code minimizes the distance between the output of the decoder and the input patch while being as similar as possible to the encoder output. Learning proceeds in a two-phase EM-like fashion: (1) compute the minimum-energy code vector, (2) adjust the parameters of the encoder and decoder so as to decrease the energy. The model produces "stroke detectors" when trained on handwritten numerals, and Gabor-like filters when trained on natural image patches. Inference and learning are very fast, requiring no preprocessing, and no expensive sampling. Using the proposed unsupervised method to initialize the first layer of a convolutional network, we achieved an error rate slightly lower than the best reported result on the MNIST dataset. Finally, an extension of the method is described to learn topographical filter maps.

Original language | English (US) |
---|---|

Title of host publication | Advances in Neural Information Processing Systems 19 - Proceedings of the 2006 Conference |

Pages | 1137-1144 |

Number of pages | 8 |

State | Published - 2007 |

Event | 20th Annual Conference on Neural Information Processing Systems, NIPS 2006 - Vancouver, BC, Canada Duration: Dec 4 2006 → Dec 7 2006 |

### Other

Other | 20th Annual Conference on Neural Information Processing Systems, NIPS 2006 |
---|---|

Country | Canada |

City | Vancouver, BC |

Period | 12/4/06 → 12/7/06 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Networks and Communications
- Information Systems
- Signal Processing

### Cite this

*Advances in Neural Information Processing Systems 19 - Proceedings of the 2006 Conference*(pp. 1137-1144)

**Efficient learning of sparse representations with an energy-based model.** / Ranzato, Marc Aurelio; Poultney, Christopher; Chopra, Sumit; LeCun, Yann.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Advances in Neural Information Processing Systems 19 - Proceedings of the 2006 Conference.*pp. 1137-1144, 20th Annual Conference on Neural Information Processing Systems, NIPS 2006, Vancouver, BC, Canada, 12/4/06.

}

TY - GEN

T1 - Efficient learning of sparse representations with an energy-based model

AU - Ranzato, Marc Aurelio

AU - Poultney, Christopher

AU - Chopra, Sumit

AU - LeCun, Yann

PY - 2007

Y1 - 2007

N2 - We describe a novel unsupervised method for learning sparse, overcomplete features. The model uses a linear encoder, and a linear decoder preceded by a sparsifying non-linearity that turns a code vector into a quasi-binary sparse code vector. Given an input, the optimal code minimizes the distance between the output of the decoder and the input patch while being as similar as possible to the encoder output. Learning proceeds in a two-phase EM-like fashion: (1) compute the minimum-energy code vector, (2) adjust the parameters of the encoder and decoder so as to decrease the energy. The model produces "stroke detectors" when trained on handwritten numerals, and Gabor-like filters when trained on natural image patches. Inference and learning are very fast, requiring no preprocessing, and no expensive sampling. Using the proposed unsupervised method to initialize the first layer of a convolutional network, we achieved an error rate slightly lower than the best reported result on the MNIST dataset. Finally, an extension of the method is described to learn topographical filter maps.

AB - We describe a novel unsupervised method for learning sparse, overcomplete features. The model uses a linear encoder, and a linear decoder preceded by a sparsifying non-linearity that turns a code vector into a quasi-binary sparse code vector. Given an input, the optimal code minimizes the distance between the output of the decoder and the input patch while being as similar as possible to the encoder output. Learning proceeds in a two-phase EM-like fashion: (1) compute the minimum-energy code vector, (2) adjust the parameters of the encoder and decoder so as to decrease the energy. The model produces "stroke detectors" when trained on handwritten numerals, and Gabor-like filters when trained on natural image patches. Inference and learning are very fast, requiring no preprocessing, and no expensive sampling. Using the proposed unsupervised method to initialize the first layer of a convolutional network, we achieved an error rate slightly lower than the best reported result on the MNIST dataset. Finally, an extension of the method is described to learn topographical filter maps.

UR - http://www.scopus.com/inward/record.url?scp=84864069017&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84864069017&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84864069017

SN - 9780262195683

SP - 1137

EP - 1144

BT - Advances in Neural Information Processing Systems 19 - Proceedings of the 2006 Conference

ER -