{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T14:04:09Z","timestamp":1730210649900,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T00:00:00Z","timestamp":1684886400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T00:00:00Z","timestamp":1684886400000},"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":[[2023,5,24]]},"DOI":"10.1109\/cscwd57460.2023.10152807","type":"proceedings-article","created":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T23:57:23Z","timestamp":1687564643000},"page":"1106-1111","source":"Crossref","is-referenced-by-count":0,"title":["A Framework Using Absolute Compression Hard-Threshold for Improving The Robustness of Federated Learning Model"],"prefix":"10.1109","author":[{"given":"Yuzhang","family":"Wu","sequence":"first","affiliation":[{"name":"Southeast University,School of Computer Science and Engineering,Nanjing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beilun","family":"Wang","sequence":"additional","affiliation":[{"name":"Southeast University,School of Computer Science and Engineering,Nanjing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Accurate, large minibatch sgd: Training imagenet in 1 hour","year":"2017","author":"Goyal","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref3","first-page":"5311","article-title":"Learning from history for byzantine robust optimization","volume-title":"International Conference on Machine Learning","author":"Karimireddy"},{"key":"ref4","first-page":"3521","article-title":"The hidden vulnerability of distributed learning in byzantium","volume-title":"International Conference on Machine Learning","author":"Guerraoui"},{"article-title":"Byzantine fault-tolerance in peer-to-peer distributed gradient-descent","year":"2021","author":"Gupta","key":"ref5"},{"article-title":"Variance reduction is an antidote to byzantines: Better rates, weaker assumptions and communication compression as a cherry on the top","year":"2022","author":"Gorbunov","key":"ref6"},{"key":"ref7","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume":"30","author":"Blanchard","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"article-title":"On biased compression for distributed learning","year":"2020","author":"Beznosikov","key":"ref8"},{"key":"ref9","first-page":"8133","article-title":"Rethinking gradient sparsification as total error minimization","volume":"34","author":"Sahu","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"3","key":"ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1961189.1961199","article-title":"Libsvm: a library for support vector machines","volume":"2","author":"Chang","year":"2011","journal-title":"ACM transactions on intelligent systems and technology (TIST)"},{"article-title":"Broadcast: Reducing both stochastic and compression noise to robustify communication-efficient federated learning","year":"2021","author":"Zhu","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00154"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3335772.3335936"},{"key":"ref14","article-title":"Byzantine stochastic gradient descent","volume":"31","author":"Alistarh","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref16","first-page":"3788","article-title":"Marina: Faster non-convex distributed learning with compression","volume-title":"International Conference on Machine Learning","author":"Gorbunov"},{"key":"ref17","article-title":"Asynchronous stochastic convex optimization: the noise is in the noise and sgd don\u2019t care","volume":"28","author":"Chaturapruek","year":"2015","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref18","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","volume-title":"International Conference on Machine Learning","author":"Koloskova"},{"article-title":"Federated learning: Strategies for improving communication efficiency","year":"2016","author":"Kone\u010dny","key":"ref19"},{"key":"ref20","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume-title":"International conference on machine learning","author":"Suresh"},{"key":"ref21","article-title":"Lag: Lazily aggregated gradient for communication-efficient distributed learning","volume":"31","author":"Chen","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref22","article-title":"Nearly tight sample complexity bounds for learning mixtures of gaussians via sample compression schemes","volume":"31","author":"Ashtiani","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref23","first-page":"297","article-title":"An efficient statistical-based gradient compression technique for distributed training systems","volume-title":"Proceedings of Machine Learning and Systems","volume":"3","author":"Abdelmoniem"},{"key":"ref24","first-page":"785","article-title":"Scaling distributed machine learning with {In-Network} Symposium aggregation","volume-title":"18th USENIX on Networked Systems Design and Implementation (NSDI 21)","author":"Sapio"},{"key":"ref25","first-page":"1737","article-title":"Deep learning with limited numerical precision","volume-title":"International conference on machine learning","author":"Gupta"},{"key":"ref26","article-title":"Sparsified sgd with memory","volume":"31","author":"Stich","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"article-title":"On the variance of the adaptive learning rate and beyond","year":"2019","author":"Liu","key":"ref27"},{"key":"ref28","article-title":"The step decay schedule: A near optimal, geometrically decaying learning rate procedure for least squares","volume":"32","author":"Ge","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"article-title":"Understanding top-k sparsification in distributed deep learning","year":"2019","author":"Shi","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1168\/2\/022022"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/VCIP.2018.8698609"},{"key":"ref32","first-page":"567","article-title":"Learning to label aerial images from noisy data","volume-title":"Proceedings of the 29th International conference on machine learning (ICML-12)","author":"Mnih"},{"key":"ref33","article-title":"Learning with noisy labels","volume":"26","author":"Natarajan","year":"2013","journal-title":"Advances in neural information processing systems"}],"event":{"name":"2023 26th International Conference on Computer Supported Cooperative Work in Design (CSCWD)","start":{"date-parts":[[2023,5,24]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2023,5,26]]}},"container-title":["2023 26th International Conference on Computer Supported Cooperative Work in Design (CSCWD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10152543\/10151991\/10152807.pdf?arnumber=10152807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T10:31:40Z","timestamp":1709289100000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10152807\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,24]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/cscwd57460.2023.10152807","relation":{},"subject":[],"published":{"date-parts":[[2023,5,24]]}}}