Sparse Matrix Factorization

Greedy layer-wise training of deep networks

Y. Bengio, D. Popovici P. Lamblin, and H. Larochelle · 2006

Earlier work this paper cites.

A fast learning algorithm for deep belief nets

G. E. Hinton, S. Osinderoand, and Y. Teh · 2006

Earlier work this paper cites.

Efficient learning of sparse representations with an energy-based model

M. Ranzato, C. Poultney, S. Chopra, and Y. LeCun · 2006

Earlier work this paper cites.

Sparse feature learning for deep belief networks

M. Ranzato, Y. Boureau, and Y. LeCun · 2007

Earlier work this paper cites.

Learning deep architectures for ai

Y. Bengio · 2009

Earlier work this paper cites.

Smallest singular value of a random rectangular matrix

M. Rudelson and R. Vershynin · 2009

Cited alongside, same era.

Deep boltzmann machines

R. Salakhutdinov and G. E. Hinton · 2009

Cited alongside, same era.

Random matrices: The distribution of the smallest singular values

T. Tao and V. Vu · 2010

Cited alongside, same era.

Imagenet classification with deep convolutional neural networks

A. Krizhevsky, I. Sutskever, and G. E. Hinton · 2012

Cited alongside, same era.

Universality and the circular law for sparse random matrices

P. M. Wood · 2012

Cited alongside, same era.

Sparse matrix factorization

B. Neyshabur and R. Panigrahy

Cited in the paper.

Provable bounds for learning some deep representations

S. Arora, A. Bhaskara, and T. Ma R. Ge · 2013

Closest in time.

New algorithms for learning incoherent and overcomplete dictionaries

S. Arora, R. Ge, and A. Moitra · 2013

Closest in time.

Representation learning: A review and new perspectives

Y. Bengio, A. Courville, and Vincent · 2013

Closest in time.

Maxout networks

I. J. Goodfellow, D. Warde-Farley, M. Mirza, A. Courville, and Y. Bengio · 2013

Closest in time.

Regularization of neural networks using dropconnect

Li. Wan, Matthew. Zeiler, Sixin. Zhang, Yann. LeCun, and Rob. Fergus · 2013

Closest in time.