arxiv
PublishedJuly 13, 2026 at 4:00 AM
—neutral
Similarity search generalisation in contrastive learning with InfoNCE loss
Publisher summary· verbatim
arXiv:2607.09405v1 Announce Type: new Abstract: Similarity search is a primary application of embedding models trained by contrastive learning. For one of the most popular contrastive learning loss functions, InfoNCE, we show that the population risk with $k$ negative samples is $O(1/k)$ close to an
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivThe Steering Budget: Examples beat Knobs1darxivPolestar: Drift-Aware Cache Calibration and Token Commitment for Efficient Inference of Diffusion LLMs1darxivRxBrain: Embodied Cognition Foundation Model with Joint Language-Visual Reasoning and Imagination1darxivHABIB_TAZ at SemEval-2026 Task 11: Disentangling Formal Logic from Content via Synthetic Training and Multi-Objective Optimization1dThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗