{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:46:26Z","timestamp":1778607986448,"version":"3.51.4"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,9,27]]},"DOI":"10.1109\/allerton49937.2022.9929356","type":"proceedings-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T17:34:30Z","timestamp":1667583270000},"page":"1-8","source":"Crossref","is-referenced-by-count":9,"title":["Distributed Online Non-convex Optimization with Composite Regret"],"prefix":"10.1109","author":[{"given":"Zhanhong","family":"Jiang","sequence":"first","affiliation":[{"name":"Johnson Controls"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Balu","sequence":"additional","affiliation":[{"name":"Iowa State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xian Yeow","family":"Lee","sequence":"additional","affiliation":[{"name":"Iowa State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young M.","family":"Lee","sequence":"additional","affiliation":[{"name":"Johnson Controls"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chinmay","family":"Hegde","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soumik","family":"Sarkar","sequence":"additional","affiliation":[{"name":"Iowa State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2818081"},{"key":"ref32","article-title":"Distributed mirror descent for online composite optimization","author":"yuan","year":"2020","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref31","article-title":"Distributed online optimization with long-term constraints","author":"yuan","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2964200"},{"key":"ref35","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proceedings of the 20th International Conference on Machine Learning (ICML-03)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029474"},{"key":"ref10","first-page":"2933","article-title":"Distributed online op-timization over a heterogeneous network with any-batch mirror descent","author":"eshraghi","year":"2020","journal-title":"International Conference on Machine Learning"},{"key":"ref11","first-page":"235","article-title":"Online learning with non-convex losses and non-stationary re-gret","author":"gao","year":"2018","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref12","article-title":"Efficient regret minimization in non-convex games","author":"hazan","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2525928"},{"key":"ref15","first-page":"5904","article-title":"Collaborative deep learning in fixed topology networks","author":"jiang","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref16","article-title":"On the sublinear regret of distributed primal-dual algorithms for online constrained optimization","author":"lee","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref17","article-title":"Distributed online optimization for multi-agent networks with coupled inequality constraints","author":"li","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref18","article-title":"Online distributed optimization with nonconvex objective functions: Sublinear-ity of first-order optimality condition-based regret","author":"lu","year":"2021","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref19","first-page":"6200","article-title":"Decentralized online learning for noncoop-erative games in dynamic environments","author":"meng","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref28","article-title":"On distributed online convex optimization with sublinear dynamic regret and fit","author":"sharma","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref4","article-title":"Distributed and inexact proximal gradient method for online convex optimization","author":"bastianello","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref3","article-title":"A local regret in nonconvex online learning","author":"aydore","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref29","article-title":"Online non-convex learning: Following the perturbed leader is optimal","author":"suggala","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2880407"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3030743"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.109676"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2505149"},{"key":"ref9","first-page":"6","article-title":"Online optimization with gradual variations","author":"chiang","year":"2012","journal-title":"Conference on Learning Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.29007\/mmh3"},{"key":"ref20","article-title":"Decentralized nash equilibria learning for online game with bandit feedback","author":"meng","year":"2022","journal-title":"ArXiv Preprint"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2015.7172037"},{"key":"ref21","article-title":"Dadam: A consensus-based distributed adaptive gradient method for online optimization","author":"nazari","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref24","article-title":"Distributed constrained online learning","author":"paternain","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref23","volume":"87","author":"nesterov","year":"2013","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8618708"}],"event":{"name":"2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2022,9,27]]},"end":{"date-parts":[[2022,9,30]]}},"container-title":["2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9929313\/9929314\/09929356.pdf?arnumber=9929356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T15:25:39Z","timestamp":1669649139000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9929356\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,27]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/allerton49937.2022.9929356","relation":{},"subject":[],"published":{"date-parts":[[2022,9,27]]}}}