Interactive Weak Supervision: Learning Useful Heuristics for Data Labeling
Benedikt Boecking, Willie Neiswanger, Eric P. Xing, Artur Dubrawski
Abstract
Obtaining large annotated datasets is critical for training successful machine learning models and it is often a bottleneck in practice. Weak supervision offers a promising alternative for producing labeled datasets without ground truth annotations by generating probabilistic labels using multiple noisy heuristics. This process can scale to large datasets and has demonstrated state of the art performance in diverse domains such as healthcare and e-commerce. One practical issue with learning from user-generated heuristics is that their creation requires creativity, foresight, and domain expertise from those who hand-craft them, a process which can be tedious and subjective. We develop the first framework for interactive weak supervision in which a method proposes heuristics and learns from user feedback given on each proposed heuristic. Our experiments demonstrate that only a small number of feedback iterations are needed to train models that achieve highly competitive test set performance without access to ground truth training labels. We conduct user studies, which show that users are able to effectively provide feedback on heuristics and that test set results track the performance of simulated oracles.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 19326004-fe9e-4007-922b-8657bc82657aCited by top-tier papers22
- Adversarial training for high-stakes reliabilityDaniel M. Ziegler, Seraphina Nix, Lawrence Chan, Tim Bauman et al.NeurIPS 2022 · 79 citations
- End-to-End Weak SupervisionSalva Rühling Cachay, Benedikt Boecking, Artur DubrawskiNeurIPS 2021 · 48 citations
- Bayesian Algorithm Execution: Estimating Computable Properties of Black-box Functions Using Mutual InformationWillie Neiswanger, Ke Alexander Wang, Stefano ErmonICML 2021 · 40 citations
- DP-SSL: Towards Robust Semi-supervised Learning with A Few Labeled SamplesYi Xu, Jiandong Ding, Lu Zhang, Shuigeng ZhouNeurIPS 2021 · 34 citations
- Prompt-Based Rule Discovery and Boosting for Interactive Weakly-Supervised LearningRongzhi Zhang, Yue Yu, Pranav Shetty, Le Song et al.ACL 2022 · 29 citations
Builds on2
Related papers
- Nemo: Guiding and Contextualizing Weak Supervision for Interactive Data ProgrammingCheng-Yu Hsieh, Jieyu Zhang, Alexander J. RatnerVLDB 2022 · 17 citations
- Losses over Labels: Weakly Supervised Learning via Direct Loss ConstructionDylan Sam, J. Zico KolterAAAI 2023 · 14 citations
- Adaptive Rule Discovery for Labeling Text DataSainyam Galhotra, Behzad Golshan, Wang-Chiew TanSIGMOD 2021 · 14 citations
- Witan: Unsupervised Labelling Function Generation for Assisted Data ProgrammingBenjamin Denham, Edmund M.-K. Lai, Roopak Sinha, Muhammad Asif NaeemVLDB 2022 · 12 citations
- Universalizing Weak SupervisionChangho Shin, Winfred Li, Harit Vishwakarma, Nicholas Carl Roberts et al.ICLR 2022 · 35 citations
