Dense text retrieval based on pretrained language models: A survey
Text retrieval is a long-standing research topic on information seeking, where a system is
required to return relevant information resources to user's queries in natural language. From …
required to return relevant information resources to user's queries in natural language. From …
Filtered-diskann: Graph algorithms for approximate nearest neighbor search with filters
As Approximate Nearest Neighbor Search (ANNS)-based dense retrieval becomes
ubiquitous for search and recommendation scenarios, efficiently answering filtered ANNS …
ubiquitous for search and recommendation scenarios, efficiently answering filtered ANNS …
{CXL-ANNS}:{Software-Hardware} collaborative memory disaggregation and computation for {Billion-Scale} approximate nearest neighbor search
J Jang, H Choi, H Bae, S Lee, M Kwon… - 2023 USENIX Annual …, 2023 - usenix.org
We propose CXL-ANNS, a software-hardware collaborative approach to enable highly
scalable approximate nearest neighbor search (ANNS) services. To this end, we first …
scalable approximate nearest neighbor search (ANNS) services. To this end, we first …
Manu: a cloud native vector database management system
With the development of learning-based embedding models, embedding vectors are widely
used for analyzing and searching unstructured data. As vector collections exceed billion …
used for analyzing and searching unstructured data. As vector collections exceed billion …
Cagra: Highly parallel graph construction and approximate nearest neighbor search for gpus
Approximate Nearest Neighbor Search (ANNS) plays a critical role in various disciplines
spanning data mining and artificial intelligence, from information retrieval and computer …
spanning data mining and artificial intelligence, from information retrieval and computer …
Idea: An invariant perspective for efficient domain adaptive image retrieval
In this paper, we investigate the problem of unsupervised domain adaptive hashing, which
leverage knowledge from a label-rich source domain to expedite learning to hash on a label …
leverage knowledge from a label-rich source domain to expedite learning to hash on a label …
Residual quantization with implicit neural codebooks
Vector quantization is a fundamental operation for data compression and vector search. To
obtain high accuracy, multi-codebook methods represent each vector using codewords …
obtain high accuracy, multi-codebook methods represent each vector using codewords …
An efficient and robust framework for approximate nearest neighbor search with attribute constraint
This paper introduces an efficient and robust framework for hybrid query (HQ) processing,
which combines approximate nearest neighbor search (ANNS) with attribute constraint. HQ …
which combines approximate nearest neighbor search (ANNS) with attribute constraint. HQ …
Overview of the SISAP 2024 Indexing Challenge
Abstract The SISAP 2024 Indexing Challenge invited replicable and competitive
approximate similarity search solutions for datasets of up to 100 million real-valued vectors …
approximate similarity search solutions for datasets of up to 100 million real-valued vectors …
Dedrift: Robust similarity search under content drift
D Baranchuk, M Douze… - Proceedings of the …, 2023 - openaccess.thecvf.com
The statistical distribution of content uploaded and searched on media sharing sites
changes over time due to seasonal, sociological and technical factors. We investigate the …
changes over time due to seasonal, sociological and technical factors. We investigate the …