{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:08:49Z","timestamp":1740100129831,"version":"3.37.3"},"reference-count":19,"publisher":"IEEE","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1708906,ECCS-1809833"],"award-info":[{"award-number":["ECCS-1708906,ECCS-1809833"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,5,25]]},"DOI":"10.23919\/acc50511.2021.9482667","type":"proceedings-article","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T20:29:16Z","timestamp":1627504156000},"page":"2260-2265","source":"Crossref","is-referenced-by-count":0,"title":["Byzantine-resilient distributed learning under constraints"],"prefix":"10.23919","author":[{"given":"Dongsheng","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohan","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihailo R.","family":"Jovanovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2200\/S00271ED1V01Y201006CNT007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3219617.3219655"},{"key":"ref12","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","author":"yin","year":"0","journal-title":"International Conference on Machine Learning"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3309697.3331499"},{"key":"ref14","first-page":"4618","article-title":"Byzantine stochastic gradient descent","author":"alistarh","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029491"},{"key":"ref16","first-page":"1704","article-title":"On equivalence of martingale tail bounds and deterministic regret inequalities","volume":"65","author":"rakhlin","year":"0","journal-title":"Proceedings of the Conference on Learning Theory"},{"journal-title":"Nonlinear Programming","year":"2016","author":"bertsekas","key":"ref17"},{"journal-title":"Online primal-dual mirror descent under stochastic constraints","year":"2019","author":"wei","key":"ref18"},{"key":"ref19","first-page":"165","article-title":"Optimal distributed online prediction using mini-batches","volume":"13","author":"dekel","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/16M1059011"},{"key":"ref3","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":"ref6","first-page":"1428","article-title":"Online convex optimization with stochastic constraints","author":"yu","year":"0","journal-title":"Advances in neural information processing systems"},{"journal-title":"A primal-dual parallel method with $O(1\/\\epsilon)$ convergence for constrained composite convex programs","year":"2017","author":"yu","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394209"},{"key":"ref7","first-page":"6137","article-title":"Online convex optimization for cumulative constraints","author":"yuan","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s13748-012-0035-5"},{"journal-title":"Federated learning Strategies for improving communication efficiency","year":"2016","author":"konecn?","key":"ref1"},{"key":"ref9","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":"Journal of Machine Learning Research"}],"event":{"name":"2021 American Control Conference (ACC)","start":{"date-parts":[[2021,5,25]]},"location":"New Orleans, LA, USA","end":{"date-parts":[[2021,5,28]]}},"container-title":["2021 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9482409\/9482614\/09482667.pdf?arnumber=9482667","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T10:50:23Z","timestamp":1633517423000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9482667\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,25]]},"references-count":19,"URL":"https:\/\/doi.org\/10.23919\/acc50511.2021.9482667","relation":{},"subject":[],"published":{"date-parts":[[2021,5,25]]}}}