A Combinatorial Algorithm to Compute Regularization Paths

Details A Combinatorial Algorithm to Compute Regularization Paths A Combinatorial Algorithm to Compute Regularization Paths

2009-03-27

arxiv.org/abs/0903.4856v1

Computer Science

Learning

7 Pages, 1 Figure

Scientific paper

For a wide variety of regularization methods, algorithms computing the entire solution path have been developed recently. Solution path algorithms do not only compute the solution for one particular value of the regularization parameter but the entire path of solutions, making the selection of an optimal parameter much easier. Most of the currently used algorithms are not robust in the sense that they cannot deal with general or degenerate input. Here we present a new robust, generic method for parametric quadratic programming. Our algorithm directly applies to nearly all machine learning applications, where so far every application required its own different algorithm. We illustrate the usefulness of our method by applying it to a very low rank problem which could not be solved by existing path tracking methods, namely to compute part-worth values in choice based conjoint analysis, a popular technique from market research to estimate consumers preferences on a class of parameterized options.

Affiliated with

Also associated with

No associations

Rating

A Combinatorial Algorithm to Compute Regularization Paths 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 A Combinatorial Algorithm to Compute Regularization Paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Combinatorial Algorithm to Compute Regularization Paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-21852