Representation Alignment from a Few Paired Data via Distilled Optimal Transport

cs.AI updates on arXiv.org · 2h ago

arXiv:2610.12781v1 Announce Type: new Abstract: Aligning two independently pretrained unimodal encoders typically demands millions of paired examples. In this paper, we study the regime where only $N \sim 100$--$500$ pairs are available, while unpaired data on either side is abundant. Our method expresses every representation by its similarities to the $N$ paired anchors, which places both…

Read original article on cs.AI updates on arXiv.org →