Zobrazeno 1 - 10
of 164
pro vyhledávání: '"NARDINI, FRANCO MARIA"'
Autor:
Galimzhanova, Elnara, Muntean, Cristina Ioana, Nardini, Franco Maria, Perego, Raffaele, Rocchietti, Guido
Publikováno v:
2023 IEEE/WIC International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)
Many recent studies have shown the ability of large language models (LLMs) to achieve state-of-the-art performance on many NLP tasks, such as question answering, text summarization, coding, and translation. In some cases, the results provided by LLMs
Externí odkaz:
http://arxiv.org/abs/2410.07797
Autor:
Busolin, Francesco, Lucchese, Claudio, Nardini, Franco Maria, Orlando, Salvatore, Perego, Raffaele, Trani, Salvatore
Learned dense representations are a popular family of techniques for encoding queries and documents using high-dimensional embeddings, which enable retrieval by performing approximate k nearest-neighbors search (A-kNN). A popular technique for making
Externí odkaz:
http://arxiv.org/abs/2408.04981
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, hi
Externí odkaz:
http://arxiv.org/abs/2408.04443
Clustering-based nearest neighbor search is a simple yet effective method in which data points are partitioned into geometric shards to form an index, and only a few shards are searched during query processing to find an approximate set of top-$k$ ve
Externí odkaz:
http://arxiv.org/abs/2405.12207
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
Externí odkaz:
http://arxiv.org/abs/2404.18812
A critical piece of the modern information retrieval puzzle is approximate nearest neighbor search. Its objective is to return a set of $k$ data points that are closest to a query point, with its accuracy measured by the proportion of exact nearest n
Externí odkaz:
http://arxiv.org/abs/2404.11731
Dense retrieval techniques employ pre-trained large language models to build a high-dimensional representation of queries and passages. These representations compute the relevance of a passage w.r.t. to a query using efficient similarity measures. In
Externí odkaz:
http://arxiv.org/abs/2404.02805
Maximum inner product search (MIPS) over dense and sparse vectors have progressed independently in a bifurcated literature for decades; the latter is better known as top-$k$ retrieval in Information Retrieval. This duality exists because sparse and d
Externí odkaz:
http://arxiv.org/abs/2309.09013
Autor:
Paparella, Vincenzo, Anelli, Vito Walter, Nardini, Franco Maria, Perego, Raffaele, Di Noia, Tommaso
Information Retrieval (IR) and Recommender Systems (RS) tasks are moving from computing a ranking of final results based on a single metric to multi-objective problems. Solving these problems leads to a set of Pareto-optimal solutions, known as Paret
Externí odkaz:
http://arxiv.org/abs/2306.12165