Optimal level set estimation for non-parametric tournament and crowdsourcing problems
From MaRDI portal
Cites work
- 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
- scientific article; zbMATH DE number 3073477 (Why is no real title available?)
- Isotonic regression with unknown permutations: statistics, computation and adaptation
- Minimax rates and efficient algorithms for noisy sorting
- Minimax rates in sparse, high-dimensional change point detection
- MM algorithms for generalized Bradley-Terry models.
- Noisy sorting without resampling
- Optimal permutation estimation in crowdsourcing problems
- Optimal rates for ranking a permuted isotonic matrix in polynomial time
- Optimal rates of statistical seriation
- Pairwise Comparison and Ranking in Tournaments
- Preference Learning and Ranking by Pairwise Comparison
- Preference-based online learning with dueling bandits: a survey
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- Towards optimal estimation of bivariate isotonic matrices with unknown permutations
- Uncertainty quantification in the Bradley–Terry–Luce model
- Worst-case versus average-case design for estimation from partial pairwise comparisons
This page was built for publication: Optimal level set estimation for non-parametric tournament and crowdsourcing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254317)