Optimizing Non-decomposable Performance Measures: A Tale of Two Classes
Harikrishna Narasimhan, Purushottam Kar, Prateek Jain

TL;DR
This paper introduces new stochastic optimization methods for non-decomposable performance measures like F-measure, enabling faster and more accurate training for imbalanced classification tasks.
Contribution
It develops adaptive linearization schemes and two novel algorithms, SPADE and STAMP, with convergence guarantees for optimizing concave and pseudo-linear measures.
Findings
Significant speedups over existing methods, often by an order of magnitude.
Achieves similar or improved accuracy on test data.
Provides convergence guarantees for the proposed algorithms.
Abstract
Modern classification problems frequently present mild to severe label imbalance as well as specific requirements on classification characteristics, and require optimizing performance measures that are non-decomposable over the dataset, such as F-measure. Such measures have spurred much interest and pose specific challenges to learning algorithms since their non-additive nature precludes a direct application of well-studied large scale optimization methods such as stochastic gradient descent. In this paper we reveal that for two large families of performance measures that can be expressed as functions of true positive/negative rates, it is indeed possible to implement point stochastic updates. The families we consider are concave and pseudo-linear functions of TPR, TNR which cover several popularly used performance measures such as F-measure, G-mean and H-mean. Our core contribution…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Advanced Bandit Algorithms Research · Machine Learning and Data Classification
