Crowdsourcing Feature Discovery via Adaptively Chosen Comparisons
James Y. Zou, Kamalika Chaudhuri, Adam Tauman Kalai

TL;DR
This paper presents an adaptive crowdsourcing method that efficiently uncovers underlying data features by asking comparative questions, outperforming nonadaptive approaches in terms of labor efficiency.
Contribution
The paper introduces a novel adaptive algorithm for feature discovery using crowdsourced similarity queries, demonstrating theoretical and experimental advantages over nonadaptive methods.
Findings
Adaptive algorithm recovers features with less labor
The method outperforms nonadaptive algorithms
Experimental results validate theoretical claims
Abstract
We introduce an unsupervised approach to efficiently discover the underlying features in a data set via crowdsourcing. Our queries ask crowd members to articulate a feature common to two out of three displayed examples. In addition we also ask the crowd to provide binary labels to the remaining examples based on the discovered features. The triples are chosen adaptively based on the labels of the previously discovered features on the data set. In two natural models of features, hierarchical and independent, we show that a simple adaptive algorithm, using "two-out-of-three" similarity queries, recovers all features with less labor than any nonadaptive algorithm. Experimental results validate the theoretical findings.
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.
