User simulation for evaluating information access systems

K Balog, CX Zhai - Proceedings of the Annual International ACM SIGIR …, 2023 - dl.acm.org
With the emergence of various information access systems exhibiting increasing complexity,
there is a critical need for sound and scalable means of automatic evaluation. To address …

[图书][B] Bandit algorithms

T Lattimore, C Szepesvári - 2020 - books.google.com
Decision-making in the face of uncertainty is a significant challenge in machine learning,
and the multi-armed bandit model is a commonly used framework to address it. This …

Equity of attention: Amortizing individual fairness in rankings

AJ Biega, KP Gummadi, G Weikum - … acm sigir conference on research & …, 2018 - dl.acm.org
Rankings of people and items are at the heart of selection-making, match-making, and
recommender systems, ranging from employment sites to sharing economy platforms. As …

End-to-end neural ad-hoc ranking with kernel pooling

C Xiong, Z Dai, J Callan, Z Liu, R Power - Proceedings of the 40th …, 2017 - dl.acm.org
This paper proposes K-NRM, a kernel based neural model for document ranking. Given a
query and a set of documents, K-NRM uses a translation matrix that models word-level …

Controlling fairness and bias in dynamic learning-to-rank

M Morik, A Singh, J Hong, T Joachims - Proceedings of the 43rd …, 2020 - dl.acm.org
Rankings are the primary interface through which many online platforms match users to
items (eg news, products, music, video). In these two-sided markets, not only the users draw …

Convolutional neural networks for soft-matching n-grams in ad-hoc search

Z Dai, C Xiong, J Callan, Z Liu - … conference on web search and data …, 2018 - dl.acm.org
This paper presents\textttConv-KNRM, a Convolutional Kernel-based Neural Ranking Model
that models n-gram soft matches for ad-hoc search. Instead of exact matching query and …

Unbiased learning-to-rank with biased feedback

T Joachims, A Swaminathan, T Schnabel - Proceedings of the tenth …, 2017 - dl.acm.org
Implicit feedback (eg, clicks, dwell times, etc.) is an abundant source of data in human-
interactive systems. While implicit feedback has many advantages (eg, it is inexpensive to …

Position bias estimation for unbiased learning to rank in personal search

X Wang, N Golbandi, M Bendersky, D Metzler… - Proceedings of the …, 2018 - dl.acm.org
A well-known challenge in learning from click data is its inherent bias and most notably
position bias. Traditional click models aim to extract the‹ query, document› relevance and …

Joint multisided exposure fairness for recommendation

H Wu, B Mitra, C Ma, F Diaz, X Liu - … of the 45th International ACM SIGIR …, 2022 - dl.acm.org
Prior research on exposure fairness in the context of recommender systems has focused
mostly on disparities in the exposure of individual or groups of items to individual users of …

Learning to rank with selection bias in personal search

X Wang, M Bendersky, D Metzler… - Proceedings of the 39th …, 2016 - dl.acm.org
Click-through data has proven to be a critical resource for improving search ranking quality.
Though a large amount of click data can be easily collected by search engines, various …