Generalized Top-k Mallows Model for Ranked Choices
Shahrzad Haddadan, Sara Ahmadian
摘要
The classic Mallows model is a foundational tool for modeling user preferences. However, it has limitations in capturing real-world scenarios, where users often focus only on a limited set of preferred items and are indifferent to the rest. To address this, extensions such as the top-k Mallows model have been proposed, aligning better with practical applications. In this paper, we address several challenges related to the generalized top-k Mallows model, with a focus on analyzing buyer choices. Our key contributions are: (1) a novel sampling scheme tailored to generalized top-k Mallows models, (2) an efficient algorithm for computing choice probabilities under this model, and (3) an active learning algorithm for estimating the model parameters from observed choice data. These contributions provide new tools for analysis and prediction in critical decision-making scenarios. We present a rigorous mathematical analysis for the performance of our algorithms. Furthermore, through extensive experiments on synthetic data and real-world data, we demonstrate the scalability and accuracy of our proposed methods, and we compare the predictive power of Mallows model for top-k lists compared to the simpler Multinomial Logit model.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper5
- Concentric mixtures of Mallows models for top-k rankings: sampling and identifiabilityFabien Collas, Ekhine IrurozkiICML 2021 · 被引用 16 次
- On A Mallows-type Model For (Ranked) ChoicesYifan Feng, Yuxuan TangNeurIPS 2022 · 被引用 7 次
- Robust Consensus in Ranking Data Analysis: Definitions, Properties and Computational IssuesMorgane Goibert, Clément Calauzènes, Ekhine Irurozki, Stéphan ClémençonICML 2023 · 被引用 6 次
- Subset Selection Based On Multiple Rankings in the Presence of Bias: Effectiveness of Fairness Constraints for Multiwinner Voting Score FunctionsNiclas Boehmer, L. Elisa Celis, Lingxiao Huang, Anay Mehrotra 等ICML 2023 · 被引用 5 次
- Statistical Models of Top-k Partial OrdersAmel Awadelkarim, Johan UganderKDD 2024
相关 Paper
- Pseudo-Mallows for Efficient Probabilistic Preference LearningSylvia Liu, Valeria Vitelli, Carlo Mannino, Arnoldo Frigessi 等ICML 2026 · 被引用 2 次
- Learning the Valuations of a k-demand AgentHanrui Zhang, Vincent ConitzerICML 2020 · 被引用 10 次
- Learning to Rank from Incomplete RankingsCristiano Migali, Gianmarco Genalti, Alberto Maria Metelli, Marco MussiICML 2026 · 被引用 11 次
- Active preference learning for ordering items in- and out-of-sampleHerman Bergström, Emil Carlsson, Devdatt P. Dubhashi, Fredrik D. JohanssonNeurIPS 2024 · 被引用 9 次
- Preference Elicitation as Average-Case SortingDominik Peters, Ariel D. ProcacciaAAAI 2021 · 被引用 3 次
