LGMLNov 5, 2016

Class-prior Estimation for Learning from Positive and Unlabeled Data

arXiv:1611.01586v1176 citations
Originality Incremental advance
AI Analysis

This work addresses a practical challenge in machine learning for scenarios with limited labeled data, offering an incremental improvement over existing methods by enabling class-prior estimation without requiring negative samples.

The paper tackles the problem of estimating class priors in unlabeled datasets when only positive samples are available, proposing a method that uses penalized divergences to correct for missing negative samples, resulting in a computationally efficient algorithm with theoretical guarantees and experimental validation.

We consider the problem of estimating the class prior in an unlabeled dataset. Under the assumption that an additional labeled dataset is available, the class prior can be estimated by fitting a mixture of class-wise data distributions to the unlabeled data distribution. However, in practice, such an additional labeled dataset is often not available. In this paper, we show that, with additional samples coming only from the positive class, the class prior of the unlabeled dataset can be estimated correctly. Our key idea is to use properly penalized divergences for model fitting to cancel the error caused by the absence of negative samples. We further show that the use of the penalized $L_1$-distance gives a computationally efficient algorithm with an analytic solution. The consistency, stability, and estimation error are theoretically analyzed. Finally, we experimentally demonstrate the usefulness of the proposed method.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes