TL;DR
This paper introduces a novel graph neural network-based framework for missing data imputation that leverages adversarial training and graph autoencoders, outperforming existing methods especially with high missing data rates.
Contribution
It proposes a general GNN-based framework for missing data imputation using adversarial training, residual connections, and global statistics to enhance accuracy and robustness.
Findings
Outperforms state-of-the-art methods on large missing data scenarios.
Uses adversarial loss with Wasserstein metric to improve imputation quality.
Incorporates residual connections and global statistics for better performance.
Abstract
Missing data imputation (MDI) is a fundamental problem in many scientific disciplines. Popular methods for MDI use global statistics computed from the entire data set (e.g., the feature-wise medians), or build predictive models operating independently on every instance. In this paper we propose a more general framework for MDI, leveraging recent work in the field of graph neural networks (GNNs). We formulate the MDI task in terms of a graph denoising autoencoder, where each edge of the graph encodes the similarity between two patterns. A GNN encoder learns to build intermediate representations for each example by interleaving classical projection layers and locally combining information between neighbors, while another decoding GNN learns to reconstruct the full imputed data set from this intermediate embedding. In order to speed-up training and improve the performance, we use a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
