{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T06:55:29Z","timestamp":1793084129403,"version":"4.5.0"},"reference-count":80,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["2018AAA0102000"],"award-info":[{"award-number":["2018AAA0102000"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21B2038"],"award-info":[{"award-number":["U21B2038"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1936208"],"award-info":[{"award-number":["U1936208"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61931008"],"award-info":[{"award-number":["61931008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62025604"],"award-info":[{"award-number":["62025604"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["6212200758"],"award-info":[{"award-number":["6212200758"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976202"],"award-info":[{"award-number":["61976202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004739","name":"Youth Innovation Promotion Association of the Chinese Academy of Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004739","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Strategic Priority Research Program of Chinese Academy of Sciences","award":["XDB28000000"],"award-info":[{"award-number":["XDB28000000"]}]},{"DOI":"10.13039\/501100012152","name":"National Postdoctoral Program for Innovative Talents","doi-asserted-by":"publisher","award":["BX2021298"],"award-info":[{"award-number":["BX2021298"]}],"id":[{"id":"10.13039\/501100012152","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1109\/tpami.2022.3185311","type":"journal-article","created":{"date-parts":[[2022,6,22]],"date-time":"2022-06-22T19:50:41Z","timestamp":1655927441000},"page":"10228-10246","source":"Crossref","is-referenced-by-count":19,"title":["Optimizing Two-Way Partial AUC With an End-to-End Framework"],"prefix":"10.1109","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4409-4999","authenticated-orcid":false,"given":"Zhiyong","family":"Yang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3512-7277","authenticated-orcid":false,"given":"Qianqian","family":"Xu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4336-8900","authenticated-orcid":false,"given":"Shilong","family":"Bao","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Information Security (SKLOIS), Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6885-1341","authenticated-orcid":false,"given":"Yuan","family":"He","sequence":"additional","affiliation":[{"name":"Security Department, Alibaba Group, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7141-708X","authenticated-orcid":false,"given":"Xiaochun","family":"Cao","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Sun Yat-sen University, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7542-296X","authenticated-orcid":false,"given":"Qingming","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"393","article-title":"Generalization bounds for the area under the ROC curve","volume":"6","author":"Agarwal","year":"2005","journal-title":"J. Mach. Learn. Res."},{"key":"ref2","first-page":"49","article-title":"Optimising area under the ROC curve using gradient descent","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Alan"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15726-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053674"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TASLP.2020.2990275"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000282"},{"key":"ref7","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"Bartlett","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492921000027"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1999.786963"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(96)00142-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74976-9_8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/009052607000000910"},{"key":"ref14","first-page":"2671","article-title":"Ranking the best instances","volume":"8","author":"Cl\u00e9men\u00e7on","year":"2007","journal-title":"J. Mach. Learn. Res."},{"key":"ref15","first-page":"313","article-title":"AUC optimization versus error rate minimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Cortes"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-01-00923-5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00949"},{"key":"ref18","first-page":"832","article-title":"Scalable learning of non-decomposable objectives","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist.","author":"Eban"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.10.010"},{"key":"ref20","first-page":"933","article-title":"An efficient boo sting algorithm for combining preferences","volume":"4","author":"Freund","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.03.003"},{"issue":"2","key":"ref22","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1010920819831","article-title":"A simple generalisation of the area under the ROC curve for multiple class classification problems","volume":"45","author":"Hand","year":"2001","journal-title":"Mach. Learn."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59722-1_69"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5846"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150429"},{"key":"ref29","article-title":"Online and stochastic gradient methods for non-decomposable loss functions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kar"},{"key":"ref30","article-title":"Implicit rate-constrained optimization of non-decomposable objectives","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Kumar"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20212-4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.08.074"},{"key":"ref33","first-page":"1502","article-title":"Top rank optimization in linear time","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref34","first-page":"6083","article-title":"On gradient descent ascent for nonconvex-concave minimax problems","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lin"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.324"},{"key":"ref36","first-page":"519","article-title":"AUC: A statistically consistent and more discriminating measure than accuracy","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Ling"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403354"},{"key":"ref38","article-title":"Stochastic AUC maximization with deep neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Liu"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/101"},{"key":"ref40","first-page":"6305","article-title":"A generic first-order algorithmic framework for bi-level programming beyond lower-level singleton","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00684"},{"key":"ref42","article-title":"Generalization bounds for deep convolutional neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Long"},{"key":"ref43","article-title":"Predicting accurate probabilities with a ranking loss","volume-title":"Proc. Proc. Int. Conf. Mach. Learn.","author":"Menon"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2496(80)90020-6"},{"key":"ref45","volume-title":"Foundations of Machine Learning","author":"Mohri","year":"2018"},{"key":"ref46","first-page":"1409","article-title":"Prodding the ROC curve: Constrained optimization of classifier performance","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Mozer"},{"key":"ref47","first-page":"1646","article-title":"Learning with complex loss functions and constraints","volume-title":"Proc. 21st Int. Conf. Artif. Intell. Statist.","author":"Narasimhan"},{"key":"ref48","first-page":"516","article-title":"A structural SVM based approach for optimizing partial AUC","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Narasimhan"},{"key":"ref49","first-page":"167","article-title":"SVMpAUC-tight: A new support vector method for optimizing partial AUC based on a tight convex upper bound","volume-title":"Proc. ACM SIGKDD Conf. Knowl. Discov. Data Mining","author":"Narasimhan"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00972"},{"key":"ref51","first-page":"10747","article-title":"Optimizing generalized rate metrics with three players","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Narasimhan"},{"key":"ref52","first-page":"3707","article-title":"Stochastic proximal algorithms for auc maximization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Natole"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2019.00030"},{"key":"ref54","first-page":"8024","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume-title":"Proc. 33rd Int. Conf. Neural Inf. Process. Syst.","author":"Paszke"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057460"},{"key":"ref56","first-page":"2436","article-title":"Entropy-based concentration inequalities for dependent variables","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ralaivola"},{"key":"ref57","first-page":"1927","article-title":"Chromatic PAC-bayes bounds for non-IID data: Applications to ranking and stationary -mixing processes","volume":"11","author":"Ralaivola","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref58","first-page":"841","article-title":"Learning structured models with the AUC loss and its generalizations","volume-title":"Proc. 17th Int. Conf. Artif. Intell. Statist.","author":"Rosenfeld"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835928"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1037\/h0035203"},{"key":"ref61","first-page":"1139","article-title":"On the importance of initialization and momentum in deep learning","volume-title":"Proc. Proc. Int. Conf. Mach. Learn.","author":"Sutskever"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2360397"},{"key":"ref63","article-title":"A data-dependent generalisation error bound for the AUC","volume-title":"Proc. ICML Workshop ROC Anal. Mach. Learn.","author":"Usunier"},{"key":"ref64","first-page":"1369","article-title":"Generalization error bounds for classifiers trained with interdependent data","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Usunier"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2440-0"},{"key":"ref67","article-title":"Learning fair scoring functions: Bipartite ranking under ROC-based fairness constraints","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Vogel"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.11.006"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00070"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/42.585767"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5358"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976236.1"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1177\/0962280217718866"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3101125"},{"key":"ref75","first-page":"11820","article-title":"When all we need is a piece of the pie: A generic framework for optimizing two-way partial AUC","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref76","first-page":"451","article-title":"Stochastic online AUC maximization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref77","first-page":"12219","article-title":"Federated deep AUC maximization for hetergeneous data with a constant communication complexity","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yuan"},{"issue":"1","key":"ref78","first-page":"3623","article-title":"Smoothing multivariate performance measures","volume":"13","author":"Zhang","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref79","first-page":"233","article-title":"Online AUC maximization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhao"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI45749.2020.9098374"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/10169863\/09804230.pdf?arnumber=9804230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T04:32:29Z","timestamp":1706761949000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9804230\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":80,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2022.3185311","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8]]}}}