Generalized Correntropy based deep learning in presence of non-Gaussian noises

被引:27
|
作者
Chen, Liangjun [1 ]
Qu, Hua [1 ]
Zhao, Jihong [1 ,2 ]
机构
[1] Xi An Jiao Tong Univ, Sch Elect & Informat Engn, Xian 710049, Shaanxi, Peoples R China
[2] Xian Univ Posts & Telecommun, Sch Telecommun & Informat Engn, Xian 710061, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Deep learning; Generalized Correntropy; Stacked autoencoders; Non-Gaussian noise; Network traffic classification; MAXIMUM; ALGORITHM;
D O I
10.1016/j.neucom.2017.06.080
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Deep learning algorithms are the hottest topics in machine learning area lately. Although deep learning has made great progress in many domains, the robustness of learning systems with deep architectures is still rarely studied and needs further investigation. For instance, the impulsive noises (or outliers) are pervasive in real world data and can badly influence the mean square error (MSE) cost function based deep learning algorithms. Correntropy based loss function, which uses Gaussian kernel, is widely utilized to reject the above noises, however, the effect is not satisfactory. Therefore, generalized Correntropy (GC) is put forward to further improve the robustness, which uses generalized Gaussian density (GGD) function as kernel. GC can achieve extra flexibility through the GC parameters, which control the behavior of the induced metric, and shows a markedly better robustness than Correntropy. Motivated by the enhanced robustness of GC, we propose a new robust algorithm named generalized Correntropy based stacked autoencoder (GC-SAE), which is developed by combining the GC and stacked autoencoder (SAE). The new algorithms can extract useful features from the data corrupted by impulsive noises (or outliers) in a more effective way. The good robustness of the proposed method is confirmed by the experimental results on MNIST benchmark dataset. Furthermore, we show how our model can be applied for robust network classification, based on Moore network data of 377,526 samples with 12 classes. (C) 2017 Elsevier B. V. All rights reserved.
引用
收藏
页码:41 / 50
页数:10
相关论文
共 50 条
  • [41] Learning linear non-Gaussian causal models in the presence of latent variables
    Salehkaleybar, Saber
    Ghassami, AmirEmad
    Kiyavash, Negar
    Zhang, Kun
    Journal of Machine Learning Research, 2020, 21
  • [42] Iterated maximum correntropy unscented Kalman filters for non-Gaussian systems
    Wang, Guoqing
    Zhang, Yonggang
    Wang, Xiaodong
    SIGNAL PROCESSING, 2019, 163 : 87 - 94
  • [43] A Gaussian Mixture Smoother for Markovian Jump Linear Systems with non-Gaussian Noises
    Yang, Yanbo
    Qin, Yuemei
    Yang, Yanting
    Pan, Quan
    Li, Zhi
    2018 21ST INTERNATIONAL CONFERENCE ON INFORMATION FUSION (FUSION), 2018, : 2564 - 2571
  • [44] The phenomena of an intracellular calcium oscillation system with non-Gaussian noises
    Lin, Ling
    Duan, Wei-Long
    CHAOS SOLITONS & FRACTALS, 2015, 77 : 132 - 137
  • [45] PHASE DETECTION OF RANDOM SIGNALS ON A BACKGROUND OF NON-GAUSSIAN NOISES
    RYBIN, AK
    ENGINEERING CYBERNETICS, 1976, 14 (04): : 120 - 132
  • [46] On the role of non-Gaussian noises on noise-induced phenomena
    Wio, H
    NONEXTENSIVE ENTROPY: INTERDISCIPLINARY APPLICATIONS, 2003, : 177 - 193
  • [47] Sequential fusion estimation for multisensor systems with non-Gaussian noises
    Liping YAN
    Chenying DI
    Q.M.Jonathan WU
    Yuanqing XIA
    Science China(Information Sciences), 2020, 63 (12) : 153 - 165
  • [48] Bayesian wavelet denoising: Besov priors and non-Gaussian noises
    Leporini, D
    Pesquet, JC
    SIGNAL PROCESSING, 2001, 81 (01) : 55 - 67
  • [49] Sequential fusion estimation for multisensor systems with non-Gaussian noises
    Liping Yan
    Chenying Di
    Q. M. Jonathan Wu
    Yuanqing Xia
    Science China Information Sciences, 2020, 63
  • [50] POSTDETECTION OF WEAK SIGNALS IN NON-GAUSSIAN NOISES BY THE PHASE METHOD
    VOSHCHENKO, VS
    NIKITIN, YY
    FILIMONOV, RP
    RADIOTEKHNIKA I ELEKTRONIKA, 1990, 35 (10): : 2072 - 2080