{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T16:34:59Z","timestamp":1768408499258,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021ZD0110400"],"award-info":[{"award-number":["2021ZD0110400"]}],"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":["2021YFB2900103"],"award-info":[{"award-number":["2021YFB2900103"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovation Program for Quantum Science and Technology","award":["2021ZD0302900"],"award-info":[{"award-number":["2021ZD0302900"]}]},{"name":"China National Natural Science Foundation","award":["62132018"],"award-info":[{"award-number":["62132018"]}]},{"name":"China National Natural Science Foundation","award":["61932016"],"award-info":[{"award-number":["61932016"]}]},{"name":"Pioneer and Leading Goose R&D Program of Zhejiang","award":["2023C01029"],"award-info":[{"award-number":["2023C01029"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["WK2150110024"],"award-info":[{"award-number":["WK2150110024"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The University Synergy Innovation Program of Anhui Province","award":["GXXT-2022-049"],"award-info":[{"award-number":["GXXT-2022-049"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,23]]},"DOI":"10.1145\/3565287.3610257","type":"proceedings-article","created":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T19:59:44Z","timestamp":1695931184000},"page":"171-180","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Differentially Private Distributed Online Convex Optimization Towards Low Regret and Communication Cost"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-9492-1845","authenticated-orcid":false,"given":"Jiandong","family":"Liu","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1004-8588","authenticated-orcid":false,"given":"Lan","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9730-606X","authenticated-orcid":false,"given":"Xiaojing","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6070-6625","authenticated-orcid":false,"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ICML","volume":"97","author":"Acharya Jayadev","year":"2019","unstructured":"Jayadev Acharya , Chris De Sa , Dylan J. Foster , and Karthik Sridharan . 2019 . Distributed Learning with Sublinear Communication . In ICML , Vol. 97 . PMLR, 40--50. Jayadev Acharya, Chris De Sa, Dylan J. Foster, and Karthik Sridharan. 2019. Distributed Learning with Sublinear Communication. In ICML, Vol. 97. PMLR, 40--50."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2017.2715342"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Khaled M. Alzoubi Peng-Jun Wan and Ophir Frieder. 2002. Message-optimal connected dominating sets in mobile ad hoc networks. In MobiHoc. ACM 157--164.  Khaled M. Alzoubi Peng-Jun Wan and Ophir Frieder. 2002. Message-optimal connected dominating sets in mobile ad hoc networks. In MobiHoc. ACM 157--164.","DOI":"10.1145\/513800.513820"},{"key":"e_1_3_2_1_4_1","first-page":"165","article-title":"Optimal Distributed Online Prediction Using Mini-Batches","volume":"13","author":"Dekel Ofer","year":"2012","unstructured":"Ofer Dekel , Ran Gilad-Bachrach , Ohad Shamir , and Lin Xiao . 2012 . Optimal Distributed Online Prediction Using Mini-Batches . J. Mach. Learn. Res. 13 (2012), 165 -- 202 . Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, and Lin Xiao. 2012. Optimal Distributed Online Prediction Using Mini-Batches. J. Mach. Learn. Res. 13 (2012), 165--202.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_5_1","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository.  Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Aaron Roth etal 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science 9 3--4 (2014) 211--407.  Cynthia Dwork Aaron Roth et al. 2014. The algorithmic foundations of differential privacy. Foundations and Trends \u00ae in Theoretical Computer Science 9 3--4 (2014) 211--407.","DOI":"10.1561\/0400000042"},{"key":"e_1_3_2_1_7_1","volume-title":"Mirrokni","author":"Esfandiari Hossein","year":"2021","unstructured":"Hossein Esfandiari , Amin Karbasi , Abbas Mehrabian , and Vahab S . Mirrokni . 2021 . Regret Bounds for Batched Bandits. In AAAI. AAAI Press , 7340--7348. Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, and Vahab S. Mirrokni. 2021. Regret Bounds for Batched Bandits. In AAAI. AAAI Press, 7340--7348."},{"key":"e_1_3_2_1_8_1","volume-title":"ICML","volume":"119","author":"Eshraghi Nima","year":"2020","unstructured":"Nima Eshraghi and Ben Liang . 2020 . Distributed Online Optimization over a Heterogeneous Network with Any-Batch Mirror Descent . In ICML , Vol. 119 . PMLR, 2933--2942. Nima Eshraghi and Ben Liang. 2020. Distributed Online Optimization over a Heterogeneous Network with Any-Batch Mirror Descent. In ICML, Vol. 119. PMLR, 2933--2942."},{"key":"e_1_3_2_1_9_1","volume-title":"ICML","volume":"162","author":"Han Yuxuan","year":"2022","unstructured":"Yuxuan Han , Zhicong Liang , Zhipeng Liang , Yang Wang , Yuan Yao , and Jiheng Zhang . 2022 . Private Streaming SCO in \u2113p geometry with Applications in High Dimensional Online Decision Making . In ICML , Vol. 162 . PMLR, 8249--8279. Yuxuan Han, Zhicong Liang, Zhipeng Liang, Yang Wang, Yuan Yao, and Jiheng Zhang. 2022. Private Streaming SCO in \u2113p geometry with Applications in High Dimensional Online Decision Making. In ICML, Vol. 162. PMLR, 8249--8279."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"e_1_3_2_1_11_1","unstructured":"S. Hettich and S. D. Bay. 1999. The UCI KDD Archive.  S. Hettich and S. D. Bay. 1999. The UCI KDD Archive."},{"key":"e_1_3_2_1_12_1","volume-title":"Towards Practical Differentially Private Convex Optimization","author":"Iyengar Roger","unstructured":"Roger Iyengar , Joseph P. Near , Dawn Song , Om Thakkar , Abhradeep Thakurta , and Lun Wang . 2019. Towards Practical Differentially Private Convex Optimization . In SP. IEEE , 299--316. Roger Iyengar, Joseph P. Near, Dawn Song, Om Thakkar, Abhradeep Thakurta, and Lun Wang. 2019. Towards Practical Differentially Private Convex Optimization. In SP. IEEE, 299--316."},{"key":"e_1_3_2_1_13_1","volume-title":"COLT","volume":"23","author":"Jain Prateek","year":"2012","unstructured":"Prateek Jain , Pravesh Kothari , and Abhradeep Thakurta . 2012 . Differentially Private Online Learning . In COLT , Vol. 23 . JMLR.org, 24.1--24.34. Prateek Jain, Pravesh Kothari, and Abhradeep Thakurta. 2012. Differentially Private Online Learning. In COLT, Vol. 23. JMLR.org, 24.1--24.34."},{"key":"e_1_3_2_1_14_1","volume-title":"ICML","volume":"97","author":"Koloskova Anastasia","year":"2019","unstructured":"Anastasia Koloskova , Sebastian Stich , and Martin Jaggi . 2019 . Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication . In ICML , Vol. 97 . PMLR, 3478--3487. Anastasia Koloskova, Sebastian Stich, and Martin Jaggi. 2019. Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication. In ICML, Vol. 97. PMLR, 3478--3487."},{"key":"e_1_3_2_1_15_1","unstructured":"Jinlong Lei Peng Yi Yiguang Hong Jie Chen and Guodong Shi. 2020. Online Convex Optimization Over Erdos-Renyi Random Networks. In NeurIPS. 15591--15601.  Jinlong Lei Peng Yi Yiguang Hong Jie Chen and Guodong Shi. 2020. Online Convex Optimization Over Erdos-Renyi Random Networks. In NeurIPS. 15591--15601."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2794384"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Sen Lin Mehmet Dedeoglu and Junshan Zhang. 2021. Accelerating Distributed Online Meta-Learning via Multi-Agent Collaboration under Limited Communication. In MobiHoc. ACM 261--270.  Sen Lin Mehmet Dedeoglu and Junshan Zhang. 2021. Accelerating Distributed Online Meta-Learning via Multi-Agent Collaboration under Limited Communication. In MobiHoc. ACM 261--270.","DOI":"10.1145\/3466772.3467055"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/JBHI.2020.2999497"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","first-page":"3224","DOI":"10.1109\/TCYB.2020.2973221","article-title":"Privacy Masking Stochastic Subgradient-Push Algorithm for Distributed Online Optimization","volume":"51","author":"L\u00fc Qingguo","year":"2021","unstructured":"Qingguo L\u00fc , Xiaofeng Liao , Tao Xiang , Huaqing Li , and Tingwen Huang . 2021 . Privacy Masking Stochastic Subgradient-Push Algorithm for Distributed Online Optimization . IEEE Trans. Cybern. 51 , 6 (2021), 3224 -- 3237 . Qingguo L\u00fc, Xiaofeng Liao, Tao Xiang, Huaqing Li, and Tingwen Huang. 2021. Privacy Masking Stochastic Subgradient-Push Algorithm for Distributed Online Optimization. IEEE Trans. Cybern. 51, 6 (2021), 3224--3237.","journal-title":"IEEE Trans. Cybern."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2817461"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2022.108836"},{"key":"e_1_3_2_1_22_1","unstructured":"Ohad Shamir. 2014. Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation. In NeurIPS. 163--171.  Ohad Shamir. 2014. Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation. In NeurIPS. 163--171."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Jianhan Song Gustavo de Veciana and Sanjay Shakkottai. 2022. Online learning for multi-agent based resource allocation in weakly coupled wireless systems. In MobiHoc. ACM 111--120.  Jianhan Song Gustavo de Veciana and Sanjay Shakkottai. 2022. Online learning for multi-agent based resource allocation in weakly coupled wireless systems. In MobiHoc. ACM 111--120.","DOI":"10.1145\/3492866.3549714"},{"key":"e_1_3_2_1_24_1","volume-title":"Impact of HbA1c measurement on hospital readmission rates: analysis of 70,000 clinical database patient records. BioMed research international 2014","author":"Strack Beata","year":"2014","unstructured":"Beata Strack , Jonathan P DeShazo , Chris Gennings , Juan L Olmo , Sebastian Ventura , Krzysztof J Cios , and John N Clore . 2014. Impact of HbA1c measurement on hospital readmission rates: analysis of 70,000 clinical database patient records. BioMed research international 2014 ( 2014 ). Beata Strack, Jonathan P DeShazo, Chris Gennings, Juan L Olmo, Sebastian Ventura, Krzysztof J Cios, and John N Clore. 2014. Impact of HbA1c measurement on hospital readmission rates: analysis of 70,000 clinical database patient records. BioMed research international 2014 (2014)."},{"key":"e_1_3_2_1_25_1","volume-title":"Smith","author":"Thakurta Abhradeep Guha","year":"2013","unstructured":"Abhradeep Guha Thakurta and Adam D . Smith . 2013 . (Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings. In NeurIPS. 2733--2741. Abhradeep Guha Thakurta and Adam D. Smith. 2013. (Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings. In NeurIPS. 2733--2741."},{"key":"e_1_3_2_1_26_1","volume-title":"Modiano","author":"Tripathi Vishrant","year":"2021","unstructured":"Vishrant Tripathi and Eytan H . Modiano . 2021 . An Online Learning Approach to Optimizing Time-Varying Costs of AoI. In MobiHoc. ACM , 241--250. Vishrant Tripathi and Eytan H. Modiano. 2021. An Online Learning Approach to Optimizing Time-Varying Costs of AoI. In MobiHoc. ACM, 241--250."},{"key":"e_1_3_2_1_27_1","volume-title":"ALT","volume":"167","author":"van der Hoeven Dirk","year":"2022","unstructured":"Dirk van der Hoeven , H\u00e9di Hadiji , and Tim van Erven . 2022 . Distributed Online Learning for Joint Regret with Communication Constraints . In ALT , Vol. 167 . PMLR, 1003--1042. Dirk van der Hoeven, H\u00e9di Hadiji, and Tim van Erven. 2022. Distributed Online Learning for Joint Regret with Communication Constraints. In ALT, Vol. 167. PMLR, 1003--1042."},{"key":"e_1_3_2_1_28_1","volume-title":"Communication Complexity. In ICML","volume":"119","author":"Wan Yuanyu","year":"2020","unstructured":"Yuanyu Wan , Wei-Wei Tu , and Lijun Zhang . 2020 . Projection-free Distributed Online Convex Optimization with [EQUATION ] Communication Complexity. In ICML , Vol. 119 . PMLR, 9818--9828. Yuanyu Wan, Wei-Wei Tu, and Lijun Zhang. 2020. Projection-free Distributed Online Convex Optimization with [EQUATION] Communication Complexity. In ICML, Vol. 119. PMLR, 9818--9828."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2020.2976273"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.191"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2018.2797806"}],"event":{"name":"MobiHoc '23: Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","location":"Washington DC USA","acronym":"MobiHoc '23","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"]},"container-title":["Proceedings of the Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565287.3610257","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:43Z","timestamp":1750178263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565287.3610257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,16]]},"references-count":31,"alternative-id":["10.1145\/3565287.3610257","10.1145\/3565287"],"URL":"https:\/\/doi.org\/10.1145\/3565287.3610257","relation":{},"subject":[],"published":{"date-parts":[[2023,10,16]]},"assertion":[{"value":"2023-10-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}