Bandit Label Inference for Weakly Supervised Learning
Ke Li, Jitendra Malik

TL;DR
This paper introduces a versatile method that transforms any strong classifier into a weakly supervised one, adaptable to various regimes and data types, simplifying the application of weak supervision across different tasks.
Contribution
The authors propose a general-purpose approach that converts any off-the-shelf classifier into a weakly supervised model, flexible across different weak supervision regimes and data forms.
Findings
Achieves competitive results across multiple weak supervision regimes.
Simplifies the adaptation process for weakly supervised learning.
Demonstrates broad applicability of the proposed method.
Abstract
The scarcity of data annotated at the desired level of granularity is a recurring issue in many applications. Significant amounts of effort have been devoted to developing weakly supervised methods tailored to each individual setting, which are often carefully designed to take advantage of the particular properties of weak supervision regimes, form of available data and prior knowledge of the task at hand. Unfortunately, it is difficult to adapt these methods to new tasks and/or forms of data, which often require different weak supervision regimes or models. We present a general-purpose method that can solve any weakly supervised learning problem irrespective of the weak supervision regime or the model. The proposed method turns any off-the-shelf strongly supervised classifier into a weakly supervised classifier and allows the user to specify any arbitrary weakly supervision regime via…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Data Stream Mining Techniques · Machine Learning and Data Classification
