Spectral methods meet EM: a provably optimal algorithm for crowdsourcing
From MaRDI portal
Recommendations
- Dense limit of the Dawid–Skene model for crowdsourcing and regions of sub-optimality of message passing algorithms
- Optimal stopping and worker selection in crowdsourcing: an adaptive sequential probability ratio test framework
- Statistical Decision Making for Optimal Budget Allocation in Crowd Labeling
- Approximating the crowd
- Bayesian nonparametric crowdsourcing
Cited in
(26)- Crowdsourcing with unsure option
- Optimal deterministic algorithm generation
- Estimating a network from multiple noisy realizations
- Towards optimal estimation of bivariate isotonic matrices with unknown permutations
- Subgroup-effects models for the analysis of personal treatment effects
- Sequence labeling with multiple annotators
- Learning the truth vector in high dimensions
- First-order methods almost always avoid strict saddle points
- Millionaire: a hint-guided approach for crowdsourcing
- Transfer learning for nonparametric classification: minimax rate and adaptive classifier
- Inferring ground truth from crowdsourced data under local attribute differential privacy
- Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
- Identifying unreliable and adversarial workers in crowdsourced labeling tasks
- Gradient descent for sparse rank-one matrix completion for crowd-sourced aggregation of sparsely interacting workers
- Optimal stopping and worker selection in crowdsourcing: an adaptive sequential probability ratio test framework
- Doubly Robust Crowdsourcing
- Statistical considerations for crowdsourced perceptual ratings of human speech productions
- Adaptive matching for expert systems with uncertain task types
- Eliminating spammers and ranking annotators for crowdsourced labeling tasks
- Bayesian nonparametric crowdsourcing
- Optimal permutation estimation in crowdsourcing problems
- Three-way decision-based noise correction for crowdsourcing
- A tensor-EM method for large-scale latent class analysis with binary responses
- Learning from crowds with robust logistic regression
- Crowdsourcing Utilizing Subgroup Structure of Latent Factor Modeling
- Learning and strongly truthful multi-task peer prediction: a variational approach
This page was built for publication: Spectral methods meet EM: a provably optimal algorithm for crowdsourcing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188030)
