Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shubhi Sareen

dblp:358/9675 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning paradigms · 67% Probabilistic and Bayesian machine learning · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
belief propagation
0.812024
Learning from Label Proportions: Bootstrapping Supervised Learners via Belief Propagation · ICLR 2024
Machine learning › Learning paradigms › weakly supervised learning
learning from label proportions
0.812024
Learning from Label Proportions: Bootstrapping Supervised Learners via Belief Propagation · ICLR 2024
Machine learning › Learning paradigms › semi-supervised learning
pseudo-labeling
0.812024
Learning from Label Proportions: Bootstrapping Supervised Learners via Belief Propagation · ICLR 2024

Methods — techniques the papers use, named apart from their topics

pseudo-labeling · 0.8gibbs distribution · 0.8belief propagation · 0.8
YearPublicationVenuePosition
2024 Learning from Label Proportions: Bootstrapping Supervised Learners via Belief Propagation
abstract
Learning from Label Proportions (LLP) is a learning problem where only aggregate level labels are available for groups of instances, called bags, during training, and the aim is to get the best performance at the instance-level on the test data. This setting arises in domains like advertising and medicine due to privacy considerations. We propose a novel algorithmic framework for this problem that iteratively performs two main steps. For the first step (Pseudo Labeling) in every iteration, we define a Gibbs distribution over binary instance labels that incorporates a) covariate information through the constraint that instances with similar covariates should have similar labels and b) the bag level aggregated label. We then use Belief Propagation (BP) to marginalize the Gibbs distribution to obtain pseudo labels. In the second step (Embedding Refinement), we use the pseudo labels to provide supervision for a learner that yields a better embedding. Further, we iterate on the two steps again by using the second step's embeddings as new covariates for the next iteration. In the final iteration, a classifier is trained using the pseudo labels. Our algorithm displays strong gains against several SOTA baselines (upto **15%**) for the LLP Binary Classification problem on various dataset types - tabular and Image. We achieve these improvements with minimal computational overhead above standard supervised learning due to Belief Propagation, for large bag sizes, even for a million samples.
Shreyas Havaldar, Navodita Sharma, Shubhi Sareen, Karthikeyan Shanmugam 0001, Aravindan Raghuveer
ICLR3