Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
From MaRDI portal
Publication:2810857
zbMath1360.62409arXiv1505.01462MaRDI QIDQ2810857
Nihar B. Shah, Abhay K. Parekh, Sivaraman Balakrishnan, Kannan Ramchandran, Joseph Bradley, Martin J. Wainwright
Publication date: 6 June 2016
Full work available at URL: https://arxiv.org/abs/1505.01462
Minimax procedures in statistical decision theory (62C20) Statistical ranking and selection procedures (62F07) Paired and multiple comparisons; multiple testing (62J15)
Related Items (12)
Stagewise learning for noisy \(k\)-ary preferences ⋮ Optimal permutation estimation in crowdsourcing problems ⋮ A General Pairwise Comparison Model for Extremely Sparse Networks ⋮ Worst-case versus average-case design for estimation from partial pairwise comparisons ⋮ Simple, Robust and Optimal Ranking from Pairwise Comparisons ⋮ Towards optimal estimation of bivariate isotonic matrices with unknown permutations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Active ranking from pairwise comparisons and when parametric assumptions do not help ⋮ Unnamed Item ⋮ Unnamed Item
Uses Software
This page was built for publication: Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
