acceptodds
Desk rejected at ICLR 2027

Minimal Repairs for Learning Over Incomplete Data

Desk rejected at ICLR 2027, so left out of the paper lists and the map.

Abstract

Missing data often exists in real-world datasets, requiring significant time and effort for data repair to learn accurate models. In this paper, we show that imputing all missing values is not always necessary to achieve an accurate ML model. We introduce concepts of minimal and almost minimal repair, which are subsets of missing data items in training data whose imputation delivers accurate and reasonably accurate models, respectively. Imputing these subsets can significantly reduce the time, computational resources, and manual effort required for learning. We show that finding these subsets is NP-hard for some popular models and propose efficient approximation algorithms for wide range of models. Our extensive experiments indicate that our proposed algorithms can substantially reduce the time and effort required to learn on incomplete datasets.

Primary area:
unsupervised, self-supervised, semi-supervised, and supervised representation learning
Keywords:
ML over incomplete data, Uncertainty in ML, Supervised ML

Related papers

Discussion (0)

Sign in to comment.