Stable and Fast Deep Mutual Information Maximization Based on Wasserstein Distance

被引:0
|
作者
He, Xing [1 ,2 ]
Peng, Changgen [3 ]
Wang, Lin [2 ]
Tan, Weijie [3 ]
Wang, Zifan [4 ]
机构
[1] Guizhou Univ, Coll Comp Sci & Technol, State Key Lab Publ Big Data, Guiyang 550025, Peoples R China
[2] Guizhou Minzu Univ, Guizhou Key Lab Pattern Recognit & Intelligent Sys, Guiyang 550025, Peoples R China
[3] Guizhou Univ, Guizhou Big Data Acad, Guiyang 550025, Peoples R China
[4] Inst Guizhou Aerosp Measuring & Testing Technol, Guiyang 550009, Peoples R China
关键词
machine learning; deep learning; unsupervised learning; encoder network; mutual information estimation; NONLINEAR DIMENSIONALITY REDUCTION; EIGENMAPS;
D O I
10.3390/e25121607
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Deep learning is one of the most exciting and promising techniques in the field of artificial intelligence (AI), which drives AI applications to be more intelligent and comprehensive. However, existing deep learning techniques usually require a large amount of expensive labeled data, which limit the application and development of deep learning techniques, and thus it is imperative to study unsupervised machine learning. The learning of deep representations by mutual information estimation and maximization (Deep InfoMax or DIM) method has achieved unprecedented results in the field of unsupervised learning. However, in the DIM method, to restrict the encoder to learn more normalized feature representations, an adversarial network learning method is used to make the encoder output consistent with a priori positively distributed data. As we know, the model training of the adversarial network learning method is difficult to converge, because there is a logarithmic function in the loss function of the cross-entropy measure, and the gradient of the model parameters is susceptible to the "gradient explosion" or "gradient disappearance" phenomena, which makes the training of the DIM method extremely unstable. In this regard, we propose a Wasserstein distance-based DIM method to solve the stability problem of model training, and our method is called the WDIM. Subsequently, the training stability of the WDIM method and the classification ability of unsupervised learning are verified on the CIFAR10, CIFAR100, and STL10 datasets. The experiments show that our proposed WDIM method is more stable to parameter updates, has faster model convergence, and at the same time, has almost the same accuracy as the DIM method on the classification task of unsupervised learning. Finally, we also propose a reflection of future research for the WDIM method, aiming to provide a research idea and direction for solving the image classification task with unsupervised learning.
引用
收藏
页数:16
相关论文
共 50 条
  • [21] Unsupervised deep representation learning for motor fault diagnosis by mutual information maximization
    Xiao, Dengyu
    Qin, Chengjin
    Yu, Honggan
    Huang, Yixiang
    Liu, Chengliang
    JOURNAL OF INTELLIGENT MANUFACTURING, 2021, 32 (02) : 377 - 391
  • [22] Deep Representation Debiasing via Mutual Information Minimization and Maximization (Student Abstract)
    Han, Ruijiang
    Wang, Wei
    Long, Yuxi
    Peng, Jiajie
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 12965 - 12966
  • [23] Unsupervised deep representation learning for motor fault diagnosis by mutual information maximization
    Dengyu Xiao
    Chengjin Qin
    Honggan Yu
    Yixiang Huang
    Chengliang Liu
    Journal of Intelligent Manufacturing, 2021, 32 : 377 - 391
  • [24] Image Retrieval with Text Feedback by Deep Hierarchical Attention Mutual Information Maximization
    Gu, Chunbin
    Bu, Jiajun
    Zhang, Zhen
    Yu, Zhi
    Ma, Dongfang
    Wang, Wei
    PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA, MM 2021, 2021, : 4600 - 4609
  • [25] Hybrid Wasserstein distance and fast distribution clustering
    Verdinelli, Isabella
    Wasserman, Larry
    ELECTRONIC JOURNAL OF STATISTICS, 2019, 13 (02): : 5088 - 5119
  • [26] Information-Maximization Clustering Based on Squared-Loss Mutual Information
    Sugiyama, Masashi
    Niu, Gang
    Yamada, Makoto
    Kimura, Manabu
    Hachiya, Hirotaka
    NEURAL COMPUTATION, 2014, 26 (01) : 84 - 131
  • [27] Statistical mechanics of mutual information maximization
    Urbanczik, R
    EUROPHYSICS LETTERS, 2000, 49 (05): : 685 - 691
  • [28] On feature extraction by mutual information maximization
    Torkkola, K
    2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 821 - 824
  • [29] Context formation by mutual information maximization
    Liu, Z
    Karam, LJ
    2002 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL III, PROCEEDINGS, 2002, : 89 - 92
  • [30] Competitive learning by mutual information maximization
    Kamimura, R
    Kamimura, T
    IJCNN'01: INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2001, : 926 - 931