Deep Mutual Information Maximin for Cross-Modal Clustering


  • Yiqiao Mao Zhengzhou University
  • Xiaoqiang Yan Zhengzhou University
  • Qiang Guo Zhengzhou University
  • Yangdong Ye Zhengzhou University


Clustering, Unsupervised & Self-Supervised Learning, Multimodal Learning, (Deep) Neural Network Algorithms


Cross-modal clustering (CMC) aims to enhance the clustering performance by exploring complementary information from multiple modalities. However, the performances of existing CMC algorithms are still unsatisfactory due to the conflict of heterogeneous modalities and the high-dimensional non-linear property of individual modality. In this paper, a novel deep mutual information maximin (DMIM) method for cross-modal clustering is proposed to maximally preserve the shared information of multiple modalities while eliminating the superfluous information of individual modalities in an end-to-end manner. Specifically, a multi-modal shared encoder is firstly built to align the latent feature distributions by sharing parameters across modalities. Then, DMIM formulates the complementarity of multi-modalities representations as an mutual information maximin objective function, in which the shared information of multiple modalities and the superfluous information of individual modalities are identified by mutual information maximization and minimization respectively. To solve the DMIM objective function, we propose a variational optimization method to ensure it converge to a local optimal solution. Moreover, an auxiliary overclustering mechanism is employed to optimize the clustering structure by introducing more detailed clustering classes. Extensive experimental results demonstrate the superiority of DMIM method over the state-of-the-art cross-modal clustering methods on IAPR-TC12, ESP-Game, MIRFlickr and NUS-Wide datasets.




How to Cite

Mao, Y., Yan, X., Guo, Q., & Ye, Y. (2021). Deep Mutual Information Maximin for Cross-Modal Clustering. Proceedings of the AAAI Conference on Artificial Intelligence, 35(10), 8893-8901. Retrieved from



AAAI Technical Track on Machine Learning III