{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:13Z","timestamp":1767339553431,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSFC\/RGC Joint Research Scheme","award":["62261160391, N_PolyU529\/22"],"award-info":[{"award-number":["62261160391, N_PolyU529\/22"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,4,28]]},"DOI":"10.1145\/3696410.3714557","type":"proceedings-article","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T23:08:29Z","timestamp":1745363309000},"page":"3952-3967","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust Aggregation with Adversarial Experts"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2816-4149","authenticated-orcid":false,"given":"Yongkang","family":"Guo","sequence":"first","affiliation":[{"name":"School of Computer Science, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5901-3004","authenticated-orcid":false,"given":"Yuqing","family":"Kong","sequence":"additional","affiliation":[{"name":"School of Computer Science, Peking University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538234"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1813934115"},{"key":"e_1_3_2_1_3_1","volume-title":"Universally Robust Information Aggregation for Binary Decisions. arXiv preprint arXiv:2302.03667","author":"Arieli Itai","year":"2023","unstructured":"Itai Arieli, Yakov Babichenko, Inbal Talgam-Cohen, and Konstantin Zabarnyi. 2023. Universally Robust Information Aggregation for Binary Decisions. arXiv preprint arXiv:2302.03667 (2023)."},{"key":"e_1_3_2_1_4_1","volume-title":"Poisoning attacks against support vector machines. arXiv preprint arXiv:1206.6389","author":"Biggio Battista","year":"2012","unstructured":"Battista Biggio, Blaine Nelson, and Pavel Laskov. 2012. Poisoning attacks against support vector machines. arXiv preprint arXiv:1206.6389 (2012)."},{"key":"e_1_3_2_1_5_1","volume-title":"Bagging predictors. Machine learning","author":"Breiman Leo","year":"1996","unstructured":"Leo Breiman. 1996. Bagging predictors. Machine learning, Vol. 24 (1996), 123--140."},{"key":"e_1_3_2_1_6_1","volume-title":"Random forests. Machine learning","author":"Breiman Leo","year":"2001","unstructured":"Leo Breiman. 2001. Random forests. Machine learning, Vol. 45 (2001), 5--32."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85896-4_14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/332"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1979.11321"},{"key":"e_1_3_2_1_10_1","volume-title":"Robust merging of information. arXiv preprint arXiv:2106.00088","author":"Oliveira Henrique De","year":"2021","unstructured":"Henrique De Oliveira, Yuhta Ishii, and Xiao Lin. 2021. Robust merging of information. arXiv preprint arXiv:2106.00088 (2021)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-019-8208-z"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753688"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450066"},{"key":"e_1_3_2_1_14_1","volume-title":"Stochastic gradient boosting. Computational statistics & data analysis","author":"Friedman Jerome H","year":"2002","unstructured":"Jerome H Friedman. 2002. Stochastic gradient boosting. Computational statistics & data analysis, Vol. 38, 4 (2002), 367--378."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2702123.2702443"},{"key":"e_1_3_2_1_16_1","unstructured":"Yongkang Guo Jason D. Hartline Zhihuan Huang Yuqing Kong Anant Shah and Fang-Yi Yu. 2024. Algorithmic Robust Forecast Aggregation. arxiv: 2401.17743 [cs.LG]"},{"key":"e_1_3_2_1_17_1","volume-title":"Truthful information elicitation from hybrid crowds. arXiv preprint arXiv:2107.10119","author":"Han Qishen","year":"2021","unstructured":"Qishen Han, Sikai Ruan, Yuqing Kong, Ao Liu, Farhad Mohsin, and Lirong Xia. 2021. Truthful information elicitation from hybrid crowds. arXiv preprint arXiv:2107.10119 (2021)."},{"key":"e_1_3_2_1_18_1","volume-title":"Multi-class adaboost. Statistics and its Interface","author":"Hastie Trevor","year":"2009","unstructured":"Trevor Hastie, Saharon Rosset, Ji Zhu, and Hui Zou. 2009. Multi-class adaboost. Statistics and its Interface, Vol. 2, 3 (2009), 349--360."},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of 3rd international conference on document analysis and recognition","volume":"1","author":"Ho Tin Kam","year":"1995","unstructured":"Tin Kam Ho. 1995. Random decision forests. In Proceedings of 3rd international conference on document analysis and recognition, Vol. 1. IEEE, 278--282."},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 1120--1130","author":"Hovy Dirk","year":"2013","unstructured":"Dirk Hovy, Taylor Berg-Kirkpatrick, Ashish Vaswani, and Eduard Hovy. 2013. Learning whom to trust with MACE. In Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 1120--1130."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3122009.3176837"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00057"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2006.04.001"},{"key":"e_1_3_2_1_24_1","volume-title":"International Conference on Machine Learning. PMLR, 2708--2717","author":"Kleindessner Matth\u00e4us","year":"2018","unstructured":"Matth\u00e4us Kleindessner and Pranjal Awasthi. 2018. Crowdsourcing with arbitrary adversaries. In International Conference on Machine Learning. PMLR, 2708--2717."},{"key":"e_1_3_2_1_25_1","unstructured":"Alex Krizhevsky Geoffrey Hinton et al. 2009. Learning multiple layers of features from tiny images. (2009)."},{"key":"e_1_3_2_1_26_1","volume-title":"SIGIR 2010 workshop on crowdsourcing for search evaluation","volume":"2126","author":"Le John","year":"2010","unstructured":"John Le, Andy Edmonds, Vaughn Hester, and Lukas Biewald. 2010. Ensuring quality in crowdsourced search relevance evaluation: The effects of training question distribution. In SIGIR 2010 workshop on crowdsourcing for search evaluation, Vol. 2126. 22--32."},{"key":"e_1_3_2_1_27_1","first-page":"21841","article-title":"Adversarial crowdsourcing through robust rank-one matrix completion","volume":"33","author":"Ma Qianqian","year":"2020","unstructured":"Qianqian Ma and Alex Olshevsky. 2020. Adversarial crowdsourcing through robust rank-one matrix completion. Advances in Neural Information Processing Systems, Vol. 33 (2020), 21841--21852.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186032"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538243"},{"key":"e_1_3_2_1_30_1","unstructured":"David Page. 2018. cifar10-fast. https:\/\/github.com\/davidcpage\/cifar10-fast."},{"key":"e_1_3_2_1_31_1","volume-title":"Robust Decision Aggregation with Second-order Information. arXiv preprint arXiv:2311.14094","author":"Pan Yuqi","year":"2023","unstructured":"Yuqi Pan, Zhaohua Chen, and Yuqing Kong. 2023. Robust Decision Aggregation with Second-order Information. arXiv preprint arXiv:2311.14094 (2023)."},{"key":"e_1_3_2_1_32_1","volume-title":"The strength of weak learnability. Machine learning","author":"Schapire Robert E","year":"1990","unstructured":"Robert E Schapire. 1990. The strength of weak learnability. Machine learning, Vol. 5 (1990), 197--227."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449840"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the 2008 conference on empirical methods in natural language processing. 254--263","author":"Snow Rion","year":"2008","unstructured":"Rion Snow, Brendan O'connor, Dan Jurafsky, and Andrew Y Ng. 2008. Cheap and fast--but is it good? evaluating non-expert annotations for natural language tasks. In Proceedings of the 2008 conference on empirical methods in natural language processing. 254--263."},{"key":"e_1_3_2_1_35_1","volume-title":"Advances in Neural Information Processing Systems","volume":"29","author":"Steinhardt Jacob","year":"2016","unstructured":"Jacob Steinhardt, Gregory Valiant, and Moses Charikar. 2016. Avoiding imposters and delinquents: Adversarial crowdsourcing and peer prediction. Advances in Neural Information Processing Systems, Vol. 29 (2016)."},{"key":"e_1_3_2_1_36_1","volume-title":"Proc. ACM SIGIR Workshop on Crowdsourcing for Information Retrieval (CIR'11)","author":"Vuurens Jeroen","year":"2011","unstructured":"Jeroen Vuurens, Arjen P de Vries, and Carsten Eickhoff. 2011. How much spam can you take? An analysis of crowdsourcing results to increase accuracy. In Proc. ACM SIGIR Workshop on Crowdsourcing for Information Retrieval (CIR'11). 21--26."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133039"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Mengchen Zhao Bo An Wei Gao and Teng Zhang. 2017. Efficient label contamination attacks against black-box learning models.. In IJCAI. 3945--3951.","DOI":"10.24963\/ijcai.2017\/551"}],"event":{"name":"WWW '25: The ACM Web Conference 2025","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Sydney NSW Australia","acronym":"WWW '25"},"container-title":["Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714557","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696410.3714557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:33Z","timestamp":1750295913000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":38,"alternative-id":["10.1145\/3696410.3714557","10.1145\/3696410"],"URL":"https:\/\/doi.org\/10.1145\/3696410.3714557","relation":{},"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"2025-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}