Fixed-point and coordinate descent algorithms for regularized kernel methods

Details Fixed-point and coordinate descent algorithms for regularized kernel methods Fixed-point and coordinate descent algorithms for regularized kernel methods

2010-08-30

arxiv.org/abs/1008.5090v1

Computer Science

Learning

Scientific paper

In this paper, we study two general classes of optimization algorithms for kernel methods with convex loss function and quadratic norm regularization, and analyze their convergence. The first approach, based on fixed-point iterations, is simple to implement and analyze, and can be easily parallelized. The second, based on coordinate descent, exploits the structure of additively separable loss functions to compute solutions of line searches in closed form. Instances of these general classes of algorithms are already incorporated into state of the art machine learning software for large scale problems. We start from a solution characterization of the regularized problem, obtained using sub-differential calculus and resolvents of monotone operators, that holds for general convex loss functions regardless of differentiability. The two methodologies described in the paper can be regarded as instances of non-linear Jacobi and Gauss-Seidel algorithms, and are both well-suited to solve large scale problems.

Affiliated with

Also associated with

No associations

Rating

Fixed-point and coordinate descent algorithms for regularized kernel methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fixed-point and coordinate descent algorithms for regularized kernel methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed-point and coordinate descent algorithms for regularized kernel methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-400938