Events Calendar

CS Colloquium: Sewoong Oh (UIUC) - Fundamental Limits and Efficient Algorithms in Adaptive Crowdsourcing

Speaker: Sewoong Oh , UIUC

Talk Title: Fundamental Limits and Efficient Algorithms in Adaptive Crowdsourcing

Series: Yahoo! Labs Machine Learning Seminar Series

Abstract: This lecture satisfies requirements for CSCI 591: Computer Science Research Colloquium. Part of Yahoo! Labs Machine Learning Seminar Series.

Adaptive schemes, where tasks are assigned based on the data collected thus far, are widely used in practical crowdsourcing systems to efficiently allocate the budget. However, existing theoretical analyses of crowdsourcing systems suggest that the gain of adaptive task assignments is minimal. To bridge this gap, we propose a new model for representing practical crowdsourcing systems, which strictly generalizes the popular Dawid-Skene model, and characterize the fundamental trade-off between budget and accuracy. We introduce a novel adaptive scheme that matches this fundamental limit. We introduce new techniques to analyze the spectral analyses of non-back-tracking operators, using density evolution techniques from coding theory.

Biography: Sewoong Oh is an Assistant Professor of Industrial and Enterprise Systems Engineering at UIUC. He received his PhD from the department of Electrical Engineering at Stanford University. Following his PhD, he worked as a postdoctoral researcher at Laboratory for Information and Decision Systems (LIDS) at MIT. He was co-awarded the Kenneth C. Sevcik outstanding student paper award at the Sigmetrics 2010, the best paper award at the SIGMETRICS 2015, and NSF CAREER award in 2016.

Host: Yan Liu

Location: Henry Salvatori Computer Science Center (SAL) - 101

Audiences: Everyone Is Invited

Contact: Assistant to CS chair