Adversarially robust generalization from network crowd noisy labels

被引:0
|
作者
Ma, Chicheng [1 ]
Chen, Pengpeng [2 ]
Li, Wenfa [1 ]
Zhang, Xueyang [3 ]
Zhang, Yirui [1 ]
机构
[1] Univ Sci & Technol Beijing, Beijing, Peoples R China
[2] Aviat Syst Engn Inst China, Beijing, Peoples R China
[3] Jibei Siji Technol Co LTD, Beijing, Peoples R China
关键词
Learning from crowds; Crowdsourcing; Adversarial generalization; Network communications; INFERENCE; COLLUSION;
D O I
10.1016/j.aej.2024.11.070
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Learning from Crowds, also known as LFC, attempts to produce a decent classifier using training instances linked with a range of possibly noisy annotations supplied by crowdsourcing workers with varying personal preconditions. This process often relies heavily on network communications to facilitate the collection and aggregation of these annotations, as data needs to be transmitted between workers, the crowdsourcing platform, and the machine learning system. Recent research on LFC has concentrated on enhancing the performance of classifiers learned using crowdsourced labeled data. Nevertheless, there are still unanswered questions about the adversarial generalization of LFC systems. We further bridge this gap in this work. In an adversarial environment, we formulate the problem of adversarially robust generalization from crowd noisy labels and propose a novel approach, GENIUS, to bolster classifier resilience against adversarial instances. We conduct a comprehensive evaluation of GENIUS on two open and highly adopted benchmark datasets, MGC and Sentiment, demonstrating its superiority over current state-of-the-art methods in the scenarios of white-box and black-box attacks.
引用
收藏
页码:711 / 718
页数:8
相关论文
共 50 条
  • [1] Rademacher Complexity for Adversarially Robust Generalization
    Yin, Dong
    Ramchandran, Kannan
    Bartlett, Peter
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [2] Improved Generalization Bounds for Adversarially Robust Learning
    Attias, Idan
    Kontorovich, Aryeh
    Mansour, Yishay
    JOURNAL OF MACHINE LEARNING RESEARCH, 2022, 23
  • [3] Improved Generalization Bounds for Adversarially Robust Learning
    Attias, Idan
    Kontorovich, Aryeh
    Mansour, Yishay
    Journal of Machine Learning Research, 2022, 23
  • [4] Adversarially Robust Generalization Requires More Data
    Schmidt, Ludwig
    Santurkar, Shibani
    Tsipras, Dimitris
    Talwar, Kunal
    Madry, Aleksander
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [5] Relating Adversarially Robust Generalization to Flat Minima
    Stutz, David
    Hein, Matthias
    Schiele, Bernt
    2021 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2021), 2021, : 7787 - 7797
  • [6] Learning a Single Network for Robust Medical Image Segmentation With Noisy Labels
    Ye, Shuquan
    Xu, Yan
    Chen, Dongdong
    Han, Songfang
    Liao, Jing
    IEEE TRANSACTIONS ON MEDICAL IMAGING, 2024, 43 (09) : 3188 - 3199
  • [7] Distributionally Robust Federated Learning for Network Traffic Classification With Noisy Labels
    Shi, Siping
    Guo, Yingya
    Wang, Dan
    Zhu, Yifei
    Han, Zhu
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2024, 23 (05) : 6212 - 6226
  • [8] Robust Federated Learning With Noisy Labels
    Yang, Seunghan
    Park, Hyoungseob
    Byun, Junyoung
    Kim, Changick
    IEEE INTELLIGENT SYSTEMS, 2022, 37 (02) : 35 - 43
  • [9] Robust Collaborative Learning with Noisy Labels
    Sun, Mengying
    Xing, Jing
    Chen, Bin
    Zhou, Jiayu
    20TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2020), 2020, : 1274 - 1279
  • [10] Learning from Noisy Complementary Labels with Robust Loss Functions
    Ishiguro, Hiroki
    Ishida, Takashi
    Sugiyama, Masashi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2022, E105D (02) : 364 - 376