New Quasi-Newton Methods for Efficient Large-Scale Machine Learning
published: Dec. 29, 2007, recorded: December 2007, views: 6950
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
The BFGS quasi-Newton method and its limited-memory variant LBFGS revolutionized nonlinear optimization, and dominate it to this day. Their application to large-scale machine learning, however, has been hindered by the fact that they assume a smooth, strictly convex, and deterministic objective function in a finite-dimensional vector space. Here we relax these assumptions one by one, and present (L)BFGS variants newly developed in our group that perform well on non-convex smooth, quasi-convex non-smooth, and non-deterministic objectives. Paradigmatic applications include parameter estimation in MLPs (non-convex smooth) and SVMs (convex non-smooth), and stochastic approximation of gradients (non-deterministic) for efficient online learning on large data sets.
We are also able to lift LBFGS to an RKHS for online SVM training. In all these cases our BFGS variants outperform previous methods on a wide variety of models and data sets, from toy problems to large-scale data-mining tasks.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !