Maximization of AUC and Buffered AUC in binary classification
MetadataShow full item record
In binary classification, performance metrics that are defined as the probability that some error exceeds a threshold are numerically difficult to optimize directly and also hide potentially important information about the magnitude of errors larger than the threshold. Defining similar metrics, instead, using Buffered Probability of Exceedance (bPOE) generates counterpart metrics that resolve both of these issues. We apply this approach to the case of AUC, the Area Under the ROC curve, and define Buffered AUC (bAUC). We show that bAUC can provide insights into classifier performance not revealed by AUC, while being closely related as the tightest concave lower bound and representable as the area under a modified ROC curve. Additionally, while AUC is numerically difficult to optimize directly, we show that bAUC optimization often reduces to convex or linear programming. Extending these results, we show that AUC and bAUC are special cases of Generalized bAUC and that popular Support Vector Machine (SVM) formulations for approximately maximizing AUC are equivalent to direct maximization of Generalized bAUC. We also prove bAUC generalization bounds for these SVM’s. As a central component to these results, we provide an important, novel formula for calculating bPOE, the inverse of Conditional Value-at-Risk. Using this formula, we show that particular bPOE minimization problems reduce to convex and linear programming.
The article of record as published may be found at http://dx.doi.org/10.1007/s10107-018-1312-2
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
A convex programming based guidance algorithm to capture a tumbling object on orbit using a spacecraft equipped with a robotic manipulator Virgili-Llop, Josep; Costantinos Zagaris; Zappulla, Richard II; Bradstreet, Andrew; Romano, Marcello (2018);An algorithm to guide the capture of a tumbling resident space object by a spacecraft equipped with a robotic manipulator is presented. A solution to the guidance problem is found by solving a collection of convex programming ...
Virgili-Llop, Josep; Costantinos Zagaris; Zappulla, Richard II; Bradstreet, Andrew; Romano, Marcello (2017-02);This paper presents a convex optimization-based guidance algorithm for maneuvering a spacecraft equipped with a robotic manipulator. A local solution to the original optimization problem is found by solving a collection ...
A recursively feasible and convergent Sequential Convex Programming procedure to solve non-convex problems with linear equality constraints Virgili-Llop, Josep; Romano, Marcello (ArXiv, 2018-10);A computationally efficient method to solve non-convex programming problems with linear equality constraints is presented. The proposed method is based on a recursively feasible and descending sequential convex programming ...