Principled Multimodal Representation Learning
Xiaohao Liu, Xiaobo Xia, See-Kiong Ng, Tat-Seng Chua
TL;DR
PMRL tackles the problem of aligning multiple modalities without fixed anchors by linking full multimodal alignment to a rank-1 Gram matrix. It introduces a principled objective that maximizes the leading singular value $\sigma_1$ of the multimodal representation matrix $\mathbf{Z}$ using a softmax over singular values, and augments this with instance-wise regularization over leading eigenvectors to prevent collapse. The approach is evaluated on diverse tasks, including text–video and text–audio retrieval and autism classification, demonstrating consistent gains over anchor-based and volume-based baselines and exhibiting robustness to noise. By reframing alignment as a rank-1, anchor-free problem and providing theoretical insights into Gram matrices and singular values, PMRL offers a scalable, interpretable framework for multimodal representation learning with strong practical impact.
Abstract
Multimodal representation learning seeks to create a unified representation space by integrating diverse data modalities to improve multimodal understanding. Traditional methods often depend on pairwise contrastive learning, which relies on a predefined anchor modality, restricting alignment across all modalities. Recent advances have investigated the simultaneous alignment of multiple modalities, yet several challenges remain, such as limitations imposed by fixed anchor points and instability arising from optimizing the product of singular values. To address the challenges, in this paper, we propose Principled Multimodal Representation Learning (PMRL), a novel framework that achieves simultaneous alignment of multiple modalities without anchor dependency in a more stable manner. Specifically, grounded in the theoretical insight that full alignment corresponds to a rank-1 Gram matrix, PMRL optimizes the dominant singular value of the representation matrix to align modalities along a shared leading direction. We propose a softmax-based loss function that treats singular values as logits to prioritize the largest singular value. Besides, instance-wise contrastive regularization on the leading eigenvectors maintains inter-instance separability and prevents representation collapse. Extensive experiments across diverse tasks demonstrate PMRL's superiority compared to baseline methods. The source code will be publicly available.
