Pradeep Ravikumar, Maria-Florina Balcan, Rattana Pukdee, Dylan Sam
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2210.03594")
get_code_for_paper("2210.03594")
have("2210.03594")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2210.03594.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2210.03594)
Connect an agent — have() is free.