TDG4Crowd:Test Data Generation for Evaluation of Aggregation Algorithms in Crowdsourcing
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. Main Track. Pages 2984-2992.
https://doi.org/10.24963/ijcai.2023/333
Keywords
- Machine Learning: ML: Cost-sensitive learning
- Machine Learning: ML: Autoencoders
- Humans and AI: HAI: Human computation and crowdsourcing
Abstract
In crowdsourcing, existing efforts mainly use real datasets collected from crowdsourcing as test datasets to evaluate the effectiveness of aggregation algorithms. However, these work ignore the fact that the datasets obtained by crowdsourcing are usually sparse and imbalanced due to limited budget. As a result, applying the same aggregation algorithm on different datasets often show contradicting conclusions. For example, on the RTE dataset, Dawid and Skene model performs significantly better than Majority Voting, while on the LableMe dataset, the experiments give the opposite conclusion. It is challenging to obtain comprehensive and balanced datasets at a low cost. To our best knowledge, little effort have been made to the fair evaluation of aggregation algorithms. To fill in this gap, we propose a novel method named TDG4Crowd that can automatically generate comprehensive and balanced datasets. Using Kullback Leibler divergence and Kolmogorov–Smirnov test, the experiment results show the superior of our method compared with others. Aggregation algorithms also perform more consistently on the synthetic datasets generated using our method.
- [Albarqouni et al., 2016] Shadi Albarqouni, Christoph Baur, Felix Achilles, Vasileios Belagiannis, Stefanie Demirci, and Nassir Navab. Aggnet: deep learning from crowds for mitosis detection in breast cancer histology images. IEEE transactions on medical imaging, pages 1313-1321, 2016.
- [Baker et al., 2017] Frank B Baker, Seock-Ho Kim, et al. The basics of item response theory using R. Springer, 2017.
- [Dawid and Skene, 1979] Alexander Philip Dawid and Al- lan M Skene. Maximum likelihood estimation of observer error-rates using the em algorithm. Journal of the Royal Statistical Society: Series C (Applied Statistics), pages 20- 28, 1979.
- [Fang et al., 2018] Yili Fang, Hailong Sun, Pengpeng Chen, and Jinpeng Huai. On the cost complexity of crowd- sourcing. In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), pages 1531- 1537, 2018. IJCAI
- [Galal and El-Sharkawi, 2019] Sh Galal and Mohamed E El- Sharkawi. Trr: Reducing crowdsourcing task redundancy. In Database and Expert Systems Applications -30th Inter- national Conference (DEXA), pages 102-117, 2019.
- [Gao et al., 2016] Chao Gao, Yu Lu, and Dengyong Zhou. Exact exponent in optimal rates for crowdsourcing. In Pro- ceedings of the 33nd International Conference on Machine Learning (ICML), pages 603-611, 2016.
- [Heinecke and Reyzin, 2019] Shelby Heinecke and Lev Reyzin. Crowdsourced pac learning under classification noise. In Proceedings of the 7th AAAI Conference on Hu- man Computation and Crowdsourcing (HCOMP), pages 41-49, 2019.
- [Ho et al., 2013] Chien-Ju Ho, Shahin Jabbari, and Jen- nifer Wortman Vaughan. Adaptive task assignment for crowdsourced classification. In Proceedings of the 30th International Conference on Machine Learning (ICML), pages 534-542, 2013.
- [Imamura et al., 2018] Hideaki Imamura, Issei Sato, and Masashi Sugiyama. Analysis of minimax error rate for crowdsourcing and its application to worker clustering model. In Proceedings of the 35th International Con- ference on Machine Learning (ICML), pages 2152-2161, 2018.
- [Jing et al., 2018] Jing, Zhang, Victor, S, Sheng, Tao, Li, Xindong, and Wu. Improving crowdsourced label quality using noise correction. IEEE Transactions on Neural Networks Learning Systems, pages 1675-1688, 2018.
- [Kawase et al., 2019] Yasushi Kawase, Yuko Kuroki, and Atsushi Miyauchi. Graph mining meets crowdsourcing: Extracting experts for answer aggregation. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pages 1272-1279, 2019. IJCAI
- [Li and Yu, 2014] Hongwei Li and Bin Yu. Error rate bounds and iterative weighted majority voting for crowdsourcing. CoRR, abs/1411.4086, 2014.
- [Li et al., 2013] Hongwei Li, Bin Yu, and Dengyong Zhou. Error rate bounds in crowdsourcing models. CoRR, abs/1307.2674, 2013.
- [Liu et al., 2012] Qiang Liu, Jian Peng, and Alexander Ihler. Variational inference for crowdsourcing. In Proceedings of the 26th Annual Conference on Neural Information Processing Systems 2012 (NIPS), pages 701-709, 2012.
- [Long and Hua, 2016] Chengjiang Long and Gang Hua. Multi-class multi-annotator active learning with robust gaussian process for visual recognition. International Conference on Computer Vision (ICCV), 2016.
- [Mescheder et al., 2017] Lars M. Mescheder, Sebastian Nowozin, and Andreas Geiger. Adversarial variational bayes: Unifying variational autoencoders and generative adversarial networks. In Proceedings of the 34th Inter- national Conference on Machine Learning (ICML), pages 2391-2400, 2017.
- [Pan et al., 2023] Yigong Pan, Ke Tang, and Guangzhong Sun. Theoretical guarantee for crowdsourcing learning with unsure option. Pattern Recognition, page 109316, 2023.
- [Rodrigues and Pereira, 2018] Filipe Rodrigues and Fran- cisco C. Pereira. Deep learning from crowds. In AAAI conference on artificial intelligence, pages 1611-1618, 2018.
- [Roy et al., 2015] Senjuti Basu Roy, Ioanna Lykourentzou, Saravanan Thirumuruganathan, Sihem Amer-Yahia, and Gautam Das. Task assignment optimization in knowledge- intensive crowdsourcing. The VLDB Journal, pages 467- 491, 2015.
- [Russell et al., 2008] Bryan C. Russell, Antonio Torralba, Kevin P. Murphy, and William T. Freeman. Labelme: A database and web-based tool for image annotation. Inter- national journal of computer vision, pages 157-173, 2008.
- [Sheng et al., 2008] Victor S. Sheng, Foster J. Provost, and Panagiotis G. Ipeirotis. Get another label? improving data quality and data mining using multiple, noisy labelers. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD), pages 614-622, 2008.
- [Sheng, 2011] Victor S Sheng. Simple multiple noisy label utilization strategies. In Proceedings of the 11th IEEE International Conference on Data Mining (ICDM), pages 635-644, 2011.
- [Sinha et al., 2018] Vaibhav B Sinha, Sukrut Rao, and Vi- neeth N Balasubramanian. Fast dawid-skene: A fast vote aggregation scheme for sentiment classification. arXiv preprint arXiv:1803.02781, 2018.
- [Snow et al., 2008] Rion Snow, Brendan O'Connor, Daniel Jurafsky, and Andrew Y. Ng. Cheap and fast -but is it good? evaluating non-expert annotations for natural lan- guage tasks. In Proceedings of the 2008 conference on em- pirical methods in natural language processing (EMNLP), pages 254-263, 2008.
- [Wang and Zhou, 2015] Wei Wang and Zhi-Hua Zhou. Crowdsourcing label quality: a theoretical analysis. Sci- ence China Information Sciences, pages 1-12, 2015.
- [Wang et al., 2013] Jiannan Wang, Guoliang Li, Tim Kraska, Michael J. Franklin, and Jianhua Feng. Leveraging tran- sitive relations for crowdsourced joins. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pages 229-240, 2013.
- [Wauthier and Jordan, 2011] Fabian L. Wauthier and Michael I. Jordan. Bayesian bias mitigation for crowdsourcing. In Proceedings of the 25th Annual Conference on Neural Information Processing Systems 2011 (NIPS), pages 1800-1808, 2011.
- [Whitehill et al., 2009] Jacob Whitehill, Paul Ruvolo, Tingfan Wu, Jacob Bergsma, and Javier R. Movellan. Whose vote should count more: Optimal integration of labels from labelers of unknown expertise. In Proceedings of the 23rd Annual Conference on Neural Information Processing Systems 2009 (NIPS), pages 2035-2043, 2009.
- [Yu et al., 2017] Han Yu, Chunyan Miao, Yiqiang Chen, Si- mon Fauvel, Xiaoming Li, and Victor R Lesser. Algorith- mic management for improving collective productivity in crowdsourcing. Scientific reports, page 12541, 2017.
- [Zhang et al., 2016a] Jing Zhang, Xindong Wu, and Vic- tor S. Sheng. Learning from crowdsourced labeled data: a survey. Artificial Intelligence Review, pages 543-576, 2016.
- [Zhang et al., 2016b] Yuchen Zhang, Xi Chen, Dengyong Zhou, and Michael I. Jordan. Spectral methods meet em: A provably optimal algorithm for crowdsourcing. Journal of Machine Learning Research, pages 1-44, 2016.
- [Zhang et al., 2019] Hao Zhang, Liangxiao Jiang, and Wen- qiang Xu. Multiple noisy label distribution propagation for crowdsourcing. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pages 1473-1479, 2019. IJCAI
References were extracted automatically from the PDF and may contain errors.
Full text extracted automatically from the PDF; figures, tables and equations may differ. The PDF is the version of record.
4x4x4x512
1024x4x4x512
1024x4x4x512
Instance x n
Instance x n
1024x4x4x512
Instance x n
1024x1
1024x4x4x512
Instance x n
1024x1
1024x4x4x512
Instance x n
1024x4x4x512
1024x4x4x512
tator e r
annotator e r

Instance x n
Instance x n
annotator e r
annotator e r
1024x50
L 1
L 1
Learn the feature of annotator
Learn the feature of annotator
Learn the feature of annotator
Learn the feature of annotator
1024x59
1024x59
1024x59
1024x59
1024x59
L 2
1024x59
L 2
L 1
L 1
L 1
1024x8
1024x8
L 2
1024x20 1024x20
1024x20 1024x20
1024x20 1024x20
1024x20 1024x20
1024x20 1024x20
1024x20 1024x20
1024x8192
Learn the feature of annotator
1024x59
1024x59
1024x59
1024x59
1024x20
1024x20
1024x20
1024x8
1024x59
1024x8
1024x8
1024x8
1024x20
1024x20
1024x20 1024x20
L 2
ε ∼ N(0,1)
Learn the annotations
1024x8
Learn the annotations
e r
¯
1024x59
Learn the annotations
1024x20
Learn the annotations
1024x20
Learn the annotations
1024x8
e r
¯
¯ e r ¯ e r ¯ e r 1024x8 ¯ e r 1024x8 1024x8 L 2 Learn the feature of annotator 4.3 Inferring One of our goals is to learn a model that could generate new annotations. The supervised learning component concatenates the sampling result of za and zi and send it to a fully connected network. The output of this fully connected network is the predicted annotation ˆ yn for instance xn. We train this component in a supervised manner and construct the loss function as follows:
L 2 L 2 1024x8 1024x59 1024x8 1024x8 1024x8 L 2 L 2 L 2 L 2 L 2 1024x8 Figure 1: The TDG4Crowd framework
ε ∼ N(0,1) 1024x1 One-hot ε ∼ N(0,1) 1024x1 One-hot ε ∼ N(0,1) 1024x1 One-hot ε ∼ N(0,1) 1024x1 One-hot ε ∼ N(0,1) 1024x1 One-hot 1024x1 One-hot ε ∼ N(0,1) 1024x1 One-hot L 2 L 2 L 2 Therefore, the loss function for annotators can be expressed as:
Learn the feature of annotator
L 2 1024x8 annotator e r L 2 Learn the feature of annotator 1024x8 annotator e r L 2 Learn the feature of annotator 1024x8 annotator e r L 2 Learn the feature of annotator 1024x8 annotator e r L 2 Learn the feature of annotator annotator e r L 2 The Lrecons loss makes the model learn a lower dimensional representation of annotators, while the KL divergence loss makes the representation follow the normal distribution as close as possible. Please note here we are not directly optimizing the KL divergence between the real dataset and the synthetic one.
4.2 Learn the Features of Instances
The process of learning the latent distribution of instances is similar to that of annotators, that is we also learn latent representation for instances based on VAE. But for images, we first use a pre-trained light weight VGG-16 model to extract the features for each instance. Thus, the input for the instance model is the pre-processed feature vector, not raw images. We use xn to represent the feature vector for instance n. We assume the latent variable for each instance follows a multivariable normal distribution, thus the output of the encoder are the mean and variance of q(zi|xn). We use a standard Gaussian prior acting as a regularizer.
the reconstruction loss is the cross entropy between ˆ xn and xn.
The loss function for instance model is similar to that of the annotator model.
The Lrecons loss makes the model learn a lower dimensional representation of instances, while the KL divergence loss makes the representation follow the normal distribution as close as possible.
The method of TDG4Crowd includes Annotator model, Instance model and Inferring component. We first train Annotator model and Instance model separately until the loss of these two models start to stabilize, then we add in the inferring component and train them as a whole.
5 Experiments
To evaluate our proposed method, we conduct comprehensive experiments on both real and synthetic datasets. In this section, we will first describe the experiment setup. We use annotations collected through the Appen and AMT crowdsourcing platforms. Next, we describe the basesline models used for comparison. Finally, we compare our proposed method with other models for generating new data points. The strategy we use is we regenerate the annotations using the annotators and instances we already have, instead of sampling completely new annotators or instances from the standard normal distribution. That is to say, we use the specific mean and variance for corresponding worker or task for sampling. We use half dataset for training and half for testing and all these regeneration experiments are conducted on the test dataset.
Learn the annotations
1024x59
1024x8
1024x8
annotator e r
annotator e r
Instance x n
tance x n
1024x1
Anno. y n
Anno. y n
Anno. y n
Anno. y n
Anno. y n
Anno. y n
Anno. y n
Anno. y n
Anno. y n
Anno. y n
L 3
Anno. y n
L 3
L 3
L 3
L 3
L 3
L 3
1024x8
1024x8
L 3
L 3
y n
y n
y n
¯
¯
L 3
y n
¯
Anno. y n
y n
¯
y n
¯
Anno. y n
Anno. y n
¯
Anno. y n
Anno. y n
y n
L 3
y n
¯
x n
¯
L
L 3
1024x5
y n
¯
¯
L 3
1024x8
1024x8
y n
¯
¯
y n
¯
y
y n
¯
¯
Learn
x n
¯
e r
L 3
L 3
L
L 3
1024x5
y n
y n
¯
¯
y n
¯
y n
¯
Learn
e r
¯
y n
¯
@inproceedings{ijcai2023p333,
title = {TDG4Crowd:Test Data Generation for Evaluation of Aggregation Algorithms in Crowdsourcing},
author = {Fang, Yili and Shen, Chaojie and Gu, Huamao and Han, Tao and Ding, Xinyi},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-23}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Edith Elkind},
pages = {2984--2992},
year = {2023},
month = {8},
note = {Main Track},
doi = {10.24963/ijcai.2023/333},
url = {https://doi.org/10.24963/ijcai.2023/333},
}
TY - CPAPER TI - TDG4Crowd:Test Data Generation for Evaluation of Aggregation Algorithms in Crowdsourcing AU - Fang, Yili AU - Shen, Chaojie AU - Gu, Huamao AU - Han, Tao AU - Ding, Xinyi T2 - Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23 PB - International Joint Conferences on Artificial Intelligence Organization PY - 2023 SP - 2984 EP - 2992 DO - 10.24963/ijcai.2023/333 UR - https://doi.org/10.24963/ijcai.2023/333 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: