Provable Methods for Training Neural Networks with Sparse Connectivity

A method of solving a convex programming problem with convergence rate o (1/k2)

Yurii Nesterov · 1983

Earlier work this paper cites.

Approximate computation of expectations

Charles Stein · 1986

Earlier work this paper cites.

On principal hessian directions for data visualization and dimension reduction: another application of stein’s lemma

Ker-Chau Li · 1992

Earlier work this paper cites.

Principal hessian directions revisited

R Dennis Cook · 1998

Earlier work this paper cites.

Exploiting generative models in discriminative classifiers

Tommi Jaakkola, David Haussler, et al · 1999

Earlier work this paper cites.

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

Ingrid Daubechies, Michel Defrise, and Christine De Mol · 2004

Earlier work this paper cites.

Use of exchangeable pairs in the analysis of simulations

Charles Stein, Persi Diaconis, Susan Holmes, Gesine Reinert, et al · 2004

Earlier work this paper cites.

Convex neural networks

Yoshua Bengio, Nicolas L Roux, Pascal Vincent, Olivier Delalleau, and Patrice Marcotte · 2005

Earlier work this paper cites.

Estimation of non-normalized statistical models by score matching

Aapo Hyvärinen · 2005

Earlier work this paper cites.

Pattern recognition and machine learning , volume 1

Christopher M Bishop et al · 2006

Earlier work this paper cites.

Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems

Mário AT Figueiredo, Robert D Nowak, and Stephen J Wright · 2007

Cited alongside, same era.

An interior-point method for large-scale l 1-regularized least squares

Seung-Jean Kim, Kwangmoo Koh, Michael Lustig, Stephen Boyd, and Dimitry Gorinevsky · 2007

Cited alongside, same era.

Gradient methods for minimizing composite objective function, 2007

Yurii Nesterov et al · 2007

Cited alongside, same era.

Multi-label classification: An overview

Grigorios Tsoumakas and Ioannis Katakis · 2007

Cited alongside, same era.

On stein identity, chernoff inequality, and orthogonal polynomials

Zhengyuan Wei, Xinsheng Zhang, and Taifu Li · 2010

Cited alongside, same era.

On autoencoders and score matching for energy based models

Kevin Swersky, David Buchman, Nando D Freitas, Benjamin M Marlin, et al · 2011

Exact recovery of sparsely-used dictionaries

Daniel A Spielman, Huan Wang, and John Wright · 2012

Later among the works it cites.

Provable bounds for learning some deep representations

Original

Sanjeev Arora, Aditya Bhaskara, Rong Ge, and Tengyu Ma · 2013

Later among the works it cites.

Low-rank approximations for conditional feedforward computation

Original

Andrew Davis and Itamar Arel · 2013

Later among the works it cites.

Integration by parts and representation of information functionals

Original

Ivan Nourdin, Giovanni Peccati, and Yvik Swan · 2013

Later among the works it cites.

Learning mixtures of linear classifiers

Original

Yuekai Sun, Stratis Ioannidis, and Andrea Montanari · 2013