paper-with-me

Papers

Choosing to Rank

2018-09-13 · Stephen Ragain, Johan Ugander

Ranking data arises in a wide variety of application areas but remains difficult to model, learn from, and predict. Datasets often exhibit multimodality, intransitivity, or incomplete rankings---particularly when generated by humans---yet popular probabilistic models are often too rigid to capture such complexities. In this work we leverage recent progress on similar challenges in discrete choice modeling to form flexible and tractable choice-based models for ranking data. We study choice representations, maps from rankings (complete or top-$k$) to collections of choices, as a way of forming ranking models from choice models. We focus on the repeated selection (RS) choice representation, first used to form the Plackett-Luce ranking model from the conditional multinomial logit choice model. We fully characterize, for a prime number of alternatives, the choice representations that admit ranking distributions with unit normalization, a desirably property that greatly simplifies maximum likelihood estimation. We further show that only specific minor variations on repeated selection exhibit this property. Our choice-based ranking models provide higher out-of-sample likelihood when compared to Plackett-Luce and Mallows models on a broad collection of ranking tasks including food preferences, ranked-choice elections, car racing, and search engine relevance tasks.

📄 PDF Abstract BibTeX arXiv:1809.05139

Code (0)

등록된 구현이 없습니다.

Tasks

Car Racing

Similar Papers 제목 키워드 기반

Low-rank MMSE filters, Kronecker-product representation, and regularization: a new perspective

2025-12-16 · Daniel Gomes de Pinho Zanco, Leszek Szczecinski, Jacob Benesty, Eduardo Vinicius Kuhn arxiv

In this work, we propose a method to efficiently find the regularization parameter for low-rank MMSE filters based on a Kronecker-product representation. We show that the regularization parameter is surprisingly linked t…

Delexicalized Cross-lingual Dependency Parsing for Xibe

2021-09-01 · RANLP 2021 9 · He Zhou, Sandra Kübler

Manually annotating a treebank is time-consuming and labor-intensive. We conduct delexicalized cross-lingual dependency parsing experiments, where we train the parser on one language and test on our target language. As o…

Dependency Parsing

Fairness for Robust Learning to Rank

2021-12-12 · Omid Memarrast, Ashkan Rezaei, Rizal Fathony, Brian Ziebart

While conventional ranking systems focus solely on maximizing the utility of the ranked items to users, fairness-aware ranking systems additionally try to balance the exposure for different protected attributes such as g…

FairnessLearning-To-Rank

Structured low-rank matrix completion for forecasting in time series analysis

2018-02-22 · Jonathan Gillard, Konstantin Usevich

In this paper we consider the low-rank matrix completion problem with specific application to forecasting in time series analysis. Briefly, the low-rank matrix completion problem is the problem of imputing missing values…

Low-Rank Matrix CompletionMatrix CompletionMissing ValuesTime Series+1

Hybrid moderation in the newsroom: Recommending featured posts to content moderators

2023-07-14 · Cedric Waterschoot, Antal Van den Bosch

Online news outlets are grappling with the moderation of user-generated content within their comment section. We present a recommender system based on ranking class probabilities to support and empower the moderator in c…

ArticlesRecommendation Systems