| Paper: | MLSP-L3.5 | ||
| Session: | Learning Theory and Modeling | ||
| Time: | Friday, May 21, 16:50 - 17:10 | ||
| Presentation: | Lecture | ||
| Topic: | Machine Learning for Signal Processing: Learning Theory and Modeling | ||
| Title: | A GENTLE HESSIAN FOR EFFICIENT GRADIENT DESCENT | ||
| Authors: | Ronan Collobert; IDIAP | ||
| Samy Bengio; IDIAP | |||
| Abstract: | Several second-order optimization methods for gradient descent algorithms have been proposed over the years, but they usually need to compute the inverse of the Hessian of the cost function (or an approximation of this inverse) during training. In most cases, this leads to an O(n^2) cost in time and space per iteration, where n is the number of parameters, which is prohibitive for large n. We propose instead a study of the Hessian before training. Based on a second order analysis, we show that a block-diagonal Hessian yields an easier optimization problem than a full Hessian. We also show that the condition of block-diagonality in common machine learning models can be achieved by simply selecting an appropriate training criterion. Finally, we propose a version of the SVM criterion applied to MLPs, which verifies the aspects highlighted in this second order analysis, but also yields very good generalization performance in practice, taking advantage of the margin effect. Several empirical comparisons on two benchmark datasets are give to illustrate this approach. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops