A General Online Algorithm for Optimizing Complex Performance Metrics

Thumbnail Image

Access rights

openAccess

URL

Journal Title

Journal ISSN

Volume Title

A4 Artikkeli konferenssijulkaisussa

Date

2024

Major/Subject

Mcode

Degree programme

Language

en

Pages

30

Series

Proceedings of Machine Learning Research, Volume 235, pp. 25396-25425

Abstract

We consider sequential maximization of performance metrics that are general functions of a confusion matrix of a classifier (such as precision, F-measure, or G-mean). Such metrics are, in general, non-decomposable over individual instances, making their optimization very challenging. While they have been extensively studied under different frameworks in the batch setting, their analysis in the online learning regime is very limited, with only a few distinguished exceptions. In this paper, we introduce and analyze a general online algorithm that can be used in a straightforward way with a variety of complex performance metrics in binary, multi-class, and multi-label classification problems. The algorithm's update and prediction rules are appealingly simple and computationally efficient without the need to store any past data. We show the algorithm attains O(lnnn ) regret for concave and smooth metrics and verify the efficiency of the proposed algorithm in empirical studies.

Description

Publisher Copyright: Copyright 2024 by the author(s)

Keywords

Other note

Citation

Kotłowski, W, Wydmuch, M, Schultheis, E, Babbar, R & Dembczyński, K 2024, ' A General Online Algorithm for Optimizing Complex Performance Metrics ', Proceedings of Machine Learning Research, vol. 235, pp. 25396-25425 . < https://proceedings.mlr.press/v235/kotlowski24a.html >