Fetching the paper…
Reading the bibliography…
Crowdsourcing has become a primary means for label collection in many real-world machine learning applications.
Theory of probability
Bernstein, S · 1927
Earlier work this paper cites.
On general laws and the meaning of measurement in psychology
Rasch, G · 1961
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Hoeffding, W · 1963
Earlier work this paper cites.
Statistical theories of mental test scores
Lord, F. M · 1968
Earlier work this paper cites.
Maximum likelihood from incomplete data via the EM algorithm
Dempster, A. P · 1977
Earlier work this paper cites.
Maximum likeihood estimation of observer error-rates using the EM algorithm
Dawid, A. P · 1979
Earlier work this paper cites.
On the convergence properties of the em algorithm
Wu, C. J · 1983
Earlier work this paper cites.
Inferring ground truth from subjective labelling of venus images
Smyth, P · 1995
Earlier work this paper cites.
On convergence properties of the em algorithm for gaussian mixtures
Xu, L · 1996
Earlier work this paper cites.
Assouad, fano, and le cam
Yu, B · 1997
Earlier work this paper cites.
Theory of point estimation
Lehmann, E. L · 1998
Earlier work this paper cites.
A view of the EM algorithm that justifies incremental, sparse, and other variants
Neal, R. M · 1998
Cited alongside, same era.
Information-theoretic determination of minimax rates of convergence
Yang, Y · 1999
Cited alongside, same era.
Empirical processes in M-estimation
van de Geer, S · 2000
Cited alongside, same era.
Labeling images with a computer game
Von Ahn, L · 2004
Cited alongside, same era.
Elements of information theory
Cover, T. M · 2006
Cited alongside, same era.
The rise of crowdsourcing
Howe, J · 2006
Cited alongside, same era.
Cheap and fast—but is it good? Evaluating non-expert annotations for natural language tasks
Crowdsourcing systems on the world-wide web
Doan, A · 2011
Later among the works it cites.
On the absolute constants in the berry-esseen type inequalities for identically distributed summands
Shevtsova, I · 2011
Later among the works it cites.
Central limit theorems and multiplier bootstrap when p \displaystyle p is much larger than n \displaystyle n
Chernozhukov, V · 2012
Later among the works it cites.
Variational inference for crowdsourcing
Liu, Q · 2012
Later among the works it cites.
Learning from the wisdom of crowds by minimax entropy
Zhou, D · 2012
Later among the works it cites.
Optimistic knowledge gradient policy for optimal budget allocation in crowdsourcing
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Snow, R · 2008
Cited alongside, same era.
Introduction to Nonparametric Estimation
Tsybakov, A. B · 2009
Cited alongside, same era.
Learning from crowds
Raykar, V. C · 2010
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
Vershynin, R · 2010
Cited alongside, same era.
Chen, X · 2013
Closest in time.
Estimating undirected graphs under weak assumptions
Wasserman, L · 2013
Closest in time.
Consistency of weighted majority votes
Berend, D · 2014
Closest in time.
Online video game plugs players into remote-controlled biochemistry lab
Bohannon, J · 2014
Closest in time.
Budget-optimal task allocation for reliable crowdsourcing systems
Karger, D. R · 2014
Closest in time.