paper-with-me

Papers

Crowdsourcing Feature Discovery via Adaptively Chosen Comparisons

2015-03-31 · James Y. Zou, Kamalika Chaudhuri, Adam Tauman Kalai

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.

📄 PDF Abstract BibTeX arXiv:1504.00064

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Preventing False Discovery in Interactive Data Analysis is Hard

2014-08-06 · Moritz Hardt, Jonathan Ullman

We show that, under a standard hardness assumption, there is no computationally efficient algorithm that given $n$ samples from an unknown distribution can give valid answers to $n^{3+o(1)}$ adaptively chosen statistical…

valid

Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery

2014-10-05 · Thomas Steinke, Jonathan Ullman

We show an essentially tight bound on the number of adaptively chosen statistical queries that a computationally efficient algorithm can answer accurately given $n$ samples from an unknown distribution. A statistical que…

valid

Implicitly Abusive Comparisons -- A New Dataset and Linguistic Analysis

2021-04-01 · EACL 2021 2 · Michael Wiegand, Maja Geulig, Josef Ruppenhofer

We examine the task of detecting implicitly abusive comparisons (e.g. {``}Your hair looks like you have been electrocuted{''}). Implicitly abusive comparisons are abusive comparisons in which abusive words (e.g. {``}dumb…

Active Ranking using Pairwise Comparisons

2011-09-16 · NeurIPS 2011 12 · Kevin G. Jamieson, Robert D. Nowak

This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of $n$ objects can be identified by standard sorting methods using $n log_2…

Generalization for Adaptively-chosen Estimators via Stable Median

2017-06-15 · Vitaly Feldman, Thomas Steinke

Datasets are often reused to perform multiple statistical analyses in an adaptive way, in which each analysis may depend on the outcomes of previous analyses on the same dataset. Standard statistical guarantees do not ac…