2007

An Empirical Evaluation of Deep Architectures on Problems With Many Factors of Variation

Hugo Larochelle, Dumitru Erhan, Aaron Courville, James Bergstra, Yoshua Bengio

citations

Cite Score

45

AI summary

This paper introduces deep belief networks (DBN-3) and stacked autoencoders (SAA-3) models and compares their performance with other algorithms on datasets with many factors of variation, such as MNIST variations and convex set recognition, finding that deep architecture models generally outperform shallow models but are sensitive to hyper-parameter selection.

Main Contributions

  • Introduces a suite of datasets that spans some of the territory between MNIST and NORB-starting with MNIST, and introducing multiple factors of variation such as rotation and background manipulations.
  • Demonstrates that deep architecture models show globally the best performance on the introduced datasets.
  • Shows that the improvement provided by deep architecture models is most notable for factors of variation related to background.
  • Provides empirical evidence that deep architecture models compare favorably to other state-of-the-art learning algorithms on learning problems with many factors of variation.
  • Analyzes the relationships between the performance of learning algorithms and certain properties of the problems considered.

Abstract

Recently, several learning algorithms relying on models with deep architectures have been proposed. Though they have demonstrated impressive performance, to date, they have only been evaluated on relatively simple problems such as digit recognition in a controlled environment, for which many machine learning algorithms already report reasonable results. Here, we present a series of experiments which indicate that these models show promise in solving harder learning problems that exhibit many factors of variation. These models are compared with well-established algorithms such as Support Vector Machines and single hidden-layer feed-forward neural networks.

Citation Graph

Loading graph...

References [12]

Sort:
Filter:

Geoffrey Hinton, Ruslan Salakhutdinov - 2006

37 papers in library cite

Geoffrey E. Hinton, S. Osindero, Y. Teh - 2006

43 papers in library cite

Yann Lecun, B. Boser, John S. Denker, D. Henderson, R. E. Howard, W. Hubbard, L. D. Jackal - 1989

24 papers in library cite

Yoshua Bengio, P. Lamblin, D. Popovici, Hugo Larochelle - 2006

33 papers in library cite

Geoffrey Hinton - 2002

23 papers in library cite

Yoshua Bengio, Yann Lecun - 2007

15 papers in library cite

Yann Lecun, Fu Jie Huang, Leon Bottou - 2004

18 papers in library cite

Geoffrey Hinton - 2006

5 papers in library cite

M. Welling, M. R. Zvi, Geoffrey Hinton - 2005

8 papers in library cite

D. Decoste, B. Scholkopf - 2002

6 papers in library cite

Ruslan Salakhutdinov, Geoffrey Hinton - 2007

5 papers in library cite

C. C. Chang, C. J. Lin - 2001

4 papers in library cite

Cited by

13

papers in your library

Cites

8

papers in your library

Read

on July 31, 2025

Your review

Tags

Paper Aliases

No aliases