72 citations · 144 across the 5 of their papers we have counts for
8 papers
Learning Early Exit Strategies for Additive Ranking Ensembles
Francesco Busolin, Claudio Lucchese, Franco Maria Nardini +3
Modern search engine ranking pipelines are commonly based on large machine-learned ensembles of regression trees. We propose LEAR, a novel - learned - technique aimed to reduce the…
Efficient Document Re-Ranking for Transformers by Precomputing Term Representations
Sean MacAvaney, Franco Maria Nardini, Raffaele Perego +3
Deep pretrained transformer networks are effective at various ranking tasks, such as question answering and ad-hoc document ranking. However, their computational expenses deem them…
Training Curricula for Open Domain Answer Re-Ranking
Sean MacAvaney, Franco Maria Nardini, Raffaele Perego +3
In precision-oriented tasks like answer ranking, it is more important to rank many relevant answers highly than to retrieve all relevant answers. It follows that a good ranking str…
Expansion via Prediction of Importance with Contextualization
Sean MacAvaney, Franco Maria Nardini, Raffaele Perego +3
The identification of relevance with little textual context is a primary challenge in passage retrieval. We address this problem with a representation-based ranking approach that:…
Query-level Early Exit for Additive Learning-to-Rank Ensembles
Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando +2
Search engine ranking pipelines are commonly based on large ensembles of machine-learned decision trees. The tight constraints on query response time recently motivated researchers…
Topic Propagation in Conversational Search
I. Mele, C. I. Muntean, F. M. Nardini +3
In a conversational context, a user expresses her multi-faceted information need as a sequence of natural-language questions, i.e., utterances. Starting from a given topic, the con…