Smoothing Multivariate Performance Measures

Abstract

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.

References in corpus (1)

• Regularized Risk Minimization by Nesterov's Accelerated Gradient Methods: Algorithmic Extensions and Empirical Studies

Cited by in corpus (13)

• A Feature Selection Method for Multivariate Performance Measures
• Optimizing Two-way Partial AUC with an End-to-end Framework
• Optimizing Partial Area Under the Top-k Curve: Theory and Practice
• A novel multivariate performance optimization method based on sparse coding and hyper-predictor learning
• Stochastic Proximal AUC Maximization
• Stability and Optimization Error of Stochastic Gradient Descent for Pairwise Learning
• Deep AUC Maximization for Medical Image Classification: Challenges and Opportunities
• Learning with Multiclass AUC: Theory and Algorithms
• Stochastic Hard Thresholding Algorithms for AUC Maximization
• Variance Reduced Stochastic Proximal Algorithm for AUC Maximization
• Sparse learning of maximum likelihood model for optimization of complex loss function
• Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than $O(1/\epsilon )$
• Online AUC Optimization for Sparse High-Dimensional Datasets