Weak Supervision Performance Evaluation via Partial Identification

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Polo, Felipe Maia, Maity, Subha, Yurochkin, Mikhail, Banerjee, Moulinath, Sun, Yuekai
Format: Preprint
Veröffentlicht: 2023
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866917823616385024
author Polo, Felipe Maia
Maity, Subha
Yurochkin, Mikhail
Banerjee, Moulinath
Sun, Yuekai
author_facet Polo, Felipe Maia
Maity, Subha
Yurochkin, Mikhail
Banerjee, Moulinath
Sun, Yuekai
contents Programmatic Weak Supervision (PWS) enables supervised model training without direct access to ground truth labels, utilizing weak labels from heuristics, crowdsourcing, or pre-trained models. However, the absence of ground truth complicates model evaluation, as traditional metrics such as accuracy, precision, and recall cannot be directly calculated. In this work, we present a novel method to address this challenge by framing model evaluation as a partial identification problem and estimating performance bounds using Fréchet bounds. Our approach derives reliable bounds on key metrics without requiring labeled data, overcoming core limitations in current weak supervision evaluation techniques. Through scalable convex optimization, we obtain accurate and computationally efficient bounds for metrics including accuracy, precision, recall, and F1-score, even in high-dimensional settings. This framework offers a robust approach to assessing model quality without ground truth labels, enhancing the practicality of weakly supervised learning for real-world applications.
format Preprint
id arxiv_https___arxiv_org_abs_2312_04601
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Weak Supervision Performance Evaluation via Partial Identification
Polo, Felipe Maia
Maity, Subha
Yurochkin, Mikhail
Banerjee, Moulinath
Sun, Yuekai
Machine Learning
Artificial Intelligence
Methodology
Programmatic Weak Supervision (PWS) enables supervised model training without direct access to ground truth labels, utilizing weak labels from heuristics, crowdsourcing, or pre-trained models. However, the absence of ground truth complicates model evaluation, as traditional metrics such as accuracy, precision, and recall cannot be directly calculated. In this work, we present a novel method to address this challenge by framing model evaluation as a partial identification problem and estimating performance bounds using Fréchet bounds. Our approach derives reliable bounds on key metrics without requiring labeled data, overcoming core limitations in current weak supervision evaluation techniques. Through scalable convex optimization, we obtain accurate and computationally efficient bounds for metrics including accuracy, precision, recall, and F1-score, even in high-dimensional settings. This framework offers a robust approach to assessing model quality without ground truth labels, enhancing the practicality of weakly supervised learning for real-world applications.
title Weak Supervision Performance Evaluation via Partial Identification
topic Machine Learning
Artificial Intelligence
Methodology
url https://arxiv.org/abs/2312.04601