arXiv:2607. 03515v1 Announce Type: cross Abstract: In many machine learning applications, the most relevant items for a query should be efficiently retrieved.
arXiv:2608. 16628v1 Announce Type: new Abstract: Modern Multimodal Retrieval-Augmented Generation (M-RAG) systems are fundamentally limited by the binary connectivity paradigm of traditional simple graphs, which fails to capture the intricate, high-order correlations among heterogeneous entities, such as the N-ary relationships between a visual chart, its scattered textual descriptions, and underlying numerical data.
arXiv:2605. 01965v2 Announce Type: replace Abstract: A classical vector retrieval problem typically considers a \emph{single} query embedding vector as input and retrieves the most similar embedding vectors from a vector database.
arXiv:2606. 17910v1 Announce Type: cross Abstract: Dense retrieval has become the dominant paradigm in information retrieval, in which each document is scored against a query by the inner product of their vector embeddings, and the top-$k$ documents by score are retrieved for this query.
arXiv:2608. 05724v1 Announce Type: cross Abstract: Sparse word embedding pipelines can avoid dense co-occurrence matrix materialization, dense factorization, and gradient training while still relying on sparse global corpus statistics.
arXiv:2505. 17810v2 Announce Type: replace Abstract: Approximate nearest neighbor (ANN) search is a performance-critical component of many machine learning pipelines, and rigorous benchmarking is essential for assessing the performance of vector indexes for ANN search.
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.
Sparse word embedding pipelines can avoid dense co-occurrence matrix materialization, dense factorization, and gradient training while still relying on sparse global corpus statistics. This paper studies Random Indexing (RI) vectors refined by weighted averaging on a sparse Positive Pointwise Mutual Information (PPMI) graph.
arXiv:2603. 24925v2 Announce Type: replace Abstract: Retrieval-augmented generation (RAG) systems that rely on semantic search often fail to retrieve the complete set of evidence for complex queries, particularly when information is distributed across multiple sources.
arXiv:2605. 30120v3 Announce Type: replace-cross Abstract: Multi-vector retrieval (MVR) models, exemplified by ColBERT, have established new benchmarks in retrieval accuracy by preserving fine-grained token-level interactions.
arXiv:2606. 28330v1 Announce Type: cross Abstract: Embedding-based retrieval systems rely on the assumption that geometric proximity in highdimensional representation spaces reflects semantic relevance.
Sparse Coverage is an unsupervised semantic retrieval framework designed for patent prior‑art search. It maps local span embeddings to a sparse vocabulary of embedding‑space centers chosen via a coverage‑oriented k‑center objective, allowing spans to activate nearby centers and produce sparse representations that work with inverted‑index retrieval. Experiments on CLEF‑IP 2013 demonstrate that Sparse Coverage matches or surpasses dense patent encoders in document‑level recall while remaining competitive at the passage level, making it an effective first‑stage retrieval approach for patent search.