While the Platonic Representation Hypothesis posits that vision and language models converge toward compatible latent geometries, recovering class-level correspondences between unpaired modalities without cross-modal supervision remains challenging. Existing relational matching methods compare within-modality similarity kernels directly, although the same semantic structure may be represented through different numerical parameterizations across modalities. We propose RankAlign, a rank-based normalization strategy for class-level unpaired vision-language matching. RankAlign transforms each within-modality similarity kernel into an ordinal relational representation before permutation matching, while leaving the correspondence space and matching solver unchanged. The resulting representation is invariant to strictly increasing reparameterizations of similarity values while preserving the ordinal structure used for matching. We provide exact-recovery and stability guarantees that characterize correspondence recovery under both exact and partial ordinal agreement. Experiments across diverse frozen vision and language encoders and multiple datasets demonstrate improved and more stable class-level correspondence recovery, including under label corruption and domain shift.
Figures & tables
Figure 1: Visual-language alignment pipeline. The RankAlign module provides the core ordinal representation of each within-modality similarity kernel. These representations are refined using local neighbor order before permutation matching, without changing the matching space or solver.
Solver
Method
N=50
N=70
N=100
Matching accuracy
FAQ
BlindMatch
0.26 ± 0.10
0.14 ± 0.09
0.04 ± 0.02
RankAlign
0.98 ± 0.02
0.79 ± 0.05
0.66 ± 0.21
OT
BlindMatch
0.04 ± 0.01
0.02 ± 0.02
0.01 ± 0.01
RankAlign
0.98 ± 0.02
0.79 ± 0.05
0.69 ± 0.18
FHG
BlindMatch
0.77 ± 0.02
0.42 ± 0.07
0.15 ± 0.03
Table 1: Runtime and matching accuracy on CIFAR-100 across different problem sizes using CLIP as the vision encoder and Sentence-T as the language encoder. Results are reported as mean ± standard deviation over five random seeds. ∗ indicates that the solver reaches the 300s time limit. Actual wall-clock runtime may be slightly higher due to termination and post-processing overhead.
Figure 2: Matching accuracy as a function of problem size on CIFAR-100 and ImageNet-100. Each color corresponds to a vision backbone. For each backbone, the darker solid line denotes RankAlign , while the lighter dashed line denotes BlindMatch with GW .
Dataset
Metric
0.00
0.10
0.20
0.30
0.40
CIFAR-100
Acc. (%)
78.7 ± 7.3
78.0 ± 5.2
77.6 ± 5.8
73.1 ± 15.9
68.9 ± 6.4
Drop (%)
0.0
0.9
1.4
7.1
12.5
ImageNet-100
Acc. (%)
74.4 ± 5.4
71.0 ± 3.9
71.4 ± 5.4
56.6 ± 12.0
41.5 ± 10.3
Drop (%)
0.0
4.6
4.0
23.9
44.2
Table 2: Robustness under visual-side label corruption on CIFAR-100 and ImageNet-100. We report matching accuracy (%) as mean ± standard deviation over five random seeds and relative performance drop (%) with respect to the clean setting.
Vision model
BlindMatch
RankAlign
DINOv2
0.59 ± 0.29
0.96 ± 0.09
DeiT
0.72 ± 0.05
0.76 ± 0.09
CLIP
0.77 ± 0.13
0.68 ± 0.05
SigLIP
0.54 ± 0.13
0.79 ± 0.15
SigLIP2
0.61 ± 0.09
0.74 ± 0.11
Table 3: Matching accuracy on the LAION pseudo-class dataset. We compare BlindMatch ( GW ) with RankAlign across different visual backbones.
Vision model
BlindMatch
RankAlign
DeiT
0.08 ± 0.01
0.65 ± 0.01
DINOv2
0.06 ± 0.01
0.62 ± 0.30
CLIP
0.08 ± 0.01
0.63 ± 0.26
SigLIP
0.10 ± 0.02
0.45 ± 0.22
SigLIP2
0.08 ± 0.00
0.23 ± 0.04
Table 4: Matching performance on the CheXpert subset. We report matching accuracy across different vision backbones for BlindMatch ( GW ) and RankAlign .
Appendix figures & tables3 assets
Supplementary material from the paper’s appendix.
Appendix
Transformation
N=30
N=50
N=70
N=100
None
0.03
0.01
0.00
0.00
Z-score
0.03
0.02
0.01
0.00
Row-wise ranking
0.32
0.14
0.09
0.06
Quantile normalization
0.06
0.07
0.04
0.00
RankAlign
1.00
0.98
0.91
0.79
Appendix
Table 5: Kernel transformation ablation on CIFAR-100. All variants use the same prototypes, class subsets, encoders, kernels, and permutation solver, only the kernel transformation differs.
Model
Method
N=30
N=50
N=70
N=100
CLIP
Procrustes
0.01±0.02
0.03±0.01
0.02±0.02
0.00±0.00
Vanilla GW-OT
0.03±0.03
0.03±0.02
0.03±0.03
0.03±0.00
RankAlign
1.00±0.00
0.98±0.02
0.91±0.04
0.79±0.02
DeiT
Procrustes
0.04±0.04
0.02±0.01
0.02±0.01
0.01±0.00
Vanilla GW-OT
0.07±0.04
0.05±0.03
0.07±0.05
0.05±0.00
RankAlign
0.93±0.01
0.95±0.05
0.72±0.05
0.36±0.16
Appendix
Table 6: Comparison with classical structural alignment methods on CIFAR-100. All methods use the same class-level representations and matching instances. We report matching accuracy across problem sizes.
Figure 3: Full larger-scale matching results on CIFAR-100 and ImageNet-100 across all evaluated vision backbones.Each color corresponds to a vision backbone. The darker solid line denotes RankAlign , while the lighter dashed line denotes BlindMatch with the GW .
The Platonic Representation Hypothesis posits that neural networks trained on different modalities converge toward a shared statistical model of the world. Recent work exploits this convergence by aligning frozen pretrained vision and language models with lightweight alignment layers, but typically relies on contrastive losses and millions of paired samples. In this work, we ask whether meaningful alignment can be achieved with substantially less supervision. We introduce a semi-supervised setting in which pretrained unimodal encoders are aligned using a small number of image-text pairs together with large amounts of unpaired data. To address this challenge, we propose SOTAlign, a two-stage framework that first recovers a coarse shared geometry from limited paired data using a linear teacher, and then refines the alignment on unpaired samples via an optimal-transport-based divergence that transfers relational structure without overconstraining the target space. SOTAlign effectively leverages unpaired images and text, learning robust joint embeddings across datasets and encoder pairs, and significantly outperforming supervised and semi-supervised baselines. Code is available at https://github.com/ExplainableML/SOTAlign.
Simon Roschmann, Paul Krzakala, Sonia Mazelet +2
Helmholtz Munich · Technical University of Munich · Munich Center for Machine Learning +3
Vision-language dataset distillation (VLDD) compresses a large image-text paired dataset into a small set of synthetic pairs that can efficiently train contrastive vision-language models under strict data and compute budgets. Most existing methods match expert trajectories or cross-modal statistics, yet still enforce full-dimensional alignment in a Euclidean embedding space. This is often overly restrictive due to rank-deficient image--text correlation, with shared semantics concentrated in a low-dimensional range and remaining variation spread across a weakly correlated residual subspace. LoRS relaxes alignment at the similarity level by low-rank factorization, but does not explicitly control dominant alignment capacity and structure in the representation space. We thus propose a rank-aware hyperbolic alignment (RAHA) that combines hierarchical geometry with explicit alignment-capacity control. RAHA lifts multimodal representations to hyperbolic space and optimizes distilled pairs with asymmetric objectives that enforce geodesic alignment in the shared range while regularizing the residual subspace to preserve modality-private diversity and improve transfer robustness. Experiments on benchmarks show that RAHA demonstrates competitive cross-modal retrieval and improved transfer indicators under fixed budgets.
Jongoh Jeong, Sun-Kyung Lee, Kuk-Jin Yoon
Korea Advanced Institute of Science and Technology (KAIST), Republic of Korea · Electronics and Telecommunications Research Institute (ETRI), Republic of Korea
Multimodal Large Language Models (MLLMs) inherit rich relational priors from their language backbones, yet often fail when asked to apply these relationships in visual contexts. We trace this failure to a structural blind spot: projection-based alignment trains each visual token to carry the right semantics, but never asks whether the relationships between concepts survive the crossing from language to vision. To address this, we propose MIRROR (Mapping Inter-concept Relations from language to visual Representation via Optimal-transport-based Regularization), a geometric regularization framework that transfers relational priors from language to vision by exploiting the rich relational structure encoded in language representations. Specifically, we derive a surrogate loss from the proposed Semi-Inverse Gromov-Wasserstein (SI-GW) problem, an inverse geometric problem that aligns visual representations with language-derived relational priors. We show that this formulation admits a unique closed-form solution that prescribes the ideal visual relational structure implied by language geometry and cross-modal coupling. The structure of the formulation also enables efficient computation, making it applicable to long token sequences. Applying SI-GW inside decoder-only Transformers requires careful design. We introduce targeted strategies at the layer, head, and token levels to ensure stable extraction without additional parameters or inference cost. MIRROR improves relational consistency while preserving performance on general vision-language tasks.
Hong-Han Wang, Yuntao Wang, Hu Ding
University of Science and Technology of China, Hefei, China