On the Impossibility of Convex Inference in Human Computation
Nihar B. Shah, Dengyong Zhou

TL;DR
This paper proves that under natural assumptions, convex objective functions for inference in human computation are impossible, but they can be constructed if spammers are not modeled.
Contribution
It establishes the theoretical impossibility of convex inference in human computation under natural axioms and provides conditions for convexity when spammers are excluded.
Findings
Convex inference is impossible under natural axioms.
Convex objective functions can be constructed without modeling spammers.
The results clarify limitations and possibilities in designing inference algorithms for crowdsourcing.
Abstract
Human computation or crowdsourcing involves joint inference of the ground-truth-answers and the worker-abilities by optimizing an objective function, for instance, by maximizing the data likelihood based on an assumed underlying model. A variety of methods have been proposed in the literature to address this inference problem. As far as we know, none of the objective functions in existing methods is convex. In machine learning and applied statistics, a convex function such as the objective function of support vector machines (SVMs) is generally preferred, since it can leverage the high-performance algorithms and rigorous guarantees established in the extensive literature on convex optimization. One may thus wonder if there exists a meaningful convex objective function for the inference problem in human computation. In this paper, we investigate this convexity issue for human…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Crowdsensing and Crowdsourcing · Domain Adaptation and Few-Shot Learning · Visual Attention and Saliency Detection
