Hugging Face Trending Papers August 6, 2026

Mapping Similarity Spaces across Embedding Models with Synthetic Query Probing

Read the original on Hugging Face Trending Papers →

Retrieval-Augmented Generation systems rely on similarity scores to retrieve relevant content, yet scores are not directly comparable across embedding models due to differing geometric properties, complicating model migration and limiting threshold reuse. We study how similarity scores can be related by learning mappings between score distributions rather than embeddings.

Summary generated by The Flow from the publisher's feed. The full article lives at Hugging Face Trending Papers.

arXiv Machine Learning

Jul 7

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls

arXiv:2607. 03515v1 Announce Type: cross Abstract: In many machine learning applications, the most relevant items for a query should be efficiently retrieved.

By Kirill Shevkunov, Andrey Ploskonosov, Liudmila Prokhorenkova

rag

arXiv AI

Jul 1

How Can AI Find My Model? A Model-Finding Experimental Study Considering Data Formats, Embeddings, and Retrieval Strategies

arXiv:2606. 30846v1 Announce Type: new Abstract: Discovering simulation models for reuse remains a fundamental challenge in Modeling and Simulation (M&S).

By Jhon G. Botello, Jose J. Padilla, Erika Frydenlund, Krzysztof Rechowicz, Eric Weisel

llms rag

arXiv AI

Jul 28

Choosing a Text Embedding Model: A Practical Benchmarking and Decision Framework

arXiv:2607. 23507v1 Announce Type: cross Abstract: Choosing the right text embedding model is one of the most consequential -- and most frequently under-examined -- decisions in building a retrieval or search system, yet the model that tops a leaderboard is rarely the best choice for a given deployment.

By Madhav S Baidya

rag nlp benchmarks

arXiv Machine Learning

Jul 3

Embedding Inference Attack

arXiv:2607. 01276v1 Announce Type: cross Abstract: Embedding models are essential components of modern Information Retrieval (IR) systems, yet they are typically hidden behind APIs.

By Cedric Fitiavana Raelijohn, S\'ebastien Gambs, Jean-Francois Rajotte

llms rag

arXiv Machine Learning

Jun 15

Efficient Rationale-based Retrieval: On-policy Distillation from Generative Rerankers based on JEPA

arXiv:2604. 23336v3 Announce Type: replace-cross Abstract: Unlike traditional fact-based retrieval, rationale-based retrieval typically necessitates cross-encoding of query-document pairs using large language models, incurring substantial computational costs.

By Teng Chen, Sheng Xu, Feixiang Guo, Xiaoyu Wang, Qingqing Gu, Hongyan Li, Luo Ji

llms rag robotics efficiency benchmarks

Hugging Face Trending Papers

Jun 22

KaLM-Reranker-V1: Fast but Not Late Interaction for Compressed Document Reranking

As retrieval systems scale, high-quality reranking becomes increasingly important. However, most existing rerankers, whether encoder-based or decoder-based, jointly encode the query and passage, tightly coupling their computation and limiting deployment efficiency as well as flexibility.

rag benchmarks

Related stories

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls

How Can AI Find My Model? A Model-Finding Experimental Study Considering Data Formats, Embeddings, and Retrieval Strategies

Choosing a Text Embedding Model: A Practical Benchmarking and Decision Framework

Embedding Inference Attack

Efficient Rationale-based Retrieval: On-policy Distillation from Generative Rerankers based on JEPA

KaLM-Reranker-V1: Fast but Not Late Interaction for Compressed Document Reranking