Minimax Rates and Efficient Algorithms for Noisy Sorting
From MaRDI portal
Publication:4617642
zbMath1407.62066arXiv1710.10388MaRDI QIDQ4617642
Jonathan Weed, Cheng Mao, Philippe Rigollet
Publication date: 6 February 2019
Full work available at URL: https://arxiv.org/abs/1710.10388
Learning and adaptive systems in artificial intelligence (68T05) Statistical ranking and selection procedures (62F07) Paired and multiple comparisons; multiple testing (62J15)
Related Items (10)
Iterative algorithm for discrete structure recovery ⋮ Optimal full ranking from pairwise comparisons ⋮ Optimal rates for estimation of two-dimensional totally positive distributions ⋮ Optimal permutation estimation in crowdsourcing problems ⋮ Worst-case versus average-case design for estimation from partial pairwise comparisons ⋮ External-memory sorting with comparison errors ⋮ Estimation of Monge matrices ⋮ Towards optimal estimation of bivariate isotonic matrices with unknown permutations ⋮ Optimal detection of the feature matching map in presence of noise and outliers ⋮ Asymptotically Optimal Sequential Design for Rank Aggregation
This page was built for publication: Minimax Rates and Efficient Algorithms for Noisy Sorting
