Steppest descent analysis for unregularized linear prediction with strictly convex penalties
author: Matus Telgarsky,
Department of Computer Science and Engineering, UC San Diego
published: Jan. 25, 2012, recorded: December 2011, views: 4413
published: Jan. 25, 2012, recorded: December 2011, views: 4413
Slides
Related content
Report a problem or upload files
If 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.
Description
This manuscript presents a convergence analysis, generalized from a study of boosting, of unregularized linear prediction. Here the empirical risk — incorporating strictly convex penalties composed with a linear term — may fail to be strongly convex, or even attain a minimizer. This analysis is demonstrated on linear regression, decomposable objectives, and boosting.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: