Saved in:
Bibliographic Details
Main Authors: Wu, Jinran, Wang, You-Gan, McLachlan, Geoffrey J.
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2512.04392
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909976185798656
author Wu, Jinran
Wang, You-Gan
McLachlan, Geoffrey J.
author_facet Wu, Jinran
Wang, You-Gan
McLachlan, Geoffrey J.
contents Semi-supervised learning (SSL) constructs classifiers using both labelled and unlabelled data. It leverages information from labelled samples, whose acquisition is often costly or labour-intensive, together with unlabelled data to enhance prediction performance. This defines an incomplete-data problem, which statistically can be formulated within the likelihood framework for finite mixture models that can be fitted using the expectation-maximisation (EM) algorithm. Ideally, one would prefer a completely labelled sample, as one would anticipate that a labelled observation provides more information than an unlabelled one. However, when the mechanism governing label absence depends on the observed features or the class labels or both, the missingness indicators themselves contain useful information. In certain situations, the information gained from modelling the missing-label mechanism can even outweigh the loss due to missing labels, yielding a classifier with a smaller expected error than one based on a completely labelled sample analysed. This improvement arises particularly when class overlap is moderate, labelled data are sparse, and the missingness is informative. Modelling such informative missingness thus offers a coherent statistical framework that unifies likelihood-based inference with the behaviour of empirical SSL methods.
format Preprint
id arxiv_https___arxiv_org_abs_2512_04392
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Informative missingness and its implications in semi-supervised learning
Wu, Jinran
Wang, You-Gan
McLachlan, Geoffrey J.
Machine Learning
Semi-supervised learning (SSL) constructs classifiers using both labelled and unlabelled data. It leverages information from labelled samples, whose acquisition is often costly or labour-intensive, together with unlabelled data to enhance prediction performance. This defines an incomplete-data problem, which statistically can be formulated within the likelihood framework for finite mixture models that can be fitted using the expectation-maximisation (EM) algorithm. Ideally, one would prefer a completely labelled sample, as one would anticipate that a labelled observation provides more information than an unlabelled one. However, when the mechanism governing label absence depends on the observed features or the class labels or both, the missingness indicators themselves contain useful information. In certain situations, the information gained from modelling the missing-label mechanism can even outweigh the loss due to missing labels, yielding a classifier with a smaller expected error than one based on a completely labelled sample analysed. This improvement arises particularly when class overlap is moderate, labelled data are sparse, and the missingness is informative. Modelling such informative missingness thus offers a coherent statistical framework that unifies likelihood-based inference with the behaviour of empirical SSL methods.
title Informative missingness and its implications in semi-supervised learning
topic Machine Learning
url https://arxiv.org/abs/2512.04392