dorsal/arxiv
View SchemaBuffered AUC maximization for scoring systems via mixed-integer optimization
| Authors | Moe Shiina, Shunnosuke Ikeda, Yuichi Takano |
|---|---|
| Categories | |
| ArXiv ID | 2601.05544vv2 |
| URL | https://arxiv.org/abs/2601.05544 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
A scoring system is a linear classifier composed of a small number of explanatory variables, each assigned a small integer coefficient. This system is highly interpretable and allows predictions to be made with simple manual calculations without the need for a calculator. Several previous studies have used mixed-integer optimization (MIO) techniques to develop scoring systems for binary classification; however, they have not focused on directly maximizing AUC (i.e., area under the receiver operating characteristic curve), even though AUC is recognized as an essential evaluation metric for scoring systems. Our goal herein is to establish an effective MIO framework for constructing scoring systems that directly maximize the buffered AUC (bAUC) as the tightest concave lower bound on AUC. Our optimization model is formulated as a mixed-integer linear optimization (MILO) problem that maximizes bAUC subject to a group sparsity constraint for limiting the number of questions in the scoring system. Computational experiments using publicly available real-world datasets demonstrate that our MILO method can build scoring systems with superior AUC values compared to the baseline methods based on regularization and stepwise regression. This research contributes to the advancement of MIO techniques for developing highly interpretable classification models.
{
"annotation_id": "cb491608-5348-48c8-a2d1-e603b8db3c45",
"date_created": "2026-02-17T05:53:04.785000Z",
"date_modified": "2026-02-17T05:53:04.785000Z",
"file_hash": "59a76157df11736576ea2638e70030ff07f557fab593f9d640d013ec78517b5f",
"private": false,
"record": {
"abstract": "A scoring system is a linear classifier composed of a small number of explanatory variables, each assigned a small integer coefficient. This system is highly interpretable and allows predictions to be made with simple manual calculations without the need for a calculator. Several previous studies have used mixed-integer optimization (MIO) techniques to develop scoring systems for binary classification; however, they have not focused on directly maximizing AUC (i.e., area under the receiver operating characteristic curve), even though AUC is recognized as an essential evaluation metric for scoring systems. Our goal herein is to establish an effective MIO framework for constructing scoring systems that directly maximize the buffered AUC (bAUC) as the tightest concave lower bound on AUC. Our optimization model is formulated as a mixed-integer linear optimization (MILO) problem that maximizes bAUC subject to a group sparsity constraint for limiting the number of questions in the scoring system. Computational experiments using publicly available real-world datasets demonstrate that our MILO method can build scoring systems with superior AUC values compared to the baseline methods based on regularization and stepwise regression. This research contributes to the advancement of MIO techniques for developing highly interpretable classification models.",
"arxiv_id": "2601.05544",
"authors": [
"Moe Shiina",
"Shunnosuke Ikeda",
"Yuichi Takano"
],
"categories": [
"cs.LG",
"math.OC",
"stat.AP"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Buffered AUC maximization for scoring systems via mixed-integer optimization",
"url": "https://arxiv.org/abs/2601.05544",
"version": "v2"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "5014dc67-6747-42b8-88ad-dc53164ce6bd",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}