Fetching the paper…
Reading the bibliography…
When tracking user-specific online activities, each user's preference is revealed in the form of choices and comparisons.
A law of comparative judgment
L. L. Thurstone · 1927
Earlier work this paper cites.
Die berechnung der turnier-ergebnisse als ein maximumproblem der wahrscheinlichkeitsrechnung
E. Zermelo · 1929
Earlier work this paper cites.
Rank analysis of incomplete block designs: I. the method of paired comparisons
R. A. Bradley and M. E. Terry · 1955
Earlier work this paper cites.
Solution of a ranking problem from binary comparisons
L. R. F. Jr · 1957
Earlier work this paper cites.
Individual Choice Behavior
D. R. Luce · 1959
Earlier work this paper cites.
Binary-choice constraints and random utility indicators
J. Marschak · 1960
Earlier work this paper cites.
Conditional logit analysis of qualitative choice behavior
D. McFadden · 1973
Earlier work this paper cites.
Independence of irrelevant alternatives
P. Ray · 1973
Earlier work this paper cites.
The analysis of permutations
R. L. Plackett · 1975
Earlier work this paper cites.
Spearman’s footrule as a measure of disarray
P. Diaconis and R. L. Graham · 1977
Earlier work this paper cites.
Econometric models for probabilistic choice among products
D. McFadden · 1980
Earlier work this paper cites.
A logit model of brand choice calibrated on scanner data
P. M. Guadagni and J. D. Little · 1983
Earlier work this paper cites.
Discrete choice analysis: theory and application to travel demand
M. E. Ben-Akiva and S. R. Lerman · 1985
Earlier work this paper cites.
Qualitative choice analysis: Theory, econometrics, and an application to automobile demand
K. Train · 1986
Earlier work this paper cites.
Two-point step size gradient methods
J. Barzilai and J. M. Borwein · 1988
Earlier work this paper cites.
An extended transmission/disequilibrium test (tdt) for multi-allele marker loci
P. Sham and D. Curtis · 1995
Earlier work this paper cites.
Mixed mnl models for discrete response
D. McFadden and K. Train · 2000
Earlier work this paper cites.
Empirical Processes in M-estimation
S. Van De Geer · 2000
Earlier work this paper cites.
Eigentaste: A constant time collaborative filtering algorithm
K. Goldberg, T. Roeder, D. Gupta, and C. Perkins · 2001
Earlier work this paper cites.
Generalized random utility model
J. Walker and M. Ben-Akiva · 2002
Earlier work this paper cites.
MM algorithms for generalized Bradley-Terry models
D. R. Hunter · 2004
Earlier work this paper cites.
Ranking and scoring using empirical risk minimization
S. Clémençon, G. Lugosi, and N. Vayatis · 2005
Earlier work this paper cites.
The concentration of measure phenomenon
M. Ledoux · 2005
Earlier work this paper cites.
Visualizing data using t-sne
L. v. d. Maaten and G. Hinton · 2008
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. Candès and B. Recht · 2009
Earlier work this paper cites.
A data-driven approach to modeling choice
V. F. Farias, S. Jagabathula, and D. Shah · 2009
Earlier work this paper cites.
A grade of membership model for rank data
I. C. Gormley and T. B. Murphy · 2009
Earlier work this paper cites.
A unified framework for high-dimensional analysis of m m -estimators with decomposable regularizers
S. Negahban, B. Yu, M. J. Wainwright, and P. K. Ravikumar · 2009
Earlier work this paper cites.
Fast global convergence rates of gradient methods for high-dimensional statistical recovery
A. Agarwal, S. Negahban, and M. Wainwright · 2010
Earlier work this paper cites.
A singular value thresholding algorithm for matrix completion
J.-F. Cai, E. J. Candès, and Z. Shen · 2010
Cited alongside, same era.
Matrix completion from a few entries
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Cited alongside, same era.
Matrix completion from noisy entries
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Cited alongside, same era.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
B. Recht, M. Fazel, and P. Parrilo · 2010
Cited alongside, same era.
Bundle-size pricing as an approximation to mixed bundling
C. Chu, P. Leslie, and A. Sorensen · 2011
Cited alongside, same era.
Rank aggregation via nuclear norm minimization
D. F. Gleich and L.-h. Lim · 2011
Cited alongside, same era.
Spectral mle: Top-k rank aggregation from pairwise comparisons
Y. Chen and C. Suh · 2015
Later among the works it cites.
Fast and accurate inference of Plackett–Luce models
L. Maystre and M. Grossglauser · 2015
Later among the works it cites.
Preference completion: Large-scale collaborative ranking from pairwise comparisons
D. Park, J. Neeman, J. Zhang, S. Sanghavi, and I. S. Dhillon · 2015
Later among the works it cites.
Clustering and inference from pairwise comparisons
W. Rui, J. Xu, S. Rayadurgam, M. Lelarge, L. Massoulié, and B. Hajek · 2015
Later among the works it cites.
An introduction to matrix concentration inequalities
J. A. Tropp · 2015
Later among the works it cites.
Randomized Kaczmarz for rank aggregation from pairwise comparisons
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
O. Tamuz, C. Liu, S. Belongie, O. Shamir, and A. T. Kalai · 2011
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
J. Tropp · 2011
Cited alongside, same era.
Random utility theory for social choice
H. Azari Soufiani, D. C. Parkes, and L. Xia · 2012
Cited alongside, same era.
Iterative ranking from pair-wise comparisons
S. Negahban, S. Oh, and D. Shah · 2012
Cited alongside, same era.
Restricted strong convexity and (weighted) matrix completion: Optimal bounds with noise
S. Negahban and M. J. Wainwright · 2012
Cited alongside, same era.
Generalized method-of-moments for rank aggregation
H. Azari Soufiani, W. Chen, D. C. Parkes, and L. Xia · 2013
Cited alongside, same era.
V. S. Borkar, N. Karamchandani, and S. Mirani · 2016
Later among the works it cites.
Matrix completion has no spurious local minimum
R. Ge, J. D. Lee, and T. Ma · 2016
Later among the works it cites.
Top- k k ranking from pairwise comparisons: When spectral ranking is optimal
M. Jang, S. Kim, C. Suh, and S. Oh · 2016
Later among the works it cites.
Computational and statistical tradeoffs in learning to rank
A. Khetan and S. Oh · 2016
Later among the works it cites.
Data-driven rank breaking for efficient rank aggregation
A. Khetan and S. Oh · 2016
Later among the works it cites.
Pairwise choice Markov chains
S. Ragain and J. Ugander · 2016
Later among the works it cites.
Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence
N. B. Shah, S. Balakrishnan, J. Bradley, A. Parekh, K. Ramchandran, and M. J. Wainwright · 2016
Later among the works it cites.
Stochastically transitive models for pairwise comparisons: Statistical and computational issues
N. B. Shah, S. Balakrishnan, A. Guntuboyina, and M. J. Wainwright · 2016
Later among the works it cites.
Parameter estimation for generalized thurstone choice models
M. Vojnovic and S. Yun · 2016
Later among the works it cites.
Iterative collaborative filtering for sparse matrix estimation
C. Borgs, J. Chayes, C. E. Lee, and D. Shah · 2017
Closest in time.
Spectral method and regularized mle are both optimal for top- k k ranking
Y. Chen, J. Fan, C. Ma, and K. Wang · 2017
Closest in time.
Optimal sample complexity of m-wise data for top-k ranking
M. Jang, S. Kim, C. Suh, and S. Oh · 2017
Closest in time.
Nonparametric preference completion
J. Katz-Samuels and C. Scott · 2017
Closest in time.
Worst-case vs average-case design for estimation from fixed pairwise comparisons
A. Pananjady, C. Mao, V. Muthukumar, M. J. Wainwright, and T. A. Courtade · 2017
Closest in time.
Accelerated spectral ranking
A. Agarwal, P. Patil, and S. Agarwal · 2018
Closest in time.
A discrete choice model for subset selection
A. R. Benson, R. Kumar, and A. Tomkins · 2018
Closest in time.
Learning a mixture of two multinomial logits
F. Chierichetti, R. Kumar, and A. Tomkins · 2018
Closest in time.
The limits of maxing, ranking, and preference learning
M. Falahatgar, A. Jain, A. Orlitsky, V. Pichapati, and V. Ravindrakumar · 2018
Closest in time.
Approximate ranking from pairwise comparisons
R. Heckel, M. Simchowitz, K. Ramchandran, and M. J. Wainwright · 2018
Closest in time.
Adaptive sampling for coarse ranking
S. Katariya, L. Jain, N. Sengupta, J. Evans, and R. Nowak · 2018
Closest in time.
Comparison based learning from weak oracles
E. Kazemi, L. Chen, S. Dasgupta, and A. Karbasi · 2018
Closest in time.
As you like it: Localization via paired comparisons
A. K. Massimino and M. A. Davenport · 2018
Closest in time.
Tensor methods for nonlinear matrix completion
G. Ongie, L. Balzano, D. Pimentel-Alarcón, R. Willett, and R. D. Nowak · 2018
Closest in time.
Modeling outcomes of soccer matches
A. Tsokos, S. Narayanan, I. Kosmidis, G. Baio, M. Cucuringu, G. Whitaker, and F. J. Király · 2018
Closest in time.