Partial recovery for top-k ranking: optimality of MLE and suboptimality of the spectral method
From MaRDI portal
Publication:2148993
Recommendations
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- A nearly instance optimal algorithm for top-k ranking under the multinomial logit model
- Partial kernelization for rank aggregation: theory and experiments
- Ranking recovery from limited pairwise comparisons using low-rank matrix completion
- On Confidence-Constrained Rank Recovery in Topic Models
- scientific article; zbMATH DE number 5364205
- Rank‐Based Methods for Shrinkage and Selection
- Antithetic and Monte Carlo kernel estimators for partial rankings
- Ranking and empirical minimization of \(U\)-statistics
- Ranking with Partial Information: A Method and an Application
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3073477 (Why is no real title available?)
- An introduction to matrix concentration inequalities
- Competitive analysis of the top-K ranking problem
- Entrywise eigenvector analysis of random matrices with low expected rank
- Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors
- Minimax rates of community detection in stochastic block models
- Optimal Variable Selection and Adaptive Noisy Compressed Sensing
- Optimality of spectral clustering in the Gaussian mixture model
- Rank Centrality: Ranking from Pairwise Comparisons
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Subset Ranking Using Regression
- Variable selection with Hamming loss
Cited in
(12)- Self-normalized Cramér type moderate deviation theorem for Gaussian approximation
- Ranking Inferences Based on the Top Choice of Multiway Comparisons
- scientific article; zbMATH DE number 5364205 (Why is no real title available?)
- Rate-Optimal Rank Aggregation with Private Pairwise Rankings
- A General Pairwise Comparison Model for Extremely Sparse Networks
- Variable selection, monotone likelihood ratio and group sparsity
- Statistical ranking with dynamic covariates
- Partial Recovery for Top-k Ranking: Optimality of MLE and Sub-Optimality of Spectral Method
- A unified analysis of likelihood-based estimators in the Plackett-Luce model
- Optimal full ranking from pairwise comparisons
- On Confidence-Constrained Rank Recovery in Topic Models
- Inference for heteroskedastic PCA with missing data
This page was built for publication: Partial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148993)
