2020
Adversarial Crowdsourcing Through Robust Rank-One Matrix Completion
NeurIPS 2020poster
We consider the problem of reconstructing a rank-one matrix from a revealed subset of its entries when some of the revealed entries are corrupted with perturbations that are unknown and can be arbitrarily large. It is not known which revealed entries are corrupted. We propose a new algorithm combi…