DeepMoM: Robust Deep Learning With Median-of-Means

被引:1
|
作者
Huang, Shih-Ting [1 ]
Lederer, Johannes [1 ]
机构
[1] Ruhr Univ, Dept Math, Bochum, Germany
关键词
Deep learning; Median-of-means; Robust estimator;
D O I
10.1080/10618600.2022.2090947
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Data used in deep learning is notoriously problematic. For example, data are usually combined from diverse sources, rarely cleaned and vetted thoroughly, and sometimes corrupted on purpose. Intentional corruption that targets the weak spots of algorithms has been studied extensively under the label of "adversarial attacks." In contrast, the arguably much more common case of corruption that reflects the limited quality of data has been studied much less. Such "random" corruptions are due to measurement errors, unreliable sources, convenience sampling, and so forth. These kinds of corruption are common in deep learning, because data are rarely collected according to strict protocols-in strong contrast to the formalized data collection in some parts of classical statistics. This article concerns such corruption. We introduce an approach motivated by very recent insights into median-of-means and Le Cam's principle, we show that the approach can be readily implemented, and we demonstrate that it performs very well in practice. In conclusion, we believe that our approach is a very promising alternative to standard parameter training based on least-squares and cross-entropy loss.
引用
收藏
页码:181 / 195
页数:15
相关论文
共 50 条
  • [21] Robust Learning Algorithm Based on Iterative Least Median of Squares
    Rusiecki, Andrzej
    NEURAL PROCESSING LETTERS, 2012, 36 (02) : 145 - 160
  • [22] Robust Learning Algorithm Based on Iterative Least Median of Squares
    Andrzej Rusiecki
    Neural Processing Letters, 2012, 36 : 145 - 160
  • [23] Robust Embedded Deep K-means Clustering
    Zhang, Rui
    Tong, Hanghang
    Xia, Yinglong
    Zhu, Yada
    PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, : 1181 - 1190
  • [24] Adversarial Learning for Robust Deep Clustering
    Yang, Xu
    Deng, Cheng
    Wei, Kun
    Yan, Junchi
    Liu, Wei
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS (NEURIPS 2020), 2020, 33
  • [25] Deep Learning for Robust Vehicle Identification
    Ramajo Ballester, Alvaro
    Gonzalez Cepeda, Jacobo
    Armingol Moreno, Jose Maria
    ROBOT2022: FIFTH IBERIAN ROBOTICS CONFERENCE: ADVANCES IN ROBOTICS, VOL 1, 2023, 589 : 346 - 358
  • [26] An Introduction to Adversarially Robust Deep Learning
    Peck, Jonathan
    Goossens, Bart
    Saeys, Yvan
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2024, 46 (04) : 2071 - 2090
  • [27] Robust K-Median and K-Means Clustering Algorithms for Incomplete Data
    Li, Jinhua
    Song, Shiji
    Zhang, Yuli
    Zhou, Zhen
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2016, 2016
  • [28] Retrieval of aerosol optical thickness by means of the least-median-squares robust algorithm
    Oak Ridge National Laboratory, Environmental Sciences Division, Oak Ridge, TN 37831-6038, United States
    不详
    不详
    J. Aerosol Sci., 6 (805-817):
  • [29] Retrieval of aerosol optical thickness by means of the least-median-squares robust algorithm
    Cheng, MD
    Nash, TM
    Kopetz, SE
    JOURNAL OF AEROSOL SCIENCE, 1999, 30 (06) : 805 - 817
  • [30] A deep learning approach with data augmentation for median filtering forensics
    Wanli Dong
    Hui Zeng
    Yong Peng
    Xiaoming Gao
    Anjie Peng
    Multimedia Tools and Applications, 2022, 81 : 11087 - 11105