Skip to content
NewA calmer, faster ZeroHour

Simplex embeddings cut the multimodal modality gap by 97–99%

Original title: Closing the Modality Gap via Simplex-Constrained Representations

arXiv cs.AI / cs.LG / cs.CLby Shubham Gupta ()1 min read1 · 1 read
AI summary · x-ai/grok-4.7Summaries by Vani AI

Softmax adapters and Total Variation similarity match or beat unconstrained retrieval on five benchmarks.

The paper proposes moving multimodal contrastive embeddings, as in models such as CLIP and CLAP, from the unit sphere to the probability simplex. Nonnegative unit-mass constraints are used as a shared coordinate system for both modalities. Lightweight softmax adapters and Total Variation similarity cut the centroid L2 gap by 97–99% on five retrieval benchmarks while matching or exceeding unconstrained retrieval.

Key facts
  • Embeddings move from the unit sphere to the probability simplex.
  • Both manifolds share the same intrinsic dimension.
  • The centroid L2 gap falls 97–99% on five benchmarks.
  • Retrieval matches or exceeds standard unconstrained models.
Explain this AI news with Vani AIWhat was announced, what is new and why it matters, in a new chat

From the original article

1 min read at arxiv.org

While multimodal contrastive models like CLIP and CLAP successfully learn shared representations, their embeddings typically exhibit a persistent \emph{modality gap}. We propose addressing this separation through a purely geometric approach: changing the embedding domain from the unit sphere, $S^{d-1}$, to the probability simplex, $Δ^{d-1}$.

arXiv cs.AI / cs.LG / cs.CL

By Shubham Gupta · arxiv.org

Read the full article at arXiv cs.AI / cs.LG / cs.CL

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.