Crowdsourcing Feature Discovery via Adaptively Chosen Comparisons
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
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 0; 2025: 1.
5 papers.
- 2021The future of human-AI collaboration: a taxonomy of design knowledge for hybrid intelligence systemscited by 39
- 2023Optimal Sample Complexity of Contrastive Learningcited by 15
- 2022Knowledge Learning with Crowdsourcing: A Brief Review and Systematic Perspectivecited by 11
- 2022Improved Robust Algorithms for Learning with Discriminative Feature Feedbackcited by 1
- 2025Discriminative Feature Feedback with General Teacher Classescited by 0
- 2025Discriminative Feature Feedback with General Teacher Classes8 Oct 2025
- 2023Optimal Sample Complexity of Contrastive Learning1 Dec 2023
- 2022Improved Robust Algorithms for Learning with Discriminative Feature Feedback8 Sep 2022
- 2022Knowledge Learning with Crowdsourcing: A Brief Review and Systematic Perspective19 Jun 2022
- 2021The future of human-AI collaboration: a taxonomy of design knowledge for hybrid intelligence systems7 May 2021