mlsanityData to 7 Oct 2026

Crowdsourcing Feature Discovery via Adaptively Chosen Comparisons

arXiv 1504.00064 ↗First posted 31 Mar 2015stat.ML cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Mar 2015.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 0; 2025: 1.

5 papers.