{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:48:14Z","timestamp":1779889694127,"version":"3.53.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2017YFE0104100"],"award-info":[{"award-number":["2017YFE0104100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2016YFE0200400"],"award-info":[{"award-number":["2016YFE0200400"]}],"id":[{"id":"10.13039\/501100012166","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":[[2022,3,1]]},"DOI":"10.1109\/tpami.2020.3024987","type":"journal-article","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T20:37:13Z","timestamp":1600461433000},"page":"1385-1398","source":"Crossref","is-referenced-by-count":18,"title":["Large-Scale Nonlinear AUC Maximization via Triply Stochastic Gradients"],"prefix":"10.1109","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4241-4116","authenticated-orcid":false,"given":"Zhiyuan","family":"Dang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7165-3143","authenticated-orcid":false,"given":"Bin","family":"Gu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2620-3247","authenticated-orcid":false,"given":"Cheng","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3483-8333","authenticated-orcid":false,"given":"Heng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"441","article-title":"XVI. functions of positive and negative type, and their connection the theory of integral equations","volume":"209","author":"mercer","year":"1909","journal-title":"Philos Trans Roy Soc London A"},{"key":"ref38","first-page":"939","article-title":"On the consistency of AUC pairwise optimization","author":"gao","year":"2015","journal-title":"Proc 24th Int Conf Artif Intell"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00571"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989510"},{"key":"ref31","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref30","first-page":"2568","article-title":"An adaptive gradient method for online AUC maximization","author":"ding","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref37","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":"ref36","first-page":"3041","article-title":"Scalable kernel methods via doubly stochastic gradients","author":"dai","year":"2014","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.08.041"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/009052607000000910"},{"key":"ref10","first-page":"225","article-title":"Online classification on a budget","author":"crammer","year":"2004","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref40","first-page":"13","article-title":"Generalization bounds for online learning algorithms with pairwise loss functions","author":"wang","year":"2012","journal-title":"Proc Conf Learn Theory"},{"key":"ref11","first-page":"2643","article-title":"Bounded kernel-based online learning","volume":"10","author":"orabona","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2610465"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.93"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.33"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/4629534"},{"key":"ref16","first-page":"2153","article-title":"On the nyström method for approximating a gram matrix for improved kernel-based learning","volume":"6","author":"drineas","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref17","first-page":"1177","article-title":"Random features for large-scale kernel machines","author":"rahimi","year":"2008","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.830991"},{"key":"ref19","first-page":"911","article-title":"Sparse greedy matrix approximation for machine learning","author":"smola","year":"2000"},{"key":"ref28","first-page":"1","article-title":"Scalable kernel ordinal regression via doubly stochastic gradients","author":"gu","year":"2020","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.18"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6029"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"ref6","first-page":"2666","article-title":"Kernelized online imbalanced learning with fixed budgets","author":"hu","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref29","article-title":"Solving large-scale support vector ordinal regression with asynchronous parallel coordinate descent algorithms","author":"gu","year":"2020","journal-title":"Pattern Recognit"},{"key":"ref5","article-title":"AUC maximizing support vector learning","author":"brefeld","year":"2005","journal-title":"Proc ICML Workshop ROC Anal Mach Learn"},{"key":"ref8","first-page":"142","article-title":"Online Bayesian multiple kernel bipartite ranking","author":"du","year":"2016","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49586-6_3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2969527"},{"key":"ref9","first-page":"906","article-title":"One-pass AUC optimization","author":"gao","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref1","first-page":"233","article-title":"Online AUC maximization","author":"zhao","year":"2011","journal-title":"Proc 28th Int Conf Int Conf Mach Learn"},{"key":"ref20","first-page":"682","article-title":"Using the nyström method to speed up kernel machines","author":"williams","year":"2001","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref45","article-title":"On the convergence of adaptive gradient methods for nonconvex optimization","volume":"abs 1808 5671","author":"zhou","year":"2018","journal-title":"CoRR"},{"key":"ref22","first-page":"1313","article-title":"Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning","author":"rahimi","year":"2009","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref21","first-page":"243","article-title":"Efficient SVM training using low-rank kernel representations","volume":"2","author":"fine","year":"2001","journal-title":"J Mach Learn Res"},{"key":"ref42","first-page":"204","article-title":"Fast convergence of online pairwise learning algorithms","author":"boissier","year":"2016","journal-title":"Proc Artif Intell Statist"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1201\/9781315366951"},{"key":"ref41","first-page":"441","article-title":"On the generalization ability of online learning algorithms for pairwise loss functions","author":"kar","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref23","first-page":"244","article-title":"Fastfood-computing hilbert space expansions in loglinear time","author":"le","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2011.10.006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403298"},{"key":"ref43","author":"orabona","year":"2009","journal-title":"DOGMA A Matlab Toolbox for Online Learning"},{"key":"ref25","first-page":"3085","article-title":"Asynchronous doubly stochastic sparse kernel learning","author":"gu","year":"2018","journal-title":"Proc 32nd AAAI Conf Artif Intell"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/9703108\/09200544.pdf?arnumber=9200544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T20:57:30Z","timestamp":1650920250000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9200544\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":45,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2020.3024987","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,3,1]]}}}