mlsanityData to 14 Oct 2026

Reliable Programmatic Weak Supervision with Confidence Intervals for Label Probabilities

arXiv 2508.03896 ↗First posted 5 Aug 2025stat.ML cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

The accurate labeling of datasets is often both costly and time-consuming. Given an unlabeled dataset, programmatic weak supervision obtains probabilistic predictions for the labels by leveraging multiple weak labeling functions (LFs) that provide rough guesses for labels. Weak LFs commonly provide guesses with assorted types and unknown interdependences that can result in unreliable predictions. Furthermore, existing techniques for programmatic weak supervision cannot provide assessments for the reliability of the probabilistic predictions for labels. This paper presents a methodology for programmatic weak supervision that can provide confidence intervals for label probabilities and obtain more reliable predictions. In particular, the methods proposed use uncertainty sets of distributions that encapsulate the information provided by LFs with unrestricted behavior and typology. Experiments on multiple benchmark datasets show the improvement of the presented methods over the state-of-the-art and the practicality of the confidence intervals presented.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 48 references that are in the map. First posted on arXiv 5 Aug 2025.

Builds on

27 of 48 references.

References · 27

  1. 2017Zero-Shot Learning -- A Comprehensive Evaluation of the Good, the Bad and the Uglycited by 538
  2. 2017Snorkel: Rapid Training Data Creation with Weak Supervisioncited by 372
  3. 2016Data Programming: Creating Large Training Sets, Quicklycited by 246
  4. 2016Variance-based regularization with convex objectivescited by 155
  5. 2022Selective-Supervised Contrastive Learning with Noisy Labelscited by 112
  6. 2021WRENCH: A Comprehensive Benchmark for Weak Supervisioncited by 96
  7. 2020Distribution-free binary classification: prediction sets, confidence intervals and calibrationcited by 79
  8. 2022A Survey on Programmatic Weak Supervisioncited by 66
  9. 2020Learning from Rules Generalizing Labeled Exemplarscited by 59
  10. 2017Learning the Structure of Generative Models without Labeled Datacited by 50
  11. 2020Denoising Multi-Source Weak Supervision for Neural Text Classificationcited by 42
  12. 2019Learning Dependency Structures for Weak Supervision Modelscited by 32
15 more
  1. 2021Universalizing Weak Supervisioncited by 27
  2. 2014Error Rate Bounds and Iterative Weighted Majority Voting for Crowdsourcingcited by 21
  3. 2019GOGGLES: Automatic Image Labeling with Affinity Codingcited by 19
  4. 2015Incremental Knowledge Base Construction Using DeepDivecited by 16
  5. 2019Wasserstein Adversarial Regularization (WAR) on label noisecited by 16
  6. 2022Learning Hyper Label Model for Programmatic Weak Supervisioncited by 16
  7. 2020Generalized Maximum Entropy for Supervised Classificationcited by 12
  8. 2020Minimax Classification with 0-1 Loss and Performance Guaranteescited by 11
  9. 2023Transferring Annotator- and Instance-dependent Transition Matrix for Learning from Crowdscited by 11
  10. 2022Lifting Weak Supervision To Structured Predictioncited by 10
  11. 2018Adversarial Label Learningcited by 9
  12. 2015Optimal Binary Classifier Aggregation for General Lossescited by 6
  13. 2022Leveraging Instance Features for Label Aggregation in Programmatic Weak Supervisioncited by 6
  14. 2023Minimax Forward and Backward Learning of Evolving Tasks with Performance Guaranteescited by 2
  15. 2024Convergence Behavior of an Adversarial Weak Supervision Methodcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.