Label Propagation with Weak Supervision
Not on the map. Why?
Abstract (arXiv)
Semi-supervised learning and weakly supervised learning are important paradigms that aim to reduce the growing demand for labeled data in current machine learning applications. In this paper, we introduce a novel analysis of the classical label propagation algorithm (LPA) (Zhu & Ghahramani, 2002) that moreover takes advantage of useful prior information, specifically probabilistic hypothesized labels on the unlabeled data. We provide an error bound that exploits both the local geometric properties of the underlying graph and the quality of the prior information. We also propose a framework to incorporate multiple sources of noisy information. In particular, we consider the setting of weak supervision, where our sources of information are weak labelers. We demonstrate the ability of our approach on multiple benchmark weakly supervised classification tasks, showing improvements upon existing semi-supervised and weakly supervised methods.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 33 of its 52 references that are in the map. First posted on arXiv 7 Oct 2022.
Builds on
33 of 52 references.
References · 33
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
- 2016Temporal Ensembling for Semi-Supervised Learningcited by 1,054
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
- 2016Regularization With Stochastic Transformations and Perturbations for Deep Semi-Supervised Learningcited by 441
- 2017Snorkel: Rapid Training Data Creation with Weak Supervisioncited by 370
- 2021Provable Guarantees for Self-Supervised Deep Learning with Spectral Contrastive Losscited by 311
- 2015Deep Convolutional Networks on Graph-Structured Datacited by 246
21 more
- 2016Data Programming: Creating Large Training Sets, Quicklycited by 246
- 2014Learning with Pseudo-Ensemblescited by 241
- 2018Learning to Propagate Labels: Transductive Propagation Network for Few-shot Learningcited by 208
- 2020Combining Label Propagation and Simple Models Out-performs Graph Neural Networkscited by 199
- 2020Theoretical Analysis of Self-Training with Deep Networks on Unlabeled Datacited by 179
- 2020Algorithms with Predictionscited by 152
- 2018Training Complex Models with Multi-Task Weak Supervisioncited by 106
- 2018Learning random-walk label propagation for weakly-supervised semantic segmentationcited by 101
- 2020Unifying Graph Convolutional Neural Networks and Label Propagationcited by 98
- 2020Fast and Three-rious: Speeding Up Weak Supervision with Triplet Methodscited by 98
- 2021WRENCH: A Comprehensive Benchmark for Weak Supervisioncited by 95
- 2020Learning from Rules Generalizing Labeled Exemplarscited by 59
- 2020On the Equivalence of Decoupled Graph Convolution Network and Label Propagationcited by 49
- 2021A Theory of Label Propagation for Subpopulation Shiftcited by 48
- 2018Deep Metric Transfer for Label Propagation with Limited Annotated Datacited by 33
- 2022Learning Predictions for Algorithms with Predictionscited by 25
- 2021DP-SSL: Towards Robust Semi-supervised Learning with A Few Labeled Samplescited by 18
- 2022Shoring Up the Foundations: Fusing Model Embeddings and Weak Supervisioncited by 18
- 2020Constrained Labeling for Weakly Supervised Learningcited by 10
- 2013Scaling Graph-based Semi Supervised Learning to Large Number of Labels Using Count-Min Sketchcited by 6
- 2022Data Consistency for Weakly Supervised Learningcited by 2
Built on by
Citing papers per year: 2023: 4; 2024: 1; 2025: 3; 2026: 1.
9 papers.
- 2024Theoretical Analysis of Weak-to-Strong Generalizationcited by 46
- 2023Learning with Explanation Constraintscited by 8
- 2023Learning from Label Proportions: Bootstrapping Supervised Learners via Belief Propagationcited by 7
- 2023Embroid: Unsupervised Prediction Smoothing Can Improve Few-Shot Classificationcited by 3
- 2023How Graph Neural Networks Learn: Lessons from Training Dynamicscited by 3
- 2025Analyzing Similarity Metrics for Data Selection for Language Model Pretrainingcited by 3
- 2025Learning from Interval Targetscited by 1
- 2025Exploiting Vision Language Model for Training-Free 3D Point Cloud OOD Detection via Graph Score Propagationcited by 0
- 2026Fast Rates for Semi-Supervised Learning via Data-Augmentation Graph Regularizationcited by 0
- 2026Fast Rates for Semi-Supervised Learning via Data-Augmentation Graph Regularization8 Jul 2026
- 2025Learning from Interval Targets23 Oct 2025
- 2025Exploiting Vision Language Model for Training-Free 3D Point Cloud OOD Detection via Graph Score Propagation27 Jun 2025
- 2025Analyzing Similarity Metrics for Data Selection for Language Model Pretraining4 Feb 2025
- 2024Theoretical Analysis of Weak-to-Strong Generalization25 May 2024
- 2023Learning from Label Proportions: Bootstrapping Supervised Learners via Belief Propagation12 Oct 2023
- 2023How Graph Neural Networks Learn: Lessons from Training Dynamics8 Oct 2023
- 2023Embroid: Unsupervised Prediction Smoothing Can Improve Few-Shot Classification20 Jul 2023
- 2023Learning with Explanation Constraints25 Mar 2023