activity
20172026
most citedA Linear Bandit for Seasonal Environments

4 citations · 5 across the 4 of their papers we have counts for

collaborators

5 papers

cs.IR2026

Aligning Recommendations with User Popularity Preferences

Mona Schirmer, Anton Thielmann, Pola Schwöbel +4

Popularity bias is a pervasive problem in recommender systems, where recommendations disproportionately favor popular items. This not only results in "rich-get-richer" dynamics and…

stat.ML2022★ 1 cited

Low-variance estimation in the Plackett-Luce model via quasi-Monte Carlo sampling

Alexander Buchholz, Jan Malte Lichtenberg, Giuseppe Di Benedetto +3

The Plackett-Luce (PL) model is ubiquitous in learning-to-rank (LTR) because it provides a useful and intuitive probabilistic model for sampling ranked lists. Counterfactual offlin…

cs.IR2021

Ranker-agnostic Contextual Position Bias Estimation

Oriol Barbany Mayor, Vito Bellini, Alexander Buchholz +4

Learning-to-rank (LTR) algorithms are ubiquitous and necessary to explore the extensive catalogs of media providers. To avoid the user examining all the results, its preferences ar…

stat.ML2020★ 4 cited

A Linear Bandit for Seasonal Environments

Giuseppe Di Benedetto, Vito Bellini, Giovanni Zappella

Contextual bandit algorithms are extremely popular and widely used in recommendation systems to provide online personalised recommendations. A recurrent assumption is the stationar…

stat.ME2017

Non-exchangeable random partition models for microclustering

Giuseppe Di Benedetto, François Caron, Yee Whye Teh

Many popular random partition models, such as the Chinese restaurant process and its two-parameter extension, fall in the class of exchangeable random partitions, and have found wi…