{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T13:24:48Z","timestamp":1769261088478,"version":"3.49.0"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"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":["62172179"],"award-info":[{"award-number":["62172179"]}],"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":["62476107"],"award-info":[{"award-number":["62476107"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tetci.2025.3616044","type":"journal-article","created":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:06:36Z","timestamp":1761588396000},"page":"952-966","source":"Crossref","is-referenced-by-count":0,"title":["Differentially Private Online Convex Optimization With Long-Term Constraints via Gaussian Mechanism and Virtual Queue"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0961-0545","authenticated-orcid":false,"given":"Lin","family":"Chen","sequence":"first","affiliation":[{"name":"National Engineering Research Center for E-learning, Central China Normal University, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8629-4622","authenticated-orcid":false,"given":"Pan","family":"Zhou","sequence":"additional","affiliation":[{"name":"Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5054-8515","authenticated-orcid":false,"given":"Xiaofeng","family":"Ding","sequence":"additional","affiliation":[{"name":"National Engineering Research Center for Big Data Technology and System Lab, Services Computing Techn-ology and System Lab, Cluster and Grid Computing Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6657-1154","authenticated-orcid":false,"given":"Huanle","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, University of Macau, Taipa, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7466-0384","authenticated-orcid":false,"given":"John C.S.","family":"Lui","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Chinese University of Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3040938"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2013.100"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2016.2638860"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2016.2597149"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488698"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155523"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2827302"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884653"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971255"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.4.769"},{"issue":"1","key":"ref12","first-page":"1","article-title":"A low complexity algorithm with o($\\sqrt{T}$) regret and o(1) constraint violations for online convex optimization with long term constraints","volume":"21","author":"Yu","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref13","first-page":"6140","article-title":"Online convex optimization for cumulative constraints","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yuan","year":"2018"},{"key":"ref14","first-page":"1428","article-title":"Online convex optimization with stochastic constraints","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yu","year":"2017"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/16M1059011"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref17","first-page":"402","article-title":"Adaptive algorithms for online convex optimization with long-term constraints","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","author":"Jenatton","year":"2016"},{"issue":"3","key":"ref18","first-page":"569","article-title":"Online learning with sample path constraints","volume":"10","author":"Mannor","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2226216"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2637364.2592004"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2551282"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2760284"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422560"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2020.2976273"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2018.2797806"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2794384"},{"key":"ref27","first-page":"24","article-title":"Differentially private online learning","volume-title":"Proc. Conf. Learn. Theory","author":"Jain","year":"2012"},{"key":"ref28","first-page":"2733","article-title":"(Nearly) optimal algorithms for private online learning in full-information and bandit settings","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Thakurta","year":"2013"},{"key":"ref29","first-page":"476","article-title":"(Near) dimension independent risk bounds for differentially private learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jain","year":"2014"},{"key":"ref30","first-page":"1650","article-title":"Differentially private online submodular minimization","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Cardoso","year":"2019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.65109\/rynw8080"},{"key":"ref32","first-page":"1279","article-title":"Differentially private online submodular maximization","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Salazar","year":"2021"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599889"},{"key":"ref34","article-title":"Binary classification under local label differential privacy using randomized response mechanisms","author":"Shirong","year":"2023","journal-title":"Trans. Mach. Learn. Res."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3273249"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38318-2_36"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.2200\/s00271ed1v01y201006cnt007"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2537216"},{"key":"ref40","first-page":"8894","article-title":"Online learning via the differential privacy lens","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Abernethy","year":"2019"},{"key":"ref41","first-page":"1802","article-title":"Parameter-free online convex optimization with sub-exponential noise","volume-title":"Proc. Conf. Learn. Theory","author":"Jun","year":"2019"},{"issue":"1","key":"ref42","first-page":"2503","article-title":"Trading regret for efficiency: Online convex optimization with long term constraints","volume":"13","author":"Mahdavi","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2964200"},{"key":"ref44","first-page":"11998","article-title":"Regret and cumulative constraint violation analysis for online convex optimization with long term constraints","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Yi","year":"2021"},{"key":"ref45","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. 20th Int. Conf. Mach. Learn.","author":"Zinkevich","year":"2003"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2019.108771"},{"key":"ref47","first-page":"2885","article-title":"Online convex optimization with perturbed constraints: Optimal rates against stronger benchmarks","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Valls","year":"2020"},{"key":"ref48","article-title":"Algorithm design for low latency communication in wireless networks","author":"ElAzzouni","year":"2020"},{"key":"ref49","first-page":"3944","article-title":"Cautious regret minimization: Online optimization with long-term budget constraints","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liakopoulos","year":"2019"},{"key":"ref50","article-title":"Online convex optimization with time-varying constraints","author":"Neely","year":"2017"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1561\/9781601988195"},{"issue":"1","key":"ref53","first-page":"2909","article-title":"Cvxpy: A python-embedded modeling language for convex optimization","volume":"17","author":"Diamond","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2021.102504"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7433297\/11361307\/11218946.pdf?arnumber=11218946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T21:01:15Z","timestamp":1769202075000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11218946\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":54,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2025.3616044","relation":{},"ISSN":["2471-285X"],"issn-type":[{"value":"2471-285X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}