Smoothing Multivariate Performance Measures

Details Smoothing Multivariate Performance Measures Smoothing Multivariate Performance Measures

2012-02-14

arxiv.org/abs/1202.3776v1

Computer Science

Learning

Scientific paper

A Support Vector Method for multivariate performance measures was recently introduced by Joachims (2005). The underlying optimization problem is currently solved using cutting plane methods such as SVM-Perf and BMRM. One can show that these algorithms converge to an eta accurate solution in O(1/Lambda*e) iterations, where lambda is the trade-off parameter between the regularizer and the loss function. We present a smoothing strategy for multivariate performance scores, in particular precision/recall break-even point and ROCArea. When combined with Nesterov's accelerated gradient algorithm our smoothing strategy yields an optimization algorithm which converges to an eta accurate solution in O(min{1/e,1/sqrt(lambda*e)}) iterations. Furthermore, the cost per iteration of our scheme is the same as that of SVM-Perf and BMRM. Empirical evaluation on a number of publicly available datasets shows that our method converges significantly faster than cutting plane methods without sacrificing generalization ability.

Affiliated with

Also associated with

No associations

Rating

Smoothing Multivariate Performance Measures 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 Smoothing Multivariate Performance Measures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Smoothing Multivariate Performance Measures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90771