Fetching the paper…
Reading the bibliography…
This paper explores the preference-based top-$K$ rank aggregation problem.
Rank analysis of incomplete block designs: I. the method of paired comparisons
R. A. Bradley and M. E. Terry · 1952
Earlier work this paper cites.
Solution of a ranking problem from binary comparisons
L. R. Ford · 1957
Earlier work this paper cites.
Individual choice behavior: A theoretical analysis
R. D. Luce · 1959
Earlier work this paper cites.
Aggregation and social choice: a mean voter theorem
A. Caplin and B. Nalebuff · 1991
Earlier work this paper cites.
Generalizing the Fano inequality
T. Han and S. Verdu · 1994
Earlier work this paper cites.
The anatomy of a large-scale hypertextual web search engine
S. Brin and L. Page · 1998
Earlier work this paper cites.
Rank aggregation methods for the web
C. Dwork, R. Kumar, M. Naor, and D. Sivakumar · 2001
Earlier work this paper cites.
Online ranking/collaborative filtering using the perceptron algorithm
E. F. Harrington · 2003
Earlier work this paper cites.
MM algorithms for generalized Bradley-Terry models
D. R. Hunter · 2004
Earlier work this paper cites.
Probability and computing: Randomized algorithms and probabilistic analysis
M. Mitzenmacher and E. Upfal · 2005
Earlier work this paper cites.
Noisy sorting without resampling
M. Braverman and E. Mossel · 2008
Earlier work this paper cites.
Information theory and network coding
R. W. Yeung · 2008
Earlier work this paper cites.
Matrix completion from noisy entries
R. Keshavan, A. Montanari, and S. Oh · 2009
Earlier work this paper cites.
Group recommendations with rank aggregation and collaborative filtering
L. Baltrunas, T. Makcinskas, and F. Ricci · 2010
Earlier work this paper cites.
Matrix completion from a few entries
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Earlier work this paper cites.
Ranking: Compare, don’t score
A. Ammar and D. Shah · 2011
Earlier work this paper cites.
Multi-bandit best arm identification
V. Gabillon, M. Ghavamzadeh, A. Lazaric, and S. Bubeck · 2011
Cited alongside, same era.
Active ranking using pairwise comparisons
K. G. Jamieson and R. Nowak · 2011
Cited alongside, same era.
Learning Mallows models with pairwise preferences
T. Lu and C. Boutilier · 2011
Cited alongside, same era.
Active learning ranking from pairwise preferences with almost optimal query complexity
N. Ailon · 2012
Cited alongside, same era.
Efficient rank aggregation using partial data
A. Ammar and D. Shah · 2012
Cited alongside, same era.
Rank centrality: Ranking from pair-wise comparisons
S. Negahban, S. Oh, and D. Shah · 2012
Cited alongside, same era.
Statistical guarantees for the EM algorithm: From population to sample-based analysis
S. Balakrishnan, M. J. Wainwright, and B. Yu · 2014
Later among the works it cites.
A survey of preference-based online learning with bandit algorithms
R. Busa-Fekete and E. Hüllermeier · 2014
Later among the works it cites.
Preference-based rank elicitation using statistical models: The case of Mallows
R. Busa-Fekete, E. Hüllermeier, and B. Szörényi · 2014
Later among the works it cites.
An axiomatic approach to constructing distances for rank comparison and aggregation
F. Farnoud and O. Milenkovic · 2014
Later among the works it cites.
Approximate sorting of data streams with limited storage
F. Farnoud, E. Yaakobi, and J. Bruck · 2014
Later among the works it cites.
Minimax-optimal inference from partial rankings
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Multiple identifications in multi-armed bandits
S. Bubeck, T. Wang, and N. Viswanathan · 2013
Cited alongside, same era.
Top-k selection based on adaptive sampling of noisy preferences
R. Busa-Fekete, B. Szörényi, P. Weng, W. Cheng, and E. Hüllermeier · 2013
Cited alongside, same era.
Pairwise ranking aggregation in a crowdsourced setting
X. Chen, P. N. Bennett, K. Collins-Thompson, and E. Horvitz · 2013
Cited alongside, same era.
Learning to top- k k search using pairwise comparisons
B. Eriksson · 2013
Cited alongside, same era.
Low-rank matrix completion using alternating minimization
P. Jain, P. Netrapalli, and S. Sanghavi · 2013
Cited alongside, same era.
Phase retrieval using alternating minimization
P. Netrapalli, P. Jain, and S. Sanghavi · 2013
Cited alongside, same era.
B. Hajek, S. Oh, and J. Xu · 2014
Later among the works it cites.
lil’UCB: An optimal exploration algorithm for multi-armed bandits
K. Jamieson, M. Malloy, R. Nowak, and S. Bubeck · 2014
Later among the works it cites.
Individualized rank aggregation using nuclear norm regularization
Y. Lu and S. N. Negahban · 2014
Later among the works it cites.
Learning mixed multinomial logit model from ordinal data
S. Oh and D. Shah · 2014
Later among the works it cites.
A statistical convergence perspective of algorithms for rank aggregation from pairwise data
A. Rajkumar and S. Agarwal · 2014
Later among the works it cites.
When is it better to compare than to score?
N. B. Shah, S. Balakrishnan, J. Bradley, A. Parekh, K. Ramchandran, and M. Wainwright · 2014
Later among the works it cites.
Renyi divergence and Kullback-Leibler divergence
T. van Erven and P. Harremoes · 2014
Later among the works it cites.
Phase retrieval via Wirtinger flow: Theory and algorithms
E. Candes, X. Li, and M. Soltanolkotabi · 2015
Closest in time.
Analysis of crowdsourced sampling strategies for hodgerank with sparse random graphs
B. Osting, J. Xiong, Q. Xu, and Y. Yao · 2015
Closest in time.
Preference completion: Large-scale collaborative ranking from pairwise comparisons
D. Park, J. Neeman, J. Zhang, S. Sanghavi, and I. S. Dhillon · 2015
Closest in time.