Optimal permutation estimation in crowdsourcing problems

DOI10.1214/23-aos2271arXiv2211.04092MaRDI QIDQ6136577

Emmanuel Pilliat, Nicolas Verzelen, Alexandra Carpentier

Publication date: 31 August 2023

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.04092

zbMATH Keywords

rankingsub-Gaussian noisebi-isotonic matrices

Mathematics Subject Classification ID

Minimax procedures in statistical decision theory (62C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal rates of statistical seriation
• Towards optimal estimation of bivariate isotonic matrices with unknown permutations
• Minimax rates in sparse, high-dimensional change point detection
• Heteroskedastic PCA: algorithm, optimality, and applications
• Isotonic regression with unknown permutations: statistics, computation and adaptation
• Optimal full ranking from pairwise comparisons
• Worst-case versus average-case design for estimation from partial pairwise comparisons
• Spectral method and regularized MLE are both optimal for top-\(K\) ranking
• Matrix estimation by universal singular value thresholding
• On matrix estimation under monotonicity constraints
• Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
• Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
• Minimax Rates and Efficient Algorithms for Noisy Sorting
• High-Dimensional Statistics
• A Permutation-Based Model for Crowd Labeling: Optimal Estimation and Robustness
• Estimation in Tournaments and Graphs Under Monotonicity Constraints
• Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons
• Optimal multiple change-point detection for high-dimensional data

This page was built for publication: Optimal permutation estimation in crowdsourcing problems