paper-with-me

홈 › Papers

Mallows Models for Top-k Lists

2018-12-01 · NeurIPS 2018 12 · Flavio Chierichetti, Anirban Dasgupta, Shahrzad Haddadan, Ravi Kumar, Silvio Lattanzi

The classic Mallows model is a widely-used tool to realize distributions on per- mutations. Motivated by common practical situations, in this paper, we generalize Mallows to model distributions on top-k lists by using a suitable distance measure between top-k lists. Unlike many earlier works, our model is both analytically tractable and computationally efficient. We demonstrate this by studying two basic problems in this model, namely, sampling and reconstruction, from both algorithmic and experimental points of view.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Generalized Top-k Mallows Model for Ranked Choices

2025-10-24 · Shahrzad Haddadan, Sara Ahmadian arxiv

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 indi…

Active Learning

Optimal Learning of Mallows Block Model

2019-06-03 · Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi, Manolis Zampetakis

The Mallows model, introduced in the seminal paper of Mallows 1957, is one of the most fundamental ranking distribution over the symmetric group $S_m$. To analyze more complex ranking data, several studies considered the…

modelparameter estimation

Federated Aggregation of Mallows Rankings: A Comparative Analysis of Borda and Lehmer Coding

2024-09-01 · Jin Sima, Vishal Rana, Olgica Milenkovic

Rank aggregation combines multiple ranked lists into a consensus ranking. In fields like biomedical data sharing, rankings may be distributed and require privacy. This motivates the need for federated rank aggregation pr…

Privacy PreservingQuantization

Hierarchical Partial-Order Models for Ranking

2026-06-23 · Dongqing Li, Geoff K. Nicholls, Jeong Eun Lee, Chuxuan 외 arxiv

Rank aggregation combines information from ordered lists ranking items by preference. Classical parametric models for such data, including the Mallows and Plackett-Luce models, assume the orders concentrate around one or…

Bayesian Inference

Aggregating Incomplete and Noisy Rankings

2020-11-02 · Dimitris Fotakis, Alkis Kalavasis, Konstantinos Stavropoulos

We consider the problem of learning the true ordering of a set of alternatives from largely incomplete and noisy rankings. We introduce a natural generalization of both the classical Mallows model of ranking distribution…