Learning the Structure of Deep Architectures Using L1 Regularization

By Praveen Kulkarni, Joaquin Zepeda, Frédéric Jurie, Patrick Pérez, Louis Chevallier. 2015

22 citations recorded by the source corpus.

We present a method that formulates the selection of the structure of a deep architecture as a penalized, discriminative learning problem. Up to now, the structure of deep architectures has been fixed by hand, and only the weights are learned using discriminative learning. Our work is a first attempt towards a more formal method of deep structure selection. We consider architectures consisting only of fully-connected layers, and our approach relies on diagonal matrices inserted between subsequent layers. By including an L1 norm of the diagonal entries of said matrices as a regularization penalty, we force the diagonals to be sparse, accordingly selecting the effective number of rows (respectively, columns) of the corresponding layer's (next layer's) weights matrix. We carry out experiments on a standard dataset and show that our method succeeds in selecting the structure of deep architectures of multiple layers. One variant of our architecture results in a feature vector of size as little as $36$, while retaining very high image classification performance.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Jakob Verbeek
  2. Quoc V. Le
  3. Christian Haase-Schuetz
  4. Werner Wiesbeck
  5. Di Feng
  6. Graham W. Taylor
  7. Klaus C. J. Dietmayer
  8. Saurabh Saxena

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Cordelia Schmid
  3. Dacheng Tao
  4. Xiaogang Wang
  5. Trevor Darrell
  6. Ming-Hsuan Yang
  7. Alan L. Yuille
  8. Jitendra Malik

Citations in the corpus