Missing Pattern Recognized Diffusion Imputation Model for Missing Not At Random

• URL: http://arxiv.org/abs/2605.25439v1
• Date: Mon, 25 May 2026 05:29:59 GMT
• Title: Missing Pattern Recognized Diffusion Imputation Model for Missing Not At Random
• Abstract summary: We introduce the Missing Pattern Recognized Diffusion Imputation Model (PRDIM)<n>PRDIM captures the missing pattern and precisely imputes unobserved values.<n>We demonstrate that PRDIM consistently achieves strong imputation performance under MNAR settings.
• Score: 26.07283859053491
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Missing data frequently arises across diverse domains, including time-series and image domains. In the real world, missing occurrences often depend on the unobservable values themselves, which are referred to as Missing Not at Random (MNAR). In this work, we introduce the Missing Pattern Recognized Diffusion Imputation Model (PRDIM), a novel framework that explicitly captures the missing pattern and precisely imputes unobserved values. PRDIM iteratively maximizes the likelihood of the joint distribution for observed values and missing mask under an Expectation-Maximization (EM) algorithm. In this sense, we first employ a pattern recognizer, which approximates the underlying missing pattern and provides guidance during every inference toward more plausible imputations with respect to the missing information. Through extensive experiments, we demonstrate that PRDIM consistently achieves strong imputation performance under MNAR settings across multiple data modalities.

Related papers

• Impute-EM: Native Mixed-State Diffusion Models for Heterogeneous Data Imputation [71.74203645336385]
  Impute-EM alternates between imputing missing entries with the current model and refitting a diffusion backbone on completed data.<n>We characterize the update and show that the observed mask-indexed marginals match the targets at the limit.
  arXiv  Detail & Related papers  (2026-09-14T09:39:13Z)
• PAMF: Prior-Aware Multimodal Fusion for Incomplete Time Series Data [37.71457191016947]
  We present PAMF, a multimodal time-series framework that handles different missingness patterns.<n>We show that it achieves the strongest overall downstream performance across diverse datasets and missing settings.
  arXiv  Detail & Related papers  (2026-06-04T16:04:21Z)
• LEFT: Learnable Fusion of Tri-view Tokens for Unsupervised Time Series Anomaly Detection [53.191369031661885]
  Unsupervised time series anomaly detection aims to build a model for identifying abnormal timestamps without assuming the availability of annotations.<n>We present Learnable Fusion of Tri-view Tokens (LEFT), a unified unsupervised TSAD framework that models anomalies as inconsistencies across complementary representations.<n>Experiments on real-world benchmarks show that LEFT yields the best detection accuracy against SOTA baselines, while achieving a 5x reduction on FLOPs and 8x speed-up for training.
  arXiv  Detail & Related papers  (2026-02-09T13:33:49Z)
• Revisiting Multivariate Time Series Forecasting with Missing Values [65.30332997607141]
  Missing values are common in real-world time series.<n>Current approaches have developed an imputation-then-prediction framework that uses imputation modules to fill in missing values, followed by forecasting on the imputed data.<n>This framework overlooks a critical issue: there is no ground truth for the missing values, making the imputation process susceptible to errors that can degrade prediction accuracy.<n>We introduce Consistency-Regularized Information Bottleneck (CRIB), a novel framework built on the Information Bottleneck principle.
  arXiv  Detail & Related papers  (2025-09-27T20:57:48Z)
• Recursive Equations For Imputation Of Missing Not At Random Data With Sparse Pattern Support [8.863778901027061]
  A common approach for handling missing values in data analysis pipelines is multiple imputation via software packages.<n>We develop a new characterization for the full data law in graphical models of missing data.<n>We show MISPR obtains comparable results to MICE when data are MAR, and superior, less biased results when data are MNAR.
  arXiv  Detail & Related papers  (2025-07-21T23:18:36Z)
• Ranked from Within: Ranking Large Multimodal Models Without Labels [73.96543593298426]
  We show that uncertainty scores derived from softmax distributions provide a robust basis for ranking models across various tasks.<n>This facilitates the ranking of LMMs on unlabeled data, providing a practical approach for selecting models for diverse target domains without requiring manual annotation.
  arXiv  Detail & Related papers  (2024-12-09T13:05:43Z)
• Graph Spatiotemporal Process for Multivariate Time Series Anomaly Detection with Missing Values [67.76168547245237]
  We introduce a novel framework called GST-Pro, which utilizes a graphtemporal process and anomaly scorer to detect anomalies. Our experimental results show that the GST-Pro method can effectively detect anomalies in time series data and outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-01-11T10:10:16Z)
• Deep Ensembles Meets Quantile Regression: Uncertainty-aware Imputation for Time Series [45.76310830281876]
  We propose Quantile Sub-Ensembles, a novel method to estimate uncertainty with ensemble of quantile-regression-based task networks. Our method not only produces accurate imputations that is robust to high missing rates, but also is computationally efficient due to the fast training of its non-generative model.
  arXiv  Detail & Related papers  (2023-12-03T05:52:30Z)
• Deep Generative Imputation Model for Missing Not At Random Data [13.56794299885683]
  We exploit a deep generative imputation model, namely GNR, to process the real-world missing mechanism in the latent space. The experimental results show that our GNR surpasses state-of-the-art MNAR baselines with significant margins.
  arXiv  Detail & Related papers  (2023-08-16T06:01:12Z)
• MissDAG: Causal Discovery in the Presence of Missing Data with Continuous Additive Noise Models [78.72682320019737]
  We develop a general method, which we call MissDAG, to perform causal discovery from data with incomplete observations. MissDAG maximizes the expected likelihood of the visible part of observations under the expectation-maximization framework. We demonstrate the flexibility of MissDAG for incorporating various causal discovery algorithms and its efficacy through extensive simulations and real data experiments.
  arXiv  Detail & Related papers  (2022-05-27T09:59:46Z)
• Learning Hidden Markov Models When the Locations of Missing Observations are Unknown [54.40592050737724]
  We consider the general problem of learning an HMM from data with unknown missing observation locations. We provide reconstruction algorithms that do not require any assumptions about the structure of the underlying chain. We show that under proper specifications one can reconstruct the process dynamics as well as if the missing observations positions were known.
  arXiv  Detail & Related papers  (2022-03-12T22:40:43Z)
• Model-based Clustering with Missing Not At Random Data [0.8777702580252754]
  We propose model-based clustering algorithms designed to handle very general types of missing data, including MNAR data. Several MNAR models are discussed, for which the cause of the missingness can depend on both the values of the missing variable themselves and on the class membership. We focus on a specific MNAR model, called MNARz, for which the missingness only depends on the class membership.
  arXiv  Detail & Related papers  (2021-12-20T09:52:12Z)
• Identifiable Generative Models for Missing Not at Random Data Imputation [13.790820495804567]
  Many imputation methods do not take into account the missingness mechanism, resulting in biased imputation values when MNAR data is present. In this work, we analyze the identifiability of generative models under MNAR. We propose a practical deep generative model which can provide identifiability guarantees under mild assumptions.
  arXiv  Detail & Related papers  (2021-10-27T18:51:38Z)
• NeuMiss networks: differentiable programming for supervised learning with missing values [0.0]
  We derive the analytical form of the optimal predictor under a linearity assumption. We propose a new principled architecture, named NeuMiss networks. They have good predictive accuracy with both a number of parameters and a computational complexity independent of the number of missing data patterns.
  arXiv  Detail & Related papers  (2020-07-03T11:42:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.