{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:10:08Z","timestamp":1745665808491,"version":"3.40.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T00:00:00Z","timestamp":1741910400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T00:00:00Z","timestamp":1741910400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172142","62102134"],"award-info":[{"award-number":["62172142","62102134"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cogn Comput"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s12559-025-10438-w","type":"journal-article","created":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T05:43:45Z","timestamp":1741931025000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Communication-Efficient Distributed Frank-Wolfe Online Algorithm with an Event-Triggered Mechanism"],"prefix":"10.1007","volume":"17","author":[{"given":"Huimin","family":"Gao","sequence":"first","affiliation":[]},{"given":"Muhua","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zhihang","family":"Ji","sequence":"additional","affiliation":[]},{"given":"Ruijuan","family":"Zheng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1572-5293","authenticated-orcid":false,"given":"Qingtao","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,14]]},"reference":[{"issue":"2","key":"10438_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1561\/2200000018","volume":"4","author":"S Shalev-Shwartz","year":"2012","unstructured":"Shalev-Shwartz S. Online learning and online convex optimization. Found Trends in Mach Learn. 2012;4(2):107\u201394.","journal-title":"Found Trends in Mach Learn"},{"key":"10438_CR2","unstructured":"Zhang L, Lu S, Zhou Z. Adaptive online learning in dynamic environments. In: Advances in Neural Information Processing Systems, Montr\u00e9al, 2018;1330\u201340"},{"issue":"1","key":"10438_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jcss.2007.04.016","volume":"74","author":"B Awerbuch","year":"2008","unstructured":"Awerbuch B, Kleinberg R. Online linear optimization and adaptive routing. J Comput Syst Sci. 2008;74(1):97\u2013114.","journal-title":"J Comput Syst Sci"},{"key":"10438_CR4","doi-asserted-by":"crossref","unstructured":"He T, Goeckel D, Raghavendra R, Towsley D. Endhost-based shortest path routing in dynamic networks: an online learning approach. In: Proceedings of the IEEE INFOCOM, Turin, 2013;2202\u201310","DOI":"10.1109\/INFCOM.2013.6567023"},{"issue":"3","key":"10438_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1287\/msom.5.3.203.16031","volume":"5","author":"GR Bitran","year":"2003","unstructured":"Bitran GR, Caldentey R. An overview of pricing models for revenue management. Manufact Serv Operation Manage. 2003;5(3):203\u201329.","journal-title":"Manufact Serv Operation Manage"},{"issue":"9","key":"10438_CR6","doi-asserted-by":"publisher","first-page":"3952","DOI":"10.1287\/mnsc.2018.3174","volume":"65","author":"SR Balseiro","year":"2019","unstructured":"Balseiro SR, Gur Y. Learning in repeated auctions with budgets: regret minimization and equilibrium. Manage Sci. 2019;65(9):3952\u201368.","journal-title":"Manage Sci"},{"key":"10438_CR7","doi-asserted-by":"crossref","unstructured":"Feldman J, Mehta A, Mirrokni VS, Muthukrishnan S. Online stochastic matching: beating 1-1\/e. In: 50th Annual IEEE Symposium on Foundations of Computer Science, Atlanta, 2009;117\u201326","DOI":"10.1109\/FOCS.2009.72"},{"issue":"3\u20134","key":"10438_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1561\/2400000013","volume":"2","author":"E Hazan","year":"2016","unstructured":"Hazan E. Introduction to online convex optimization. Found Trends Optimization. 2016;2(3\u20134):157\u2013325.","journal-title":"Found Trends Optimization."},{"issue":"1","key":"10438_CR9","first-page":"37","volume":"22","author":"A Iusem","year":"2003","unstructured":"Iusem A. On the convergence properties of the projected gradient method for convex optimization. Comput Appl Math. 2003;22(1):37\u201352.","journal-title":"Comput Appl Math"},{"key":"10438_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10994-007-5016-8","volume":"69","author":"E Hazan","year":"2007","unstructured":"Hazan E, Agarwal A, Kale S. Logarithmic regret algorithms for online convex optimization. Mach Learn. 2007;69:169\u201392.","journal-title":"Mach Learn"},{"issue":"1\u20132","key":"10438_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank M, Wolfe P. An algorithm for quadratic programming. Naval Res Logistic Quart. 1956;3(1\u20132):95\u2013110.","journal-title":"Naval Res Logistic Quart"},{"key":"10438_CR12","doi-asserted-by":"crossref","unstructured":"Wan Y, Zhang L. Projection-free online learning over strongly convex sets. In: Thirty-Fifth AAAI Conference on Artificial Intelligence, Virtual Event, 2021;10076\u201384","DOI":"10.1609\/aaai.v35i11.17209"},{"key":"10438_CR13","unstructured":"Chen L, Zhang M, Karbasi A. Projection-free bandit convex optimization. In: the 22nd International Conference on Artificial Intelligence and Statistics, Okinawa, 2019;2047\u201356"},{"issue":"3","key":"10438_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1109\/MSP.2012.2231991","volume":"30","author":"A Sayed","year":"2013","unstructured":"Sayed A, Tu S, Chen J, Zhao X, Towfic ZJ. Diffusion strategies for adaptation and learning over networks: an examination of distributed strategies and network behavior. IEEE Signal Process Magaz. 2013;30(3):155\u201371.","journal-title":"IEEE Signal Process Magaz"},{"key":"10438_CR15","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.automatica.2017.06.011","volume":"83","author":"S Liu","year":"2017","unstructured":"Liu S, Qiu Z, Xie L. Convergence rate analysis of distributed optimization with projected subgradient algorithm. Automatic. 2017;83:162\u20139.","journal-title":"Automatic"},{"key":"10438_CR16","doi-asserted-by":"crossref","unstructured":"Hosseini S, Chapman A, Mesbahi M. Online distributed optimization via dual averaging. In: Proceedings of the 52nd IEEE Conference on Decision and Control, Florence, 2013;1484\u201389","DOI":"10.1109\/CDC.2013.6760092"},{"key":"10438_CR17","unstructured":"Zhang W, Zhao P, Zhu W, Hoi SCH, Zhang T. Projection-free distributed online learning in networks. In: Proceedings of the 34th International Conference on Machine Learning, Sydney, 2017;4054\u201362"},{"key":"10438_CR18","first-page":"51","volume":"22","author":"J Zhu","year":"2021","unstructured":"Zhu J, Wu Q, Zhang M, Zheng R, Li K. Projection-free decentralized online learning for submodular maximization over time-varying networks. J Mach Learn Res. 2021;22:51\u201315142.","journal-title":"J Mach Learn Res"},{"issue":"7","key":"10438_CR19","doi-asserted-by":"publisher","first-page":"4518","DOI":"10.1109\/TSMC.2021.3097714","volume":"52","author":"M Zhang","year":"2022","unstructured":"Zhang M, Hao B, Ge Q, Zhu J, Zheng R, Wu Q. Distributed adaptive subgradient algorithms for online learning over time-varying networks. IEEE Trans Syst, Man, Cybern: Syst. 2022;52(7):4518\u201329.","journal-title":"IEEE Trans Syst, Man, Cybern: Syst"},{"issue":"2","key":"10438_CR20","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/s12559-021-09985-9","volume":"14","author":"Y Zhou","year":"2022","unstructured":"Zhou Y, Huang K, Cheng C, Wang X, Liu X. LightAdam: towards a fast and accurate adaptive momentum online algorithm. Cogn Comput. 2022;14(2):764\u201379.","journal-title":"Cogn Comput"},{"issue":"5","key":"10438_CR21","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1109\/TAC.2011.2174666","volume":"57","author":"DV Dimarogonas","year":"2012","unstructured":"Dimarogonas DV, Frazzoli E, Johansson KH. Distributed event-triggered control for multi-agent systems. IEEE Trans Automat Contr. 2012;57(5):1291\u20137.","journal-title":"IEEE Trans Automat Contr"},{"issue":"7","key":"10438_CR22","doi-asserted-by":"publisher","first-page":"2248","DOI":"10.1109\/TAC.2018.2800760","volume":"63","author":"Y Kajiyama","year":"2018","unstructured":"Kajiyama Y, Hayashi N, Takai S. Distributed subgradient method with edge-based event-triggered communication. IEEE Trans Automat Contr. 2018;63(7):2248\u201355.","journal-title":"IEEE Trans Automat Contr"},{"issue":"1","key":"10438_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TCNS.2016.2585305","volume":"5","author":"S Liu","year":"2018","unstructured":"Liu S, Xie L, Quevedo DE. Event-triggered quantized communication based distributed convex optimization. IEEE Trans Contr Netw Syst. 2018;5(1):167\u201378.","journal-title":"IEEE Trans Contr Netw Syst"},{"key":"10438_CR24","doi-asserted-by":"crossref","unstructured":"Yamashita M, Hayashi N, Takai S. Dynamic regret analysis for event-triggered distributed online optimization algorithm. IEICE Trans Fundament Electron, Commun Comput Sci 2021;104-A(2):430\u201337","DOI":"10.1587\/transfun.2020MAP0003"},{"key":"10438_CR25","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TSP.2020.3044843","volume":"69","author":"X Cao","year":"2021","unstructured":"Cao X, Basar T. Decentralized online convex optimization with event-triggered communications. IEEE Trans Signal Process. 2021;69:284\u201399.","journal-title":"IEEE Trans Signal Process"},{"issue":"2","key":"10438_CR26","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/TCNS.2023.3294432","volume":"11","author":"K Okamoto","year":"2024","unstructured":"Okamoto K, Hayashi N, Takai S. Distributed online adaptive gradient descent with event-triggered communication. IEEE Trans Contr Netw Syst. 2024;11(2):610\u201322.","journal-title":"IEEE Trans Contr Netw Syst"},{"key":"10438_CR27","unstructured":"Yang T, Lin Q, Zhang L. A richer theory of convex constrained optimization with reduced projections and improved rates. In: Proceedings of the 34th International Conference on Machine Learning, Sydney, 2017;3901\u201310"},{"key":"10438_CR28","unstructured":"Zhang L, Yang T, Jin R, He X. O(logt) projections for stochastic optimization of smooth and strongly convex functions. In: Proceedings of the 30th International Conference on Machine Learning, Atlanta, 2013; 1121\u201329"},{"key":"10438_CR29","unstructured":"Hazan E, Kale S. Projection-free online learning. In: Proceedings of the 29th International Conference on Machine Learning, Edinburgh 2012"},{"key":"10438_CR30","unstructured":"Levy K, Krause A. Projection free online learning over smooth sets. In: the 22nd International Conference on Artificial Intelligence and Statistics, Naha, 2019;1458\u201366"},{"issue":"3","key":"10438_CR31","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/s10957-010-9737-7","volume":"147","author":"S Ram","year":"2010","unstructured":"Ram S, Nedic A, Veeravalli V. Distributed stochastic subgradient projection algorithms for convex optimization. J Optimiz Theory Appl. 2010;147(3):516\u201345.","journal-title":"J Optimiz Theory Appl"},{"issue":"6","key":"10438_CR32","doi-asserted-by":"publisher","first-page":"3029","DOI":"10.1109\/TAC.2021.3091096","volume":"67","author":"K Lu","year":"2022","unstructured":"Lu K, Wang L. Online distributed optimization with nonconvex objective functions: sublinearity of first-order optimality condition-based regret. IEEE Trans Automat Contr. 2022;67(6):3029\u201335.","journal-title":"IEEE Trans Automat Contr"},{"key":"10438_CR33","unstructured":"Jiang X, Zeng X, Xie L, Sun J, Chen J. Distributed stochastic projection-free solver for constrained optimization. 2022, arXiv:2204.10605"},{"key":"10438_CR34","unstructured":"Wu Q, Zhu J, Ge Q, Zhang M. An accelerated distributed online learning algorithm based on conditional gradient. Acta Automat Sinica 2022;45"},{"issue":"2","key":"10438_CR35","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1109\/TAC.2019.2916985","volume":"65","author":"C Liu","year":"2020","unstructured":"Liu C, Li H, Shi Y, Xu D. Distributed event-triggered gradient method for constrained convex minimization. IEEE Trans Automat Contr. 2020;65(2):778\u201385.","journal-title":"IEEE Trans Automat Contr"},{"key":"10438_CR36","doi-asserted-by":"crossref","unstructured":"Watts DJ, Strogatz SH. Collective dynamics of \u201csmall-world\u201d networks. Nature. 1998;393:440\u20132.","DOI":"10.1038\/30918"},{"issue":"11","key":"10438_CR37","doi-asserted-by":"publisher","first-page":"5522","DOI":"10.1109\/TAC.2017.2685559","volume":"62","author":"H Wai","year":"2017","unstructured":"Wai H, Lafond J, Scaglione A, Moulines E. Decentralized Frank-Wolfe algorithm for convex and nonconvex problems. IEEE Trans Automat Contr. 2017;62(11):5522\u201337.","journal-title":"IEEE Trans Automat Contr"}],"container-title":["Cognitive Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-025-10438-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12559-025-10438-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-025-10438-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T10:37:42Z","timestamp":1745663862000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12559-025-10438-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,14]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["10438"],"URL":"https:\/\/doi.org\/10.1007\/s12559-025-10438-w","relation":{},"ISSN":["1866-9956","1866-9964"],"issn-type":[{"type":"print","value":"1866-9956"},{"type":"electronic","value":"1866-9964"}],"subject":[],"published":{"date-parts":[[2025,3,14]]},"assertion":[{"value":"6 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"This manuscript does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"78"}}