Toward Byzantine-Robust Distributed Learning for Sentiment Classification on Social Media Platform

被引:1
|
作者
Zhang, Heyi [1 ]
Wu, Jun [2 ]
Pan, Qianqian [3 ]
Bashir, Ali Kashif [4 ,5 ,6 ]
Omar, Marwan [7 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Elect Informat & Elect Engn, Shanghai 200240, Peoples R China
[2] Waseda Univ, Grad Sch Informat Prod & Syst, Tokyo 1698050, Japan
[3] Univ Tokyo, Sch Engn, Tokyo 1130033, Japan
[4] Manchester Metropolitan Univ, Dept Comp & Math, Manchester M15 6BH, England
[5] Woxsen Univ, Woxsen Sch Business, Hyderabad 502345, India
[6] Lebanese Amer Univ, Dept Comp Sci & Math, Beirut 11022801, Lebanon
[7] Illinois Inst Technol, Dept Informat Technol & Management, Chicago, IL 60616 USA
基金
中国国家自然科学基金;
关键词
Blockchains; Training; Blockchain; Byzantine robust; coded computing; distributed learning; sentiment classification; social media platform; BLOCKCHAIN;
D O I
10.1109/TCSS.2024.3361465
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Distributed learning empowers social media platforms to handle massive data for image sentiment classification and deliver intelligent services. However, with the increase of privacy threats and malicious activities, three major challenges are emerging: securing privacy, alleviating straggler problems, and mitigating Byzantine attacks. Although recent studies explore coded computing for privacy and straggler problems, as well as Byzantine-robust aggregation for poisoning attacks, they are not well-designed against both threats simultaneously. To tackle these obstacles and achieve an efficient Byzantine-robust and straggler-resilient distributed learning framework, in this article, we present Byzantine-robust and cost-effective distributed machine learning (BCML), a codesign of coded computing and Byzantine-robust aggregation. To balance the Byzantine resilience and efficiency, we design a cosine-similarity-based Byzantine-robust aggregation method tailored for coded computing to filter out malicious gradients efficiently in real time. Furthermore, trust scores derived from similarity are published to the blockchain for the reliability and traceability of social users. Experimental results show that our BCML can tolerate Byzantine attacks without compromising convergence accuracy with lower time consumption, compared with the state-of-the-art approaches. Specifically, it is 6x faster than the uncoded approach and 2x faster than the Lagrange coded computing (LCC) approach. Besides, the cosine-similarity-based aggregation method can effectively detect and filter out malicious social users in real time.
引用
收藏
页码:1 / 11
页数:11
相关论文
共 50 条
  • [21] Byzantine-robust and efficient distributed sparsity learning: a surrogate composite quantile regression approach
    Chen, Canyi
    Zhu, Zhengtian
    STATISTICS AND COMPUTING, 2024, 34 (05)
  • [22] RSA: Byzantine-Robust Stochastic Aggregation Methods for Distributed Learning from Heterogeneous Datasets
    Li, Liping
    Xu, Wei
    Chen, Tianyi
    Giannakis, Georgios B.
    Ling, Qing
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 1544 - 1551
  • [23] FedSuper: A Byzantine-Robust Federated Learning Under Supervision
    Zhao, Ping
    Jiang, Jin
    Zhang, Guanglin
    ACM TRANSACTIONS ON SENSOR NETWORKS, 2024, 20 (02)
  • [24] Byzantine-robust federated learning with ensemble incentive mechanism
    Zhao, Shihai
    Pu, Juncheng
    Fu, Xiaodong
    Liu, Li
    Dai, Fei
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2024, 159 : 272 - 283
  • [25] CareFL: Contribution Guided Byzantine-Robust Federated Learning
    Dong, Qihao
    Yang, Shengyuan
    Dai, Zhiyang
    Gao, Yansong
    Wang, Shang
    Cao, Yuan
    Fu, Anmin
    Susilo, Willy
    IEEE Transactions on Information Forensics and Security, 2024, 19 : 9714 - 9729
  • [26] Privacy-preserving Byzantine-robust federated learning
    Ma, Xu
    Zhou, Yuqing
    Wang, Laihua
    Miao, Meixia
    COMPUTER STANDARDS & INTERFACES, 2022, 80
  • [27] BOBA: Byzantine-Robust Federated Learning with Label Skewness
    Bao, Wenxuan
    Wu, Jun
    He, Jingrui
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 238, 2024, 238
  • [28] Towards Federated Learning with Byzantine-Robust Client Weighting
    Portnoy, Amit
    Tirosh, Yoav
    Hendler, Danny
    APPLIED SCIENCES-BASEL, 2022, 12 (17):
  • [29] Privacy-Preserving and Byzantine-Robust Federated Learning
    Dong, Caiqin
    Weng, Jian
    Li, Ming
    Liu, Jia-Nan
    Liu, Zhiquan
    Cheng, Yudan
    Yu, Shui
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2024, 21 (02) : 889 - 904
  • [30] Byzantine-Robust Federated Learning with Optimal Statistical Rates
    Zhu, Banghua
    Wang, Lun
    Pang, Qi
    Wang, Shuai
    Jiao, Jiantao
    Song, Dawn
    Jordan, Michael I.
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 206, 2023, 206