112 citations · 386 across the 16 of their papers we have counts for
4 papers · 1 filter
Pairing Clustered Inverted Indexes with kNN Graphs for Fast Approximate Retrieval over Learned Sparse Representations
Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli +1
Learned sparse representations form an effective and interpretable class of embeddings for text retrieval. While exact top-k retrieval over such embeddings faces efficiency challen…
Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search
Sebastian Bruch, Aditya Krishnan, Franco Maria Nardini
Clustering-based nearest neighbor search is an effective method in which points are partitioned into geometric shards to form an index, with only a few shards searched during query…
Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations
Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli +1
Learned sparse representations form an attractive class of contextual embeddings for text retrieval. That is so because they are effective models of relevance and are interpretable…
A Learning-to-Rank Formulation of Clustering-Based Approximate Nearest Neighbor Search
Thomas Vecchiato, Claudio Lucchese, Franco Maria Nardini +1
A critical piece of the modern information retrieval puzzle is approximate nearest neighbor search. Its objective is to return a set of data points that are closest to a query…