Missing Data Imputation using Optimal Transport
arXiv:2002.03860
Abstract
Missing data is a crucial issue when applying machine learning algorithms to real-world datasets. Starting from the simple assumption that two batches extracted randomly from the same dataset should share the same distribution, we leverage optimal transport distances to quantify that criterion and turn it into a loss function to impute missing data values. We propose practical methods to minimize these losses using end-to-end learning, that can exploit or not parametric assumptions on the underlying distributions of values. We evaluate our methods on datasets from the UCI repository, in MCAR, MAR and MNAR settings. These experiments show that OT-based methods match or out-perform state-of-the-art imputation methods, even for high percentages of missing values.
References in corpus (9)
- Adam: A Method for Stochastic Optimization
- Scikit-learn: Machine Learning in Python
- Auto-Encoding Variational Bayes
- Fast Computation of Wasserstein Barycenters
- Learning with a Wasserstein Loss
- Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
- What Is Meant by "Missing at Random"?
- Improving GANs Using Optimal Transport
- Learning with minibatch Wasserstein : asymptotic and gradient properties
Cited by in corpus (6)
- Unbalanced minibatch Optimal Transport; applications to Domain Adaptation
- Data Imputation with Iterative Graph Reconstruction
- Deep Generative Imputation Model for Missing Not At Random Data
- Disambiguation of weak supervision with exponential convergence rates
- Naive imputation implicitly regularizes high-dimensional linear models
- Missingness Augmentation: A General Approach for Improving Generative Imputation Models