{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:05Z","timestamp":1750220405775,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T00:00:00Z","timestamp":1627257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CNS-2003081,CPS-1739344,SaTC-1618768"],"award-info":[{"award-number":["CNS-2003081,CPS-1739344,SaTC-1618768"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,26]]},"DOI":"10.1145\/3466772.3467055","type":"proceedings-article","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T10:38:19Z","timestamp":1624963099000},"page":"261-270","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Accelerating Distributed Online Meta-Learning via Multi-Agent Collaboration under Limited Communication"],"prefix":"10.1145","author":[{"given":"Sen","family":"Lin","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet","family":"Dedeoglu","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junshan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,26]]},"reference":[{"volume-title":"Prediction, learning, and games","author":"Cesa-Bianchi Nicolo","key":"e_1_3_2_1_1_1","unstructured":"Nicolo Cesa-Bianchi and G\u00e1bor Lugosi . 2006. Prediction, learning, and games . Cambridge university press . Nicolo Cesa-Bianchi and G\u00e1bor Lugosi. 2006. Prediction, learning, and games. Cambridge university press."},{"key":"e_1_3_2_1_2_1","volume-title":"Projection-free online optimization with stochastic gradient: From convexity to submodularity. arXiv preprint arXiv:1802.08183","author":"Chen Lin","year":"2018","unstructured":"Lin Chen , Christopher Harshaw , Hamed Hassani , and Amin Karbasi . 2018. Projection-free online optimization with stochastic gradient: From convexity to submodularity. arXiv preprint arXiv:1802.08183 ( 2018 ). Lin Chen, Christopher Harshaw, Hamed Hassani, and Amin Karbasi. 2018. Projection-free online optimization with stochastic gradient: From convexity to submodularity. arXiv preprint arXiv:1802.08183 (2018)."},{"key":"e_1_3_2_1_3_1","volume-title":"A continual learning survey: Defying forgetting in classification tasks. arXiv preprint arXiv:1909.08383","author":"Lange Matthias De","year":"2019","unstructured":"Matthias De Lange , Rahaf Aljundi , Marc Masana , Sarah Parisot , Xu Jia , Ale\u0161 Leonardis , Gregory Slabaugh , and Tinne Tuytelaars . 2019. A continual learning survey: Defying forgetting in classification tasks. arXiv preprint arXiv:1909.08383 ( 2019 ). Matthias De Lange, Rahaf Aljundi, Marc Masana, Sarah Parisot, Xu Jia, Ale\u0161 Leonardis, Gregory Slabaugh, and Tinne Tuytelaars. 2019. A continual learning survey: Defying forgetting in classification tasks. arXiv preprint arXiv:1909.08383 (2019)."},{"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 . The Journal of Machine Learning Research 13 (2012), 165 -- 202 . Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, and Lin Xiao. 2012. Optimal distributed online prediction using mini-batches. The Journal of Machine Learning Research 13 (2012), 165--202.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_2_1_5_1","volume-title":"Riccardo Grazzi, and Massimiliano Pontil.","author":"Denevi Giulia","year":"2019","unstructured":"Giulia Denevi , Carlo Ciliberto , Riccardo Grazzi, and Massimiliano Pontil. 2019 . Learning-to-learn stochastic gradient descent with biased regularization. arXiv preprint arXiv:1903.10399 (2019). Giulia Denevi, Carlo Ciliberto, Riccardo Grazzi, and Massimiliano Pontil. 2019. Learning-to-learn stochastic gradient descent with biased regularization. arXiv preprint arXiv:1903.10399 (2019)."},{"key":"e_1_3_2_1_6_1","volume-title":"Carlo Ciliberto, and Massimiliano Pontil","author":"Denevi Giulia","year":"2019","unstructured":"Giulia Denevi , Dimitris Stamos , Carlo Ciliberto, and Massimiliano Pontil . 2019 . Online-Within-Online Meta-Learning. In Advances in Neural Information Processing Systems . 13110--13120. Giulia Denevi, Dimitris Stamos, Carlo Ciliberto, and Massimiliano Pontil. 2019. Online-Within-Online Meta-Learning. In Advances in Neural Information Processing Systems. 13110--13120."},{"key":"e_1_3_2_1_7_1","volume-title":"Model-agnostic meta-learning for fast adaptation of deep networks. arXiv preprint arXiv:1703.03400","author":"Finn Chelsea","year":"2017","unstructured":"Chelsea Finn , Pieter Abbeel , and Sergey Levine . 2017. Model-agnostic meta-learning for fast adaptation of deep networks. arXiv preprint arXiv:1703.03400 ( 2017 ). Chelsea Finn, Pieter Abbeel, and Sergey Levine. 2017. Model-agnostic meta-learning for fast adaptation of deep networks. arXiv preprint arXiv:1703.03400 (2017)."},{"key":"e_1_3_2_1_8_1","volume-title":"Online meta-learning. arXiv preprint arXiv:1902.08438","author":"Finn Chelsea","year":"2019","unstructured":"Chelsea Finn , Aravind Rajeswaran , Sham Kakade , and Sergey Levine . 2019. Online meta-learning. arXiv preprint arXiv:1902.08438 ( 2019 ). Chelsea Finn, Aravind Rajeswaran, Sham Kakade, and Sergey Levine. 2019. Online meta-learning. arXiv preprint arXiv:1902.08438 (2019)."},{"key":"e_1_3_2_1_9_1","volume-title":"Introduction to online convex optimization. arXiv preprint arXiv:1909.05207","author":"Hazan Elad","year":"2019","unstructured":"Elad Hazan . 2019. Introduction to online convex optimization. arXiv preprint arXiv:1909.05207 ( 2019 ). Elad Hazan. 2019. Introduction to online convex optimization. arXiv preprint arXiv:1909.05207 (2019)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"e_1_3_2_1_11_1","volume-title":"Projection-free online learning. arXiv preprint arXiv:1206.4657","author":"Hazan Elad","year":"2012","unstructured":"Elad Hazan and Satyen Kale . 2012. Projection-free online learning. arXiv preprint arXiv:1206.4657 ( 2012 ). Elad Hazan and Satyen Kale. 2012. Projection-free online learning. arXiv preprint arXiv:1206.4657 (2012)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44848-9_40"},{"key":"e_1_3_2_1_13_1","volume-title":"Provable guarantees for gradient-based meta-learning. arXiv preprint arXiv:1902.10644","author":"Khodak Mikhail","year":"2019","unstructured":"Mikhail Khodak , Maria-Florina Balcan , and Ameet Talwalkar . 2019. Provable guarantees for gradient-based meta-learning. arXiv preprint arXiv:1902.10644 ( 2019 ). Mikhail Khodak, Maria-Florina Balcan, and Ameet Talwalkar. 2019. Provable guarantees for gradient-based meta-learning. arXiv preprint arXiv:1902.10644 (2019)."},{"key":"e_1_3_2_1_14_1","unstructured":"Mikhail Khodak Maria-Florina F Balcan and Ameet S Talwalkar. 2019. Adaptive gradient-based meta-learning methods. In Advances in Neural Information Processing Systems. 5917--5928.  Mikhail Khodak Maria-Florina F Balcan and Ameet S Talwalkar. 2019. Adaptive gradient-based meta-learning methods. In Advances in Neural Information Processing Systems. 5917--5928."},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the annual meeting of the cognitive science society","volume":"33","author":"Lake Brenden","year":"2011","unstructured":"Brenden Lake , Ruslan Salakhutdinov , Jason Gross , and Joshua Tenenbaum . 2011 . One shot learning of simple visual concepts . In Proceedings of the annual meeting of the cognitive science society , Vol. 33 . Brenden Lake, Ruslan Salakhutdinov, Jason Gross, and Joshua Tenenbaum. 2011. One shot learning of simple visual concepts. In Proceedings of the annual meeting of the cognitive science society, Vol. 33."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECC.2016.7810293"},{"key":"e_1_3_2_1_17_1","volume-title":"International Conference on Artificial Intelligence and Statistics. 1662--1672","author":"Li Boyue","year":"2020","unstructured":"Boyue Li , Shicong Cen , Yuxin Chen , and Yuejie Chi . 2020 . Communication-efficient distributed optimization in networks with gradient tracking and variance reduction . In International Conference on Artificial Intelligence and Statistics. 1662--1672 . Boyue Li, Shicong Cen, Yuxin Chen, and Yuejie Chi. 2020. Communication-efficient distributed optimization in networks with gradient tracking and variance reduction. In International Conference on Artificial Intelligence and Statistics. 1662--1672."},{"key":"e_1_3_2_1_18_1","volume-title":"Accelerating Distributed Online Meta-Learning via Multi-Agent Collaboration under Limited Communication. arXiv preprint arXiv:2012.08660","author":"Lin Sen","year":"2020","unstructured":"Sen Lin , Mehmet Dedeoglu , and Junshan Zhang . 2020. Accelerating Distributed Online Meta-Learning via Multi-Agent Collaboration under Limited Communication. arXiv preprint arXiv:2012.08660 ( 2020 ). Sen Lin, Mehmet Dedeoglu, and Junshan Zhang. 2020. Accelerating Distributed Online Meta-Learning via Multi-Agent Collaboration under Limited Communication. arXiv preprint arXiv:2012.08660 (2020)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.2200\/S01054ED1V01Y202009LNA025"},{"key":"e_1_3_2_1_20_1","volume-title":"A simple neural attentive meta-learner. arXiv preprint arXiv:1707.03141","author":"Mishra Nikhil","year":"2017","unstructured":"Nikhil Mishra , Mostafa Rohaninejad , Xi Chen , and Pieter Abbeel . 2017. A simple neural attentive meta-learner. arXiv preprint arXiv:1707.03141 ( 2017 ). Nikhil Mishra, Mostafa Rohaninejad, Xi Chen, and Pieter Abbeel. 2017. A simple neural attentive meta-learner. arXiv preprint arXiv:1707.03141 (2017)."},{"key":"e_1_3_2_1_21_1","volume-title":"On first-order meta-learning algorithms. arXiv preprint arXiv:1803.02999","author":"Nichol Alex","year":"2018","unstructured":"Alex Nichol , Joshua Achiam , and John Schulman . 2018. On first-order meta-learning algorithms. arXiv preprint arXiv:1803.02999 ( 2018 ). Alex Nichol, Joshua Achiam, and John Schulman. 2018. On first-order meta-learning algorithms. arXiv preprint arXiv:1803.02999 (2018)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2958705"},{"key":"e_1_3_2_1_23_1","volume-title":"Distributed stochastic gradient tracking methods. Mathematical Programming","author":"Pu Shi","year":"2020","unstructured":"Shi Pu and Angelia Nedi\u0107 . 2020. Distributed stochastic gradient tracking methods. Mathematical Programming ( 2020 ), 1--49. Shi Pu and Angelia Nedi\u0107. 2020. Distributed stochastic gradient tracking methods. Mathematical Programming (2020), 1--49."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"e_1_3_2_1_25_1","unstructured":"Sachin Ravi and Hugo Larochelle. 2016. Optimization as a model for few-shot learning. (2016).  Sachin Ravi and Hugo Larochelle. 2016. Optimization as a model for few-shot learning. (2016)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2306253"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7952664"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Shai Shalev-Shwartz etal 2011. Online learning and online convex optimization. Foundations and trends in Machine Learning 4 2 (2011) 107--194.  Shai Shalev-Shwartz et al. 2011. Online learning and online convex optimization. Foundations and trends in Machine Learning 4 2 (2011) 107--194.","DOI":"10.1561\/2200000018"},{"key":"e_1_3_2_1_29_1","volume-title":"Federated multi-task learning. Advances in neural information processing systems 30","author":"Smith Virginia","year":"2017","unstructured":"Virginia Smith , Chao-Kai Chiang , Maziar Sanjabi , and Ameet S Talwalkar . 2017. Federated multi-task learning. Advances in neural information processing systems 30 ( 2017 ), 4424--4434. Virginia Smith, Chao-Kai Chiang, Maziar Sanjabi, and Ameet S Talwalkar. 2017. Federated multi-task learning. Advances in neural information processing systems 30 (2017), 4424--4434."},{"key":"e_1_3_2_1_30_1","unstructured":"Jake Snell Kevin Swersky and Richard Zemel. 2017. Prototypical networks for few-shot learning. In Advances in neural information processing systems. 4077--4087.  Jake Snell Kevin Swersky and Richard Zemel. 2017. Prototypical networks for few-shot learning. In Advances in neural information processing systems. 4077--4087."},{"key":"e_1_3_2_1_31_1","volume-title":"Distributed Zero-Order Algorithms for Nonconvex Multi-Agent Optimization. arXiv","author":"Tang Yujie","year":"2019","unstructured":"Yujie Tang , Junshan Zhang , and Na Li. 2019. Distributed Zero-Order Algorithms for Nonconvex Multi-Agent Optimization. arXiv ( 2019 ), arXiv-1908. Yujie Tang, Junshan Zhang, and Na Li. 2019. Distributed Zero-Order Algorithms for Nonconvex Multi-Agent Optimization. arXiv (2019), arXiv-1908."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Jiahao Xie Zebang Shen Chao Zhang Boyu Wang and Hui Qian. 2020. Efficient Projection-Free Online Methods with Stochastic Recursive Gradient.. In AAAI. 6446--6453.  Jiahao Xie Zebang Shen Chao Zhang Boyu Wang and Hui Qian. 2020. Efficient Projection-Free Online Methods with Stochastic Recursive Gradient.. In AAAI. 6446--6453.","DOI":"10.1609\/aaai.v34i04.6116"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.191"},{"key":"e_1_3_2_1_34_1","volume-title":"Distributed Online Convex Optimization with Improved Dynamic Regret. arXiv preprint arXiv:1911.05127","author":"Zhang Yan","year":"2019","unstructured":"Yan Zhang , Robert J Ravier , Vahid Tarokh , and Michael M Zavlanos . 2019. Distributed Online Convex Optimization with Improved Dynamic Regret. arXiv preprint arXiv:1911.05127 ( 2019 ). Yan Zhang, Robert J Ravier, Vahid Tarokh, and Michael M Zavlanos. 2019. Distributed Online Convex Optimization with Improved Dynamic Regret. arXiv preprint arXiv:1911.05127 (2019)."},{"key":"e_1_3_2_1_35_1","volume-title":"Decentralized Online Learning: Take Benefits from Others' Data without Sharing Your Own to Track Global Trend. arXiv preprint arXiv:1901.10593","author":"Zhao Yawei","year":"2019","unstructured":"Yawei Zhao , Chen Yu , Peilin Zhao , Hanlin Tang , Shuang Qiu , and Ji Liu . 2019. Decentralized Online Learning: Take Benefits from Others' Data without Sharing Your Own to Track Global Trend. arXiv preprint arXiv:1901.10593 ( 2019 ). Yawei Zhao, Chen Yu, Peilin Zhao, Hanlin Tang, Shuang Qiu, and Ji Liu. 2019. Decentralized Online Learning: Take Benefits from Others' Data without Sharing Your Own to Track Global Trend. arXiv preprint arXiv:1901.10593 (2019)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054002"}],"event":{"name":"MobiHoc '21: The Twenty-second International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Shanghai China","acronym":"MobiHoc '21"},"container-title":["Proceedings of the Twenty-second 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\/3466772.3467055","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3466772.3467055","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3466772.3467055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:57Z","timestamp":1750191537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3466772.3467055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,26]]},"references-count":36,"alternative-id":["10.1145\/3466772.3467055","10.1145\/3466772"],"URL":"https:\/\/doi.org\/10.1145\/3466772.3467055","relation":{},"subject":[],"published":{"date-parts":[[2021,7,26]]},"assertion":[{"value":"2021-07-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}