atlas

Research map / Learning theory and algorithms / Sample complexity

Concentric mixtures of Mallows models for top-$k$ rankings: sampling and identifiability

ICML 2021 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of ranking and selection · 3 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the proposed inversion-vector sampler instead of the previous top-k samplerMallows top-k sampling · Top-k Mallows rankingssampling time complexity: O(k^2 4^k + k^2 log n) -> O(k log k)Helped
Increase the dispersion-distance ratio c between non-experts and experts2-means voter separation · Voter separabilitywrongly separated rankings: for c ≥ 9 the percentage of wrongly separated rankings is almost always below 10%Helped
Use expert Borda: identify experts, aggregate their rankings, and fill remaining positions with the full sampleBorda consensus estimation · Consensus estimate with expert and non-expert rankingsdistance to consensusHelped
Fit a concentric Mallows mixture rather than a single Mallows modelMallows model fitting · Real data example with simulated raterslog-likelihoodHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy