mlsanityData to 7 Oct 2026

Differentiable and Scalable Generative Adversarial Models for Data Imputation

arXiv 2201.03202 ↗First posted 10 Jan 2022cs.LG cs.DBcited by 5

Not on the map. Why?

Abstract (arXiv)

Data imputation has been extensively explored to solve the missing data problem. The dramatically increasing volume of incomplete data makes the imputation models computationally infeasible in many real-life applications. In this paper, we propose an effective scalable imputation system named SCIS to significantly speed up the training of the differentiable generative adversarial imputation models under accuracy-guarantees for large-scale incomplete data. SCIS consists of two modules, differentiable imputation modeling (DIM) and sample size estimation (SSE). DIM leverages a new masking Sinkhorn divergence function to make an arbitrary generative adversarial imputation model differentiable, while for such a differentiable imputation model, SSE can estimate an appropriate sample size to ensure the user-specified imputation accuracy of the final model. Extensive experiments upon several real-life large-scale datasets demonstrate that, our proposed system can accelerate the generative adversarial model training by 7.1x. Using around 7.6% samples, SCIS yields competitive accuracy with the state-of-the-art imputation methods in a much shorter computation time.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 20 of its 62 references that are in the map. First posted on arXiv 10 Jan 2022.

Builds on

20 of 62 references.

References · 20

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2016An overview of gradient descent optimization algorithmscited by 1,021
  3. 2017Towards Principled Methods for Training Generative Adversarial Networkscited by 460
  4. 2016SeqGAN: Sequence Generative Adversarial Nets with Policy Gradientcited by 375
  5. 2018GAIN: Missing Data Imputation using Generative Adversarial Netscited by 349
  6. 2018BRITS: Bidirectional Recurrent Imputation for Time Seriescited by 288
  7. 2013Fast Computation of Wasserstein Barycenterscited by 216
  8. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
  9. 2018Handling Incomplete Heterogeneous Data using VAEscited by 148
  10. 2018Improving GANs Using Optimal Transportcited by 122
  11. 2017The Cramer Distance as a Solution to Biased Wasserstein Gradientscited by 116
  12. 2020Missing Data Imputation using Optimal Transportcited by 99
8 more
  1. 2018EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAEcited by 85
  2. 2017HoloClean: Holistic Data Repairs with Probabilistic Inferencecited by 79
  3. 2020not-MIWAE: Deep Generative Modelling with Missing not at Random Datacited by 61
  4. 2019Missing Data Imputation with Adversarially-trained Graph Convolutional Networkscited by 54
  5. 2017MIDA: Multiple Imputation using Denoising Autoencoderscited by 20
  6. 2020Learning Individual Models for Imputation (Technical Report)cited by 7
  7. 2018BlinkML: Efficient Maximum Likelihood Estimation with Probabilistic Guaranteescited by 4
  8. 2019Efficient Computation of Hessian Matrices in TensorFlowcited by 2

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 3; 2025: 1.

5 papers.