Representation Learning: A Review and New Perspectives

Abstract

The success of machine learning algorithms generally depends on data representation, and we hypothesize that this is because different representations can entangle and hide more or less the different explanatory factors of variation behind the data. Although specific domain knowledge can be used to help design representations, learning with generic priors can also be used, and the quest for AI is motivating the design of more powerful representation-learning algorithms implementing such priors. This paper reviews recent work in the area of unsupervised feature learning and deep learning, covering advances in probabilistic models, autoencoders, manifold learning, and deep networks. This motivates longer term unanswered questions about the appropriate objectives for learning good representations, for computing representations (i.e., inference), and the geometrical connections between representation learning, density estimation, and manifold learning.

Cite this paper

Related papers

1. Long Short-Term Memory1997
2. Gradient-based learning applied to document recognition1998
3. Particle swarm optimization2002
4. LIBSVM2011
5. Greedy function approximation: A gradient boosting machine.2001