Ranking recovery from limited pairwise comparisons using low-rank matrix completion
From MaRDI portal
Publication:2036498
DOI10.1016/j.acha.2021.03.004OpenAlexW3139463790MaRDI QIDQ2036498
Alireza Vahid, Raja Giryes, Tal Levy
Publication date: 29 June 2021
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.05419
Cites Work
- Unnamed Item
- Exact matrix completion via convex optimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- The phase transition of matrix recovery from Gaussian measurements matches the minimax MSE of matrix denoising
- Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- A Simpler Approach to Matrix Completion
- Low-rank matrix completion using alternating minimization
- Rank Centrality: Ranking from Pairwise Comparisons
This page was built for publication: Ranking recovery from limited pairwise comparisons using low-rank matrix completion