llm-kb
← Back to research
Paper

InfoNCE loss generalizes similarity search with O(1/k) error bound

A new theoretical analysis shows that the InfoNCE loss, widely used in contrastive learning, yields a population risk that is O(1/k) close to an expected cross-entropy. This cross-entropy quantifies the deviation between softmax similarity search on unseen data using the learned embedding and an idealized search using the true similarity. The result provides a rigorous generalization guarantee for similarity search, a primary application of embedding models.

0 engagement·1 source·Fri, Jul 10, 2026, 01:37 PM
The paper, posted on arXiv on 2026-07-10, analyzes the InfoNCE loss with k negative samples. It proves that the population risk is O(1/k) close to an expected cross-entropy, which measures the gap between the learned softmax similarity search and an idealized one. This complements existing interpretations of InfoNCE in the limit as k → ∞. The finding is significant for practitioners using contrastive learning for retrieval, as it provides a theoretical foundation for the generalization of similarity search.

Entities

arXiv(tool)InfoNCE(concept)contrastive learning(concept)similarity search(concept)

Related

Paper

Neural Collapse Is Forbidden: Information Floors in Language Models

A new paper argues that within-class variance in language model representations is not incomplete neural collapse but allocated information storage obeying a law. Across 14 models, macro-category structure carries only 4-12% of representational variance, while within-token context carries 79-91%, stable across a 100x parameter range.

0 engagement·1 source·arxiv
Fri, Jul 10, 2026, 03:04 PM
arXiv
Paper

Researcher tests minimal dynamical system for word embeddings without MLP or attention

A researcher proposes a word representation model using only token vectors, a start state, and two scalars, with no MLP, transformer, attention, or output matrix. The model achieves a SimLex-999 ρ of 0.3616 by updating a state vector via a cosine-based pull toward token attractors, encoding context through trajectory dynamics.

0 engagement·1 source·reddit
Fri, Jul 10, 2026, 10:20 PM
Paper

Researchers identify asymmetric generalization problem in LLM unlearning benchmarks

A new arXiv paper argues that existing machine unlearning benchmarks for LLMs suffer from under-forgetting and over-forgetting due to an asymmetric generalization problem. The authors propose that evaluation must cover diverse query formulations of target facts to reliably measure knowledge removal while preserving unrelated capabilities.

0 engagement·1 source·arxiv
Fri, Jul 10, 2026, 09:31 AM
arXiv
Paper

Paper derives exact dynamics of linear representation learning in neural networks

A new arXiv paper presents exact solutions for how linear concept representations emerge during neural network training, providing a mathematical framework for the dynamics of abstraction. This work formalizes the linear representation hypothesis, which underpins interpretability methods like linear probes and activation steering, and could guide future training and control techniques.

0 engagement·1 source·arxiv
Thu, Jul 9, 2026, 06:04 PM
arXiv
Paper

Study questions robustness of emergent misalignment in language models

A new paper systematically studies repeated alignment and misalignment cycles in language models, reproducing Emergent Misalignment (EM) but finding that both misalignment and realignment are highly sensitive to superficial dataset characteristics. The results suggest that EM may not be a robust phenomenon.

0 engagement·1 source·arxiv
Fri, Jul 10, 2026, 02:50 AM
arXiv