|
|
|
|
| LEADER |
01000caa a22002652c 4500 |
| 001 |
NLM342529366 |
| 003 |
DE-627 |
| 005 |
20250303120618.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231226s2023 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2022.3185311
|2 doi
|
| 028 |
5 |
2 |
|a pubmed25n1141.xml
|
| 035 |
|
|
|a (DE-627)NLM342529366
|
| 035 |
|
|
|a (NLM)35731775
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Yang, Zhiyong
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Optimizing Two-Way Partial AUC With an End-to-End Framework
|
| 264 |
|
1 |
|c 2023
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 03.07.2023
|
| 500 |
|
|
|a Date Revised 03.07.2023
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a The Area Under the ROC Curve (AUC) is a crucial metric for machine learning, which evaluates the average performance over all possible True Positive Rates (TPRs) and False Positive Rates (FPRs). Based on the knowledge that a skillful classifier should simultaneously embrace a high TPR and a low FPR, we turn to study a more general variant called Two-way Partial AUC (TPAUC), where only the region with TPR ≥ α, FPR ≤ β is included in the area. Moreover, a recent work shows that the TPAUC is essentially inconsistent with the existing Partial AUC metrics where only the FPR range is restricted, opening a new problem to seek solutions to leverage high TPAUC. Motivated by this, we present the first trial in this article to optimize this new metric. The critical challenge along this course lies in the difficulty of performing gradient-based optimization with end-to-end stochastic training, even with a proper choice of surrogate loss. To address this issue, we propose a generic framework to construct surrogate optimization problems, which supports efficient end-to-end training with deep learning. Moreover, our theoretical analyses show that: 1) the objective function of the surrogate problems will achieve an upper bound of the original problem under mild conditions, and 2) optimizing the surrogate problems leads to good generalization performance in terms of TPAUC with a high probability. Finally, empirical studies over several benchmark datasets speak to the efficacy of our framework
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Xu, Qianqian
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Bao, Shilong
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a He, Yuan
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Cao, Xiaochun
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Huang, Qingming
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 45(2023), 8 vom: 22. Aug., Seite 10228-10246
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnas
|
| 773 |
1 |
8 |
|g volume:45
|g year:2023
|g number:8
|g day:22
|g month:08
|g pages:10228-10246
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2022.3185311
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 45
|j 2023
|e 8
|b 22
|c 08
|h 10228-10246
|