Beir
PulseAugur coverage of Beir — every cluster mentioning Beir across labs, papers, and developer communities, ranked by signal.
5 day(s) with sentiment data
-
New models unify sparse and dense multimodal embeddings, boosting search efficiency
Researchers have introduced UEmbed, a novel decoder-only multimodal embedding model capable of generating both sparse lexical and dense representations within a single causal forward pass. This model aims to unify spars…
-
Hyperbolic geometry retrieval system enables RAG on edge devices
Researchers have developed a novel hybrid retrieval system that leverages hyperbolic geometry for retrieval-augmented generation (RAG) on edge devices. This system projects word embeddings into hyperbolic space, allowin…
-
New CE-QE method enhances lexical retrieval by grounding in semantic evidence
Researchers have developed a new method called Cross-Encoder Query Expansion (CE-QE) to improve information retrieval systems. This technique addresses the limitation of traditional lexical retrieval methods like BM25, …
-
New RAG defense frameworks combat data poisoning attacks · 3 sources tracked
Researchers have developed new defense frameworks to protect Retrieval-Augmented Generation (RAG) systems from data poisoning attacks. RAGuard, presented in two papers, employs a layered approach including adversarial r…
-
PLAID-PRF enhances dense retrieval with centroid-aware pseudo-relevance feedback
Researchers have introduced PLAID-PRF, a novel method for enhancing multi-vector dense retrieval models like ColBERT. This technique leverages centroid-like tokens within the PLAID framework to perform Pseudo-Relevance …
-
KaLM-Reranker-V1: Efficient Document Reranking Model Unveiled
Researchers have introduced KaLM-Reranker-V1, a novel document reranking model designed for efficiency and flexibility in retrieval systems. This model decouples query and passage computation, allowing for faster proces…
-
TileMaxSim kernel boosts GPU retrieval model speed by 220x
Researchers have developed TileMaxSim, a new IO-aware kernel for GPUs designed to significantly accelerate the MaxSim scoring process used in multi-vector retrieval models like ColBERT. Existing implementations are inef…
-
DREAM paper proposes autoregressive modeling for dense retrieval training
Researchers have developed DREAM (Dense Retrieval Embeddings via Autoregressive Modeling), a novel method for training dense retrieval systems. Unlike traditional methods that rely on costly labeled data, DREAM leverage…
-
AI agents fail due to flawed search index distribution, not prompting
A common issue in AI agents is that their search results appear correct but lead to factually wrong answers due to problems with the underlying search index. This is not a prompting issue but a distribution problem, whe…
-
KaLM-Reranker-V1: Efficient Document Reranking Model Unveiled
Researchers have introduced KaLM-Reranker-V1, a novel reranking model designed for efficiency in large-scale retrieval systems. This model decouples query and passage computation using an encoder-decoder architecture wi…
-
HAKARI-Bench offers lightweight evaluation for retrieval models · 2 sources tracked
Researchers have introduced HAKARI-Bench, a lightweight benchmark designed to streamline the evaluation of retrieval architectures and efficiency settings for retrieval-augmented generation and semantic search. This new…
-
New multilingual reranker models trained efficiently for diverse tasks
Researchers have developed Querit-Reranker, a new family of multilingual cross-encoder rerankers designed for efficient adaptation to various ranking tasks without requiring extensive labeled data. The models are traine…
-
New ADORE framework improves LLM query expansion with iterative feedback
Researchers have introduced ADORE, an iterative framework designed to enhance Large Language Model (LLM)-based query expansion for information retrieval. Unlike generation-driven methods that can lead to retrieval drift…
-
CompRank framework boosts LLM reranking efficiency
Researchers have developed CompRank, a new framework designed to make large language model (LLM) rerankers more computationally efficient for information retrieval tasks. CompRank achieves this by reducing redundant com…
-
STORM framework enhances lexical query expansion for retrieval
Researchers have developed STORM, a self-supervised framework for lexical query expansion that improves information retrieval. This method uses a reward-guided beam search to optimize token generation, making it more ef…
-
New ECI method ranks hard-negatives for dense retrieval without training
Researchers have developed a new training-free method called Effective Contrastive Information (ECI) to evaluate hard-negative sources for dense retrieval systems. This technique ranks candidate negatives using frozen e…
-
New methods enhance search result reranking with adaptive and long-context AI
Researchers have developed new methods to improve the reranking of search results, particularly in zero-resource scenarios where traditional supervised training is not feasible. One approach, DART, adapts a scoring func…
-
Google Embeddings 2 leads retrieval benchmarks but lags in speed
A new paper benchmarks Google Embeddings 2 (GE2) against several open-source models for multilingual dense retrieval and RAG systems. GE2 achieved top performance across multiple tasks, including BEIR and an Italian RAG…
-
New DIVE method compresses LLM embeddings for efficient vector search
Researchers have developed DIVE, a new method for compressing high-dimensional embeddings from large language models to reduce storage and computational costs in vector search systems. DIVE employs a self-limiting tripl…
-
Deduplication in RAG systems cuts context size without quality loss
A new preprint details an empirical analysis of byte-exact deduplication in Retrieval-Augmented Generation (RAG) systems. The study found significant context reduction across academic, enterprise, and conversational AI …