FN
Franco Maria Nardini
cs.IRcs.LGcs.AIcs.CLcs.DBcs.DCcs.DScs.HCcs.PFcs.CV
On Valency
published · living versionsW_wbna4w8u·v1 · currentpublished
Modular and Efficient Approximate Nearest Neighbors Search with Vectorium and kANNolo
with Silvio Martinico, Cosimo Rulli, Rossano Venturini
1 version
W_yqfbn3ae·v2published
W_9xettkzm·v1published
Preprints & journals
42 papers in the corpus · 2011–2026On the Token Collapse Phenomenon in Textual Graph Soft Prompting2610.31572v1 · Andrea Giuseppe Di Francesco, Rishabh Jain, Franco Maria Nardini et al.2026 · 0 citationsarXivon Valency
Getting a GRIP on Graph-Based Search for Learned Sparse Retrieval2610.30425v1 · Vihan Lakshman, Franco Maria Nardini, Cosimo Rulli et al.2026 · 0 citationsarXiv
Compact and Efficient Indexes for Learned Sparse Retrieval2610.12300v1 · Franco Maria Nardini, Luca Rizzo, Cosimo Rulli et al.2026 · 0 citationsarXiv
PUMA: Post-Hoc Sparsification of Universal Multimodal Embeddings for Efficient Retrieval2608.25780v1 · Matteo Attimonelli, Alessandro De Bellis, Franco Maria Nardini et al.2026 · 0 citationsarXiv
Efficient Multivector Retrieval with Token-Aware Clustering and Hierarchical Indexing2604.28142v1 · Silvio Martinico, Franco Maria Nardini, Cosimo Rulli et al.2026 · 1 citationarXiv
Sparton: Fast and Memory-Efficient Triton Kernel for Learned Sparse Retrieval2603.25011v1 · Thong Nguyen, Cosimo Rulli, Franco Maria Nardini et al.2026 · 0 citationsarXiv
Forward Index Compression for Learned Sparse Retrieval2602.05445v1 · Sebastian Bruch, Martino Fontana, Franco Maria Nardini et al.2026 · 0 citationsarXiv
Multivector Reranking in the Era of Strong First-Stage Retrievers2601.05200v3 · Silvio Martinico, Franco Maria Nardini, Cosimo Rulli et al.2026 · 1 citationarXiv
Exact Nearest-Neighbor Search on Energy-Efficient FPGA Devices2510.16736v1 · Patrizio Dazzi, William Guglielmo, Franco Maria Nardini et al.2025 · 0 citationsarXiv
Blending Learning to Rank and Dense Representations for Efficient and Effective Cascades2510.16393v1 · Franco Maria Nardini, Raffaele Perego, Nicola Tonellotto et al.2025 · 0 citationsarXiv
Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets2509.24815v1 · Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli et al.2025 · 1 citationarXiv
Early-Exit Graph Neural Networks2505.18088v2 · Andrea Giuseppe Di Francesco, Maria Sofia Bucarelli, Franco Maria Nardini et al.2025 · 0 citationsarXiv
Efficient Conversational Search via Topical Locality in Dense Retrieval2504.21507v1 · Cristina Ioana Muntean, Franco Maria Nardini, Raffaele Perego et al.2025 · 1 citationarXiv
Effective Inference-Free Retrieval for Learned Sparse Representations2505.01452v1 · Franco Maria Nardini, Thong Nguyen, Cosimo Rulli et al.2025 · 7 citationsarXiv
Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasets2501.11628v1 · Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli et al.2025 · 9 citationsarXiv
kANNolo: Sweet and Smooth Approximate k-Nearest Neighbors Search2501.06121v2 · Leonardo Delfino, Domenico Erriquez, Silvio Martinico et al.2025 · 7 citationsProc. of the 47th European Conference on Information Retrieval (ECIR 2025), Part IV, pp. 400-406
Power- and Fragmentation-aware Online Scheduling for GPU Datacenters2412.17484v2 · Francesco Lettich, Emanuele Carlini, Franco Maria Nardini et al.2024 · 3 citations2025 IEEE 25th International Symposium on Cluster, Cloud and Internet Computing (CCGrid), pp. 43-52 (2025)
Rewriting Conversational Utterances with Instructed Large Language Models2410.07797v1 · Elnara Galimzhanova, Cristina Ioana Muntean, Franco Maria Nardini et al.2024 · 4 citations2023 IEEE/WIC International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)
Early Exit Strategies for Approximate k-NN Search in Dense Retrieval2408.04981v1 · Francesco Busolin, Claudio Lucchese, Franco Maria Nardini et al.2024 · 3 citationsarXiv
Pairing Clustered Inverted Indexes with kNN Graphs for Fast Approximate Retrieval over Learned Sparse Representations2408.04443v1 · Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli et al.2024 · 13 citationsarXiv
Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search2405.12207v4 · Sebastian Bruch, Aditya Krishnan, Franco Maria Nardini2024 · 2 citationsarXiv
Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations2404.18812v1 · Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli et al.2024 · 53 citationsarXiv
A Learning-to-Rank Formulation of Clustering-Based Approximate Nearest Neighbor Search2404.11731v1 · Thomas Vecchiato, Claudio Lucchese, Franco Maria Nardini et al.2024 · 4 citationsarXiv
Efficient Multi-Vector Dense Retrieval Using Bit Vectors2404.02805v1 · Franco Maria Nardini, Cosimo Rulli, Rossano Venturini2024 · 1 citationarXiv
Bridging Dense and Sparse Maximum Inner Product Search2309.09013v1 · Sebastian Bruch, Franco Maria Nardini, Amir Ingber et al.2023 · 9 citationsarXiv
Post-hoc Selection of Pareto-Optimal Solutions in Search and Recommendation2306.12165v1 · Vincenzo Paparella, Vito Walter Anelli, Franco Maria Nardini et al.2023 · 12 citationsarXiv
Neural Network Compression using Binarization and Few Full-Precision Weights2306.08960v2 · Franco Maria Nardini, Cosimo Rulli, Salvatore Trani et al.2023 · 2 citationsarXiv
Efficient and Effective Tree-based and Neural Learning to Rank2305.08680v1 · Sebastian Bruch, Claudio Lucchese, Franco Maria Nardini2023 · 21 citationsarXiv
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors2301.10622v1 · Sebastian Bruch, Franco Maria Nardini, Amir Ingber et al.2023 · 21 citationsarXiv
Caching Historical Embeddings in Conversational Search2211.14155v1 · Ophir Frieder, Ida Mele, Cristina Ioana Muntean et al.2022 · 13 citationsarXiv
ILMART: Interpretable Ranking with Constrained LambdaMART2206.00473v1 · Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando et al.2022 · 8 citationsarXiv
Distilled Neural Networks for Efficient Learning to Rank2202.10728v1 · F.M. Nardini, C. Rulli, S. Trani et al.2022 · 21 citationsarXiv
An Optimal Algorithm for Finding Champions in Tournament Graphs2111.13621v4 · Lorenzo Beretta, Franco Maria Nardini, Roberto Trani et al.2021 · 3 citationsarXiv
Learning Early Exit Strategies for Additive Ranking Ensembles2105.02568v1 · Francesco Busolin, Claudio Lucchese, Franco Maria Nardini et al.2021 · 6 citations44th International ACM SIGIR Conference on Research and Development in Information Retrieval, Association for Computing Machinery, 2021, 2217-2221
Dynamic Hard Pruning of Neural Networks at the Edge of the Internet2011.08545v3 · Lorenzo Valerio, Franco Maria Nardini, Andrea Passarella et al.2020 · 16 citationsarXiv
Query-level Early Exit for Additive Learning-to-Rank Ensembles2004.14641v1 · Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando et al.2020 · 4 citationsarXiv
Topic Propagation in Conversational Search2004.14054v1 · I. Mele, C. I. Muntean, F. M. Nardini et al.2020 · 27 citationsarXiv
Expansion via Prediction of Importance with Contextualization2004.14245v2 · Sean MacAvaney, Franco Maria Nardini, Raffaele Perego et al.2020 · 120 citationsarXiv
Efficient Document Re-Ranking for Transformers by Precomputing Term Representations2004.14255v2 · Sean MacAvaney, Franco Maria Nardini, Raffaele Perego et al.2020 · 119 citationsarXiv
Training Curricula for Open Domain Answer Re-Ranking2004.14269v2 · Sean MacAvaney, Franco Maria Nardini, Raffaele Perego et al.2020 · 17 citationsarXiv
Sentiment-enhanced Multidimensional Analysis of Online Social Networks: Perception of the Mediterranean Refugees Crisis1605.01895v1 · Mauro Coletto, Claudio Lucchese, Cristina Ioana Muntean et al.2016 · 30 citationsarXiv
Efficient Diversification of Web Search Results1105.4255v1 · Gabriele Capannini (ISTI CNR), Franco Maria Nardini (ISTI-CNR), Raffaele Perego (ISTI-CNR) et al.2011 · 4 citationsProceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 7, pp. 451-459 (2011)
Career total: 200 works. 42 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.