Pith. sign in

WeShap: Weak Supervision Source Evaluation with Shapley Values

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Efficient data annotation stands as a significant bottleneck in training contemporary machine learning models. The Programmatic Weak Supervision (PWS) pipeline presents a solution by utilizing multiple weak supervision sources to automatically label data, thereby expediting the annotation process. Given the varied contributions of these weak supervision sources to the accuracy of PWS, it is imperative to employ a robust and efficient metric for their evaluation. This is crucial not only for understanding the behavior and performance of the PWS pipeline but also for facilitating corrective measures. In our study, we introduce WeShap values as an evaluation metric, which quantifies the average contribution of weak supervision sources within a proxy PWS pipeline, leveraging the theoretical underpinnings of Shapley values. We demonstrate efficient computation of WeShap values using dynamic programming, achieving quadratic computational complexity relative to the number of weak supervision sources. Our experiments demonstrate the versatility of WeShap values across various applications, including the identification of beneficial or detrimental labeling functions, refinement of the PWS pipeline, and rectification of mislabeled data. Furthermore, WeShap values aid in comprehending the behavior of the PWS pipeline and scrutinizing specific instances of mislabeled data. Although initially derived from a specific proxy PWS pipeline, we empirically demonstrate the generalizability of WeShap values to other PWS pipeline configurations. Our findings indicate a noteworthy average improvement of 5.0 points in downstream model accuracy through the revision of the PWS pipeline compared to previous state-of-the-art methods, underscoring the efficacy of WeShap values in enhancing data quality for training machine learning models.

citation-role summary

background 1

citation-polarity summary

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Refining Labeling Functions with Limited Labeled Data

cs.LG · 2025-05-29 · conditional · novelty 6.0

RuleCleaner repairs weak-supervision labeling functions by minimally changing their outputs on a few labeled examples using a MILP plus rule-tree refinement, improving global labeling accuracy on most tested datasets.

citing papers explorer

Showing 1 of 1 citing paper.

  • Refining Labeling Functions with Limited Labeled Data cs.LG · 2025-05-29 · conditional · none · ref 12 · internal anchor

    RuleCleaner repairs weak-supervision labeling functions by minimally changing their outputs on a few labeled examples using a MILP plus rule-tree refinement, improving global labeling accuracy on most tested datasets.