Cosimo Rulli

Cosimo Rulli

Auto-generated profile, based on publicly available information

Cosimo Rulli

ISTI-CNR, Pisa, Italy

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 July 2024
Verified
Conference Paper
Open access
SBSebastian Bruch
Sebastian Bruch
FNFranco Maria Nardini
Franco Maria Nardini
CRCosimo Rulli
Cosimo Rulli
RVRossano Venturini
Rossano Venturini
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 by design. Despite their apparent compatibility with inverted indexes, however, retrieval over sparse embeddings remains challenging. That is due to the distributional differences between learned embeddings and term frequency-based lexical models of relevance such as BM25. Recognizing this challenge, a great deal of research has gone into, among other things, designing retrieval algorithms tailored to the properties of learned sparse representations, including approximate retrieval systems. In fact, this task featured prominently in the latest BigANN Challenge at NeurIPS 2023, where approximate algorithms were evaluated on a large benchmark dataset by throughput and recall. In this work, we propose a novel organization of the inverted index that enables fast yet effective approximate retrieval over learned sparse embeddings. Our approach organizes inverted lists into geometrically-cohesive blocks, each equipped with a summary vector. During query processing, we quickly determine if a block must be evaluated using the summaries. As we show experimentally, single-threaded query processing using our method, Seismic, reaches sub-millisecond per-query latency on various sparse embeddings of the MS MARCO dataset while maintaining high recall. Our results indicate that Seismic is one to two orders of magnitude faster than state-of-the-art inverted index-based solutions and further outperforms the winning (graph-based) submissions to the BigANN Challenge by a significant margin.

16 March 2024
Verified
Book Chapter
Closed access
PDF file
FNFranco Maria Nardini
Franco Maria Nardini
CRCosimo Rulli
Cosimo Rulli
RVRossano Venturini
Rossano Venturini

21 October 2024
Verified
Conference Paper
Open access
SBSebastian Bruch
Sebastian Bruch
FNFranco Maria Nardini
Franco Maria Nardini
CRCosimo Rulli
Cosimo Rulli
RVRossano Venturini
Rossano Venturini
Learned sparse representations form an effective and interpretable class of embeddings for text retrieval. While exact top-k retrieval over such embeddings faces efficiency challenges, a recent algorithm called Seismic has enabled remarkably fast, highly-accurate approximate retrieval. Seismic statically prunes inverted lists, organizes each list into geometrically-cohesive blocks, and augments each block with a summary vector. At query time, each inverted list associated with a query term is traversed one block at a time in an arbitrary order, with the inner product between the query and summaries determining if a block must be evaluated. When a block is deemed promising, its documents are fully evaluated with a forward index. Seismic is one to two orders of magnitude faster than state-of-the-art inverted index-based solutions and significantly outperforms the winning graph-based submissions to the BigANN 2023 Challenge. In this work, we speed up Seismic further by introducing two innovations to its query processing subroutine. First, we traverse blocks in order of importance, rather than arbitrarily. Second, we take the list of documents retrieved by Seismic and expand it to include the neighbors of each document using an offline k-regular nearest neighbor graph; the expanded list is then ranked to produce the final top-k set. Experiments on two public datasets show that our extension, named SeismicWave, can reach almost-exact accuracy levels and is up to 2.2x faster than Seismic.


13 July 2025
Verified
Conference Paper
Open access
FNFranco Maria Nardini
Franco Maria Nardini
TNThong Nguyen
Thong Nguyen
CRCosimo Rulli
Cosimo Rulli
RVRossano Venturini
Rossano Venturini
AYAndrew Yates
Andrew Yates

3 April 2025
Verified
Book Chapter
Closed access
PDF file
LDLeonardo Delfino
Leonardo Delfino
DEDomenico Erriquez
Domenico Erriquez
SMSilvio Martinico
Silvio Martinico
FNFranco Maria Nardini
Franco Maria Nardini
CRCosimo Rulli
Cosimo Rulli
RVRossano Venturini
Rossano Venturini