{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:07:22Z","timestamp":1770739642542,"version":"3.49.0"},"reference-count":88,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62525212"],"award-info":[{"award-number":["62525212"]}],"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":["62236008"],"award-info":[{"award-number":["62236008"]}],"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":["62441232"],"award-info":[{"award-number":["62441232"]}],"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":["62521007"],"award-info":[{"award-number":["62521007"]}],"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":["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":["U23B2051"],"award-info":[{"award-number":["U23B2051"]}],"id":[{"id":"10.13039\/501100001809","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 the Chinese Academy of Sciences","award":["XDB0680201"],"award-info":[{"award-number":["XDB0680201"]}]},{"name":"China National Postdoctoral Program for Innovative Talents","award":["BX20250377"],"award-info":[{"award-number":["BX20250377"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1109\/tpami.2025.3640236","type":"journal-article","created":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T18:37:06Z","timestamp":1764873426000},"page":"3604-3621","source":"Crossref","is-referenced-by-count":0,"title":["Cost-Aware AUC Optimization via Adaptive Kernel Density Estimation"],"prefix":"10.1109","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8881-3609","authenticated-orcid":false,"given":"Peisong","family":"Wen","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":"State Key Laboratory of AI Safety, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"given":"Zhiyong","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing, China"}]},{"given":"Huiyang","family":"Shao","sequence":"additional","affiliation":[{"name":"Bytedance, Beijing, China"}]},{"given":"Linchao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Institute, China Electronics Technology Group Corporation, Beijing, China"}]},{"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"}]}],"member":"263","reference":[{"key":"ref1","first-page":"242","article-title":"A convergence theory for deep learning via over-parameterization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Allen-Zhu","year":"2019"},{"key":"ref2","first-page":"3372","article-title":"Efficient Bayes risk estimation for cost-sensitive classification","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Andrade","year":"2019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053674"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TASLP.2020.2990275"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-021-09513-z"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.1.37"},{"key":"ref7","first-page":"1507","article-title":"Classification with rejection based on cost-sensitive classification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Charoenphakdee","year":"2021"},{"key":"ref8","first-page":"1","article-title":"Tighter analysis of alternating stochastic gradient method for stochastic nested problems","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen","year":"2021"},{"key":"ref9","first-page":"1","article-title":"On the convergence of a class of ADAM-type algorithms for non-convex optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chen","year":"2018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3266648"},{"issue":"4","key":"ref11","first-page":"12","article-title":"Machine learning based approach to financial fraud detection process in mobile payment system","volume":"5","author":"Choi","year":"2017","journal-title":"IT Converg Pract"},{"key":"ref12","article-title":"Mediaeval 2018: Predicting media memorability task","author":"Cohendet","year":"2018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0176-2"},{"key":"ref14","first-page":"313","article-title":"AUC optimization vs. error rate minimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Cortes","year":"2003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00949"},{"key":"ref16","first-page":"44658","article-title":"DrAUC: An instance-wise distributionally robust AUC optimization framework","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Dai","year":"2023"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/0233193031000149894"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4"},{"key":"ref19","first-page":"1568","article-title":"Bilevel programming for hyperparameter optimization and meta-learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Franceschi","year":"2018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25926"},{"key":"ref21","article-title":"Approximation methods for bilevel programming","author":"Ghadimi","year":"2018"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1113.003.0010"},{"key":"ref23","article-title":"Jane street market prediction","author":"Group","year":"2021"},{"key":"ref24","first-page":"3864","article-title":"Communication-efficient distributed stochastic AUC maximization with deep neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Guo","year":"2020"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5119-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.148.3.6878708"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59722-1_69"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5328-9"},{"key":"ref31","first-page":"2813","article-title":"A unified view of performance metrics: Translating threshold choice into expected classification loss","volume":"13","author":"Hern\u00e1ndez-Orallo","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/20m1387341"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00024"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512178"},{"key":"ref35","first-page":"4882","article-title":"Bilevel optimization: Convergence analysis and enhanced design","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ji","year":"2021"},{"key":"ref36","first-page":"4784","article-title":"Optimizing black-box metrics with adaptive surrogates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jiang","year":"2020"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"ref38","first-page":"1","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Johnson","year":"2013"},{"key":"ref39","first-page":"694","article-title":"Online and stochastic gradient methods for non-decomposable loss functions","volume":"27","author":"Kar","year":"2014","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref40","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1177\/0143831X03024001598"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20212-4"},{"issue":"61","key":"ref43","first-page":"1","article-title":"Stochastic proximal AUC maximization","volume":"22","author":"Lei","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9876.2010.00713.x"},{"issue":"22","key":"ref45","first-page":"1","article-title":"Lower bounds and accelerated algorithms for bilevel optimization","volume":"24","author":"Liang","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref46","first-page":"519","article-title":"AUC: A statistically consistent and more discriminating measure than accuracy","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","volume":"3","author":"Ling","year":"2003"},{"key":"ref47","first-page":"13669","article-title":"Benefits of overparameterized convolutional residual networks: Function approximation under smoothness constraint","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu","year":"2022"},{"key":"ref48","first-page":"1","article-title":"Stochastic AUC maximization with deep neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu","year":"2020"},{"key":"ref49","first-page":"3189","article-title":"Fast stochastic AUC maximization with $ o (1\/n)$o(1\/n)-convergence rate","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu","year":"2018"},{"key":"ref50","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","year":"2020"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3664647.3681110"},{"issue":"2","key":"ref52","first-page":"246","article-title":"Random optimization. automation and remote control","volume":"26","author":"Matyas","year":"1965","journal-title":"Inf. Sci."},{"key":"ref53","first-page":"7733","article-title":"Estimating weighted areas under the ROC curve","volume":"33","author":"Maurer","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1177\/0272989x8900900307"},{"key":"ref55","volume-title":"Foundations of Machine Learning","author":"Mohri","year":"2018"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00972"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.135"},{"key":"ref59","doi-asserted-by":"crossref","DOI":"10.1007\/b97412","volume-title":"Introduction to Optimization","volume":"46","author":"Pedregal","year":"2004"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/1.2.123"},{"key":"ref61","first-page":"1752","article-title":"Stochastic optimization of areas under precision-recall curves with provable convergence","volume":"34","author":"Qi","year":"2021","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref62","first-page":"71","article-title":"Optimizing area under ROC curve with SVMs","volume-title":"Proc. ROC Anal. Artif. Intell., 1st Int. Workshop","author":"Rakotomamonjy","year":"2004"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00764"},{"key":"ref64","volume-title":"Filter Theory and Design: Active and Passive","author":"Sedra","year":"1978"},{"key":"ref65","first-page":"38667","article-title":"Asymptotically unbiased instance-wise regularized partial AUC optimization: Theory and algorithm","volume-title":"Proc. 36th Int. Conf. Neural Inf. Process. Syst.","author":"Shao","year":"2022"},{"key":"ref66","first-page":"17357","article-title":"Weighted ROC curve in cost space: Extending AUC to cost-sensitive learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Shao","year":"2024"},{"key":"ref67","article-title":"Embedded encoder-decoder in convolutional networks towards explainable AI","author":"Tavanaei","year":"2020"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096458"},{"key":"ref69","first-page":"1","article-title":"Differentiation of blackbox combinatorial solvers","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Vlastelica","year":"2019"},{"key":"ref70","first-page":"23292","article-title":"Finite-sum coupled compositional stochastic optimization: Theory and applications","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang","year":"2022"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1017-3"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3199970"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-024-02157-w"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2025.3609758"},{"key":"ref75","first-page":"28335","article-title":"Exploring the algorithm-dependent generalization of AUPRC optimization with list stability","volume":"35","author":"Wen","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3361861"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/76.3.585"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/s00362-010-0338-1"},{"key":"ref79","first-page":"848","article-title":"Optimizing classifier performance via an approximation to the Wilcoxon-MANN-Whitney statistic","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yan","year":"2003"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/410"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/3554729"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.3934\/cpaa.2020188"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3101125"},{"key":"ref84","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","year":"2021"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3303943"},{"key":"ref86","first-page":"451","article-title":"Stochastic online AUC maximization","volume":"29","author":"Ying","year":"2016","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref87","first-page":"1","article-title":"Compositional training for end-to-end deep AUC maximization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Yuan","year":"2021"},{"key":"ref88","first-page":"2055","article-title":"An improved analysis of training over-parameterized deep neural networks","volume":"32","author":"Zou","year":"2019","journal-title":"Adv. Neural Inf. Process. Syst."}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/11372200\/11277400.pdf?arnumber=11277400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T21:05:20Z","timestamp":1770671120000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11277400\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":88,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2025.3640236","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":[[2026,3]]}}}