IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i9p1410-d799938.html
   My bibliography  Save this article

ROC Curves, Loss Functions, and Distorted Probabilities in Binary Classification

Author

Listed:
  • Phuong Bich Le

    (Department of Mathematics, Hanoi University of Mining and Geology, No. 18 Vien Street, Duc Thang Ward, Bac Tu Liem District, Hanoi City 100000, Vietnam
    These authors contributed equally to this work.)

  • Zung Tien Nguyen

    (Institut de Mathématiques de Toulouse, Université Paul Sabatier, 31062 Toulouse, France
    Torus Actions SAS, 31062 Toulouse, France
    These authors contributed equally to this work.)

Abstract

The main purpose of this work is to study how loss functions in machine learning influence the “binary machines”, i.e., probabilistic AI models for predicting binary classification problems. In particular, we show the following results: (i) Different measures of accuracy such as area under the curve (AUC) of the ROC curve, the maximal balanced accuracy, and the maximally weighted accuracy are topologically equivalent, with natural inequalities relating them; (ii) the so-called real probability machines with respect to given information spaces are the optimal machines, i.e., they have the highest precision among all possible machines, and moreover, their ROC curves are automatically convex; (iii) the cross-entropy and the square loss are the most natural loss functions in the sense that the real probability machine is their minimizer; (iv) an arbitrary strictly convex loss function will also have as its minimizer an optimal machine, which is related to the real probability machine by just a reparametrization of sigmoid values; however, if the loss function is not convex, then its minimizer is not an optimal machine, and strange phenomena may happen.

Suggested Citation

  • Phuong Bich Le & Zung Tien Nguyen, 2022. "ROC Curves, Loss Functions, and Distorted Probabilities in Binary Classification," Mathematics, MDPI, vol. 10(9), pages 1-13, April.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:9:p:1410-:d:799938
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/9/1410/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/9/1410/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:9:p:1410-:d:799938. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.