{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:42:15Z","timestamp":1775068935498,"version":"3.50.1"},"reference-count":79,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"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":["2018AAA0102003"],"award-info":[{"award-number":["2018AAA0102003"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61620106009"],"award-info":[{"award-number":["61620106009"]}],"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":["61861166002"],"award-info":[{"award-number":["61861166002"]}],"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":["61836002"],"award-info":[{"award-number":["61836002"]}],"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\/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"}]},{"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"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2022,11,1]]},"DOI":"10.1109\/tpami.2021.3101125","type":"journal-article","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T20:35:03Z","timestamp":1627677303000},"page":"7747-7763","source":"Crossref","is-referenced-by-count":76,"title":["Learning With Multiclass AUC: Theory and Algorithms"],"prefix":"10.1109","volume":"44","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"}]},{"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"}]},{"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, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7141-708X","authenticated-orcid":false,"given":"Xiaochun","family":"Cao","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7542-296X","authenticated-orcid":false,"given":"Qingming","family":"Huang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Big Data Mining and Knowledge Management (BDKM), School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing, China"}]}],"member":"263","reference":[{"issue":"1","key":"ref1","first-page":"1653","article-title":"Surrogate regret bounds for bipartite ranking via strongly proper losses","volume":"15","author":"Agarwal","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref2","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":"ref3","first-page":"49","article-title":"Optimising area under the ROC curve using gradient descent","volume-title":"Proc. 21st Int. Conf. Mach. Learn.","author":"Alan"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053674"},{"key":"ref5","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":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.232"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74976-9_8"},{"key":"ref9","first-page":"1565","article-title":"Learning imbalanced datasets with label-distribution-aware margin loss","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Cao"},{"key":"ref10","first-page":"978","article-title":"Opt: Learn to regularize recommender models in finer levels","volume-title":"Proc. 25th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining","author":"Chen","year":"2019"},{"key":"ref11","first-page":"4600","article-title":"Ranking data with continuous labels through oriented recursive partitions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Cl\u00e9men\u00e7on"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/009052607000000910"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-012-5325-4"},{"key":"ref14","first-page":"2514","article-title":"Structured prediction theory based on factor graph complexity","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Cortes"},{"key":"ref15","first-page":"313","article-title":"AUC optimization vs. error rate minimization","volume-title":"Proc. 16th Int. Conf. Adv. Neural Inf. Process. Syst.","author":"Cortes"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00949"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403120"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3024987"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3186905"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.10.010"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39857-8_12"},{"key":"ref22","first-page":"933","article-title":"An efficient boosting algorithm for combining preferences","volume":"4","author":"Freund","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.03.003"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2017.1322688"},{"key":"ref25","first-page":"939","article-title":"On the consistency of AUC pairwise optimization","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Gao"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkg602"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaz007"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013697"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/11538059_91"},{"issue":"2","key":"ref30","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":"ref31","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59722-1_69"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICSCCW.2009.5379453"},{"key":"ref34","article-title":"A practical guide to support vector classification","author":"Hsu","year":"2003","journal-title":"Citeseer"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150429"},{"key":"ref37","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref38","article-title":"Position paper: Extensions of ROC analysis to multi-class domains","volume-title":"Proc. ICML Workshop Cost-sensitive Learn.","author":"Lane"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20212-4"},{"issue":"1","key":"ref40","first-page":"559","article-title":"Imbalanced-learn: A python toolbox to tackle the curse of imbalanced datasets in machine learning","volume":"18","author":"Lema\u00eetre","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref41","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.324"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403354"},{"key":"ref44","article-title":"Stochastic AUC maximization with deep neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Liu"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2019.2913536"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014368"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00684"},{"key":"ref48","article-title":"Generalization bounds for deep convolutional neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Long"},{"key":"ref49","article-title":"kNN approach to unbalanced data distributions: A case study involving information extraction","volume-title":"Proc. ICML Workshop Learn. Imbalanced Datasets","author":"Mani"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46379-7_1"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-662-12788-9_6","article-title":"Concentration","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"McDiarmid","year":"1998"},{"key":"ref52","volume-title":"Foundations of Machine Learning","author":"Mohri","year":"2018"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1177\/0272989X9901900110"},{"key":"ref54","first-page":"516","article-title":"A structural SVM based approach for optimizing partial AUC","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Narasimhan"},{"key":"ref55","first-page":"516","article-title":"A structural SVM based approach for optimizing partial AUC","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Narasimhan"},{"key":"ref56","first-page":"167","article-title":"Svmpauctight: A new support vector method for optimizing partial AUC based on a tight convex upper bound","volume-title":"Proc. Int. Conf. Knowl. Discov. Data Mining","author":"Narasimhan"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00972"},{"key":"ref58","first-page":"3707","article-title":"Stochastic proximal algorithms for AUC maximization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Natole"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2019.00030"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331268"},{"issue":"3","key":"ref61","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1024099825458","article-title":"Tree induction for probability-based ranking","volume":"52","author":"Provost","year":"2003","journal-title":"Mach. Learn."},{"key":"ref62","first-page":"18","article-title":"Generalization bounds for k-partite ranking","volume-title":"Proc. NIPS Workshop Learn. Rank","author":"Rajaram"},{"key":"ref63","first-page":"1927","article-title":"Chromatic PAC-Bayes bounds for non-IID data: Applications to ranking and stationary $\\beta$\u03b2-mixing processes","volume":"11","author":"Ralaivola","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref64","article-title":"Optimistic bounds for multi-output prediction","author":"Reeve","year":"2020"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6029"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5422-z"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1976.4309452"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2360397"},{"key":"ref69","article-title":"A data-dependent generalisation error bound for the AUC","volume-title":"Proc. ICML Workshop ROC Anal. Mach. Learn.","author":"Usunier"},{"key":"ref70","first-page":"1369","article-title":"Generalization error bounds for classifiers trained with interdependent data","volume-title":"Proc. 18th Int. Conf. Adv. Neural Inf. Process. Syst.","author":"Usunier"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN48605.2020.9207377"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5358"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/CCCM.2009.5267469"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.3934\/cpaa.2020188"},{"key":"ref75","first-page":"451","article-title":"Stochastic online AUC maximization","volume-title":"Proc. 30th Int. Conf. Adv. Neural Inf. Process. Syst.","author":"Ying"},{"issue":"1","key":"ref76","first-page":"3623","article-title":"Smoothing multivariate performance measures","volume":"13","author":"Zhang","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref77","first-page":"233","article-title":"Online AUC maximization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhao"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI45749.2020.9098374"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01138"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/9910240\/09502525.pdf?arnumber=9502525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T22:20:33Z","timestamp":1705011633000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9502525\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":79,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2021.3101125","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":[[2022,11,1]]}}}