mlsanityData to 7 Oct 2026

Imputation and low-rank estimation with Missing Not At Random data

arXiv 1812.11409 ↗First posted 29 Dec 2018stat.ML cs.LGcited by 21

Not on the map. Why?

Abstract (arXiv)

Missing values challenge data analysis because many supervised and unsupervised learning methods cannot be applied directly to incomplete data. Matrix completion based on low-rank assumptions are very powerful solution for dealing with missing values. However, existing methods do not consider the case of informative missing values which are widely encountered in practice. This paper proposes matrix completion methods to recover Missing Not At Random (MNAR) data. Our first contribution is to suggest a model-based estimation strategy by modelling the missing mechanism distribution. An EM algorithm is then implemented, involving a Fast Iterative Soft-Thresholding Algorithm (FISTA). Our second contribution is to suggest a computationally efficient surrogate estimation by implicitly taking into account the joint distribution of the data and the missing mechanism: the data matrix is concatenated with the mask coding for the missing values; a low-rank structure for exponential family is assumed on this new matrix, in order to encode links between variables and missing mechanisms. The methodology that has the great advantage of handling different missing value mechanisms is robust to model specification errors.The performances of our methods are assessed on the real data collected from a trauma registry (TraumaBase ) containing clinical information about over twenty thousand severely traumatized patients in France. The aim is then to predict if the doctors should administrate tranexomic acid to patients with traumatic brain injury, that would limit excessive bleeding.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). First posted on arXiv 29 Dec 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 2; 2023: 4; 2024: 2; 2025: 5; 2026: 1.

21 papers.

Sort:

  1. 2021Causal Matrix Completioncited by 45
  2. 2021Identifiable Generative Models for Missing Not at Random Data Imputationcited by 30
  3. 2022Truncated tensor Schatten p-norm based approach for spatiotemporal traffic data imputation with complicated missing patternscited by 11
  4. 2021Be Causal: De-biasing Social Network Confounding in Recommendationcited by 9
  5. 2023Conformal link prediction for false discovery rate controlcited by 9
  6. 2024Symmetric Matrix Completion with ReLU Samplingcited by 4
  7. 2025Modeling Hierarchical Spaces: A Review and Unified Framework for Surrogate-Based Architecture Designcited by 3
  8. 2021Riemannian classification of EEG signals with missing valuescited by 2
  9. 2021Model-based Clustering with Missing Not At Random Datacited by 2
  10. 2023Density Ratio Estimation and Neyman Pearson Classification with Missing Datacited by 2
  11. 2025One Pipeline, Many Transformers: Pattern-Specific Imputation Specialists for Tabular Missing Datacited by 2
  12. 2023Exploiting Observation Bias to Improve Matrix Completioncited by 1
9 more
  1. 2024Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completioncited by 1
  2. 2025IVGAE: Handling Incomplete Heterogeneous Data with a Variational Graph Autoencodercited by 1
  3. 2021Time-Series Imputation with Wasserstein Interpolation for Optimal Look-Ahead-Bias and Variance Tradeoffcited by 0
  4. 2021Learning to Recommend Using Non-Uniform Datacited by 0
  5. 2022SparGE: Sparse Coding-based Patient Similarity Learning via Low-rank Constraints and Graph Embeddingcited by 0
  6. 2023Deep Generative Imputation Model for Missing Not At Random Datacited by 0
  7. 2025Computational Efficient and Minimax Optimal Nonignorable Matrix Completioncited by 0
  8. 2025Truncated Matrix Completion - An Empirical Studycited by 0
  9. 2026Causal Matrix Completion under Multiple Treatments via Mixed Synthetic Nearest Neighborscited by 0