Publications

Roegiest, Adam; Lipani, Aldo; Beutel, Alex; Olteanu, Alexandra; Lucic, Ana; Stoica, Ana-Andreea; Das, Anubrata; Biega, Asia; Voorn, Bart; Hauff, Claudia; Spina, Damiano; Lewis, David; Oard, Douglas W; Yilmaz, Emine; Hasibi, Faegheh; Kazai, Gabriella; McDonald, Graham; Haned, Hinda; Ounis, Iadh; van der Linden, Ilse; Garcia-Gathright, Jean; Baan, Joris; Lau, Kamuela N; Balog, Krisztian; de Rijke, Maarten; Sayed, Mahmoud; Panteli, Maria; Sanderson, Mark; Lease, Matthew; Ekstrand, Michael D; Lahoti, Preethi; Kamishima, Toshihiro

SIGIR Forum, 53 (2), pp. 20–43, 2019.

Links | BibTeX

Fixed-Cost Pooling Strategies

Journal Article

Lipani, Aldo; Losada, David E; Zuccon, Guido; Lupu, Mihai

IEEE Transactions on Knowledge and Data Engineering (TKDE), 2019.

Abstract | Links | BibTeX

From a User Model for Query Sessions to Session Rank Biased Precision (sRBP)

Inproceedings

Lipani, Aldo; Carterette, Ben; Yilmaz, Emine

Proc. of ICTIR, 2019.

Abstract | Links | BibTeX

Reply-aided Detection of Misinformation via Bayesian Deep Learning

Inproceedings

Zhang, Qiang; Lipani, Aldo; Liang, Shangsong; Yilmaz, Emine

Proc. of WWW, 2019.

Links | BibTeX

From Stances’ Imbalance to Their Hierarchical Representation and Detection

Inproceedings

Zhang, Qiang; Liang, Shangsong; Lipani, Aldo; Ren, Zhaochun; Yilmaz, Emine

Proc. of WWW, 2019.

Links | BibTeX

On Biases in Information Retrieval Models and Evaluation

Journal Article

Lipani, Aldo

SIGIR Forum, 52 (2), 2019.

Links | BibTeX

On the Learnability of Software Router Performance via CPU Measurements

Inproceedings

Shelbourne, Charles; Linguaglossa, Leonardo; Lipani, Aldo; Zhang, Tianzhu; Geyer, Fabien

Proc. of CoNEXT, pp. 23–25, Association for Computing Machinery, Orlando, FL, USA, 2019, ISBN: 9781450370066.

Links | BibTeX

On Biases in Information Retrieval Models and Evaluation

PhD Thesis

Lipani, Aldo

TU Wien, 2018.

Abstract | Links | BibTeX

@phdthesis{PhDLipani2018,
title = {On Biases in Information Retrieval Models and Evaluation},
author = {Aldo Lipani},
url = {http://aldolipani.com/wp-content/uploads/2018/09/phd_thesis.pdf},
doi = {10.13140/RG.2.2.28623.74400},
year = {2018},
date = {2018-09-21},
school = {TU Wien},
abstract = {The advent of the modern information technology has benefited society as the digitisation of content increased over the last half-century. While the processing capability of our species has remained unchanged, the information available to us has been notably increasing. In this overload of information, Information Retrieval (IR) has been playing a prominent role by developing systems capable of separating relevant information from the rest. This separation, however, is a difficult task rooted in the complexity of understanding of what is and what is not relevant. To manage this complexity, IR has developed a strong empirical nature, which has led to the development of grounded retrieval models, resulting in the development of retrieval systems empirically designed to be biased towards relevant information. However, other biases have been observed, which counteract retrieval performance. In this thesis, the reduction of retrieval systems to filters of information, or sampling processes, has allowed us to systematically investigate these biases.

We study biases manifesting in two aspects of IR research: retrieval models and retrieval evaluation. We start by identifying retrieval biases in probabilistic IR models and then develop new document priors to improve retrieval performance. Next, we discuss the accessibility bias of retrieval models, and for Boolean retrieval models we develop a mathematical framework of retrievability. For retrieval evaluation biases, we study how test collections are built using the pooling method and how this method introduces bias. Then, to improve the reliability of the evaluation, we first develop new pooling strategies to mitigate this bias at test collection build time and then, for two IR evaluation measures, Precision and Recall at cut-off (P@n and R@n), we develop new pool bias estimators to mitigate it at evaluation time.

Through a large scale experimentation involving up to 15 test collections, four IR evaluation measures and three bias measures, we demonstrate that including document priors based on verboseness improves the performance of probabilistic retrieval models; that the accessibility bias of Boolean retrieval models quickly worsens for conjunctive queries with the increase of the query length (while slightly improving for disjunctive queries); that the test collection bias can be lowered at test collection build time by pooling strategies inspired by a well-known problem in reinforcement learning, the multi-armed bandit problem; and that this bias can also be improved at evaluation time by analysing the runs participating in the pool. For this last point in particular, we show that for P@n, bias reduction is done by quantifying the potential of the new system against the pooled runs, and for R@n, this is done instead by simulating the absence of a pooled run from the set of pooled runs.

This thesis contributes to the IR field by giving a better understanding of relevance through the lens of biases in retrieval models and retrieval evaluation. The identification of these biases, and their exploitation or mitigation, leads to the development of better performing IR models and the improvement of the current IR evaluation practice.},
keywords = {},
pubstate = {published},
tppubtype = {phdthesis}
}

Close

The advent of the modern information technology has benefited society as the digitisation of content increased over the last half-century. While the processing capability of our species has remained unchanged, the information available to us has been notably increasing. In this overload of information, Information Retrieval (IR) has been playing a prominent role by developing systems capable of separating relevant information from the rest. This separation, however, is a difficult task rooted in the complexity of understanding of what is and what is not relevant. To manage this complexity, IR has developed a strong empirical nature, which has led to the development of grounded retrieval models, resulting in the development of retrieval systems empirically designed to be biased towards relevant information. However, other biases have been observed, which counteract retrieval performance. In this thesis, the reduction of retrieval systems to filters of information, or sampling processes, has allowed us to systematically investigate these biases.

We study biases manifesting in two aspects of IR research: retrieval models and retrieval evaluation. We start by identifying retrieval biases in probabilistic IR models and then develop new document priors to improve retrieval performance. Next, we discuss the accessibility bias of retrieval models, and for Boolean retrieval models we develop a mathematical framework of retrievability. For retrieval evaluation biases, we study how test collections are built using the pooling method and how this method introduces bias. Then, to improve the reliability of the evaluation, we first develop new pooling strategies to mitigate this bias at test collection build time and then, for two IR evaluation measures, Precision and Recall at cut-off (P@n and R@n), we develop new pool bias estimators to mitigate it at evaluation time.

Through a large scale experimentation involving up to 15 test collections, four IR evaluation measures and three bias measures, we demonstrate that including document priors based on verboseness improves the performance of probabilistic retrieval models; that the accessibility bias of Boolean retrieval models quickly worsens for conjunctive queries with the increase of the query length (while slightly improving for disjunctive queries); that the test collection bias can be lowered at test collection build time by pooling strategies inspired by a well-known problem in reinforcement learning, the multi-armed bandit problem; and that this bias can also be improved at evaluation time by analysing the runs participating in the pool. For this last point in particular, we show that for P@n, bias reduction is done by quantifying the potential of the new system against the pooled runs, and for R@n, this is done instead by simulating the absence of a pooled run from the set of pooled runs.

This thesis contributes to the IR field by giving a better understanding of relevance through the lens of biases in retrieval models and retrieval evaluation. The identification of these biases, and their exploitation or mitigation, leads to the development of better performing IR models and the improvement of the current IR evaluation practice.

Close