quant-phMay 7, 2025

Quantum-Inspired Optimization Process for Data Imputation

Authors: Nishikanta Mohanty, Bikash K. Behera, Badshah Mukherjee, Pravat Dash, Christopher Ferrie

Organizations: Centre for Quantum Software and Information, University of Technology Sydney, Ultimo, Sydney 2007, NSW, Australia · Bikash’s Quantum (OPC) Pvt. Ltd., Mohanpur 741246, WB, India · SAS Middle East Fz-Llc, Dubai, UAE

Abstract

Data imputation is a critical preprocessing step, particularly in clinical datasets where missingness can bias downstream inference. We propose a quantum-inspired imputation framework and evaluate it on the UCI Pima Indians Diabetes dataset, where several physiological variables contain structural zeros that are treated as missing. The approach combines Principal Component Analysis (PCA) with quantum rotation-based reconstruction, where rotation angles are selected via gradient-free optimizers (Simulated Annealing, COBYLA, and Differential Evolution). For robustness, we retain the top three optimizer solutions per method and reconstruct missing values under distribution-aware bounds (e.g., ±2\pm 2 standard deviations) and avoid unrealistic collapse toward central tendency. We also benchmark against (i) classical baselines (Mean, KNN, MICE, Decision Tree), (ii) modern matrix/ML imputers (SoftImpute, MissForest, VAE), and (iii) rotation/PCA controls (random orthogonal rotations and bootstrap PCA). Across the evaluated features, quantum-inspired variants achieve substantially improved distributional fidelity under Wasserstein W1 relative to modern baselines (e.g., the best quantum setting reduces average W1 by ∼\sim66% vs. SoftImpute, ∼\sim84% vs. MissForest, and ∼\sim90% vs. VAE; and by ∼\sim60% vs. Mean imputation), while remaining competitive with strong classical/control configurations. Dispersion is better preserved under the quantum-inspired methods, with variance/SD ratios closer to the observed data than (SoftImpute, MissForest, and VAE) and typically better than (Mean, KNN, MICE, and Decision Tree) on average. Overall, the results support quantum-inspired, optimization-guided rotations as a statistically grounded and scalable strategy for realistic imputation in healthcare and general AI pipelines, with a design that can be mapped to future quantum hardware as it matures.

Figures & tables

Explore similar work

Oct 14, 2026

When Does Task-Aware Imputation Matter? An Analysis of Robustness Under Train-Test Mismatch

Missing data is a pervasive challenge in machine learning, often degrading predictive performance and complicating model deployment. Most existing approaches treat imputation as a preprocessing step independent of the downstream task, a separation that becomes problematic under train-test mismatches in missingness mechanisms or rates. We introduce a unified framework that treats missing entries as variables in a task-conditioned optimization problem. We instantiate this framework in two settings: an amortized approach for scenarios with missing data at both training and test time, and a latent optimization approach for settings where only training data is incomplete. The evaluation is conducted on 98 tabular datasets, and robustness under train-test mismatches is assessed on 36 datasets. Results reveal that reconstruction error constitutes a poor proxy for predictive utility (Spearman rho approximately 0.16 to 0.32), and that task-aware imputation becomes critical in scenarios where classical methods fail to recover complete-data performance, achieving win rates of up to 80% in challenging train-test mismatch scenarios.
Jul 3, 2026

Missing Data Imputation under Manifold Hypothesis

The manifold hypothesis posits that high-dimensional data are concentrated near a low-dimensional embedded manifold. Recent advances in mixture variational autoencoders (VAEs) provide a powerful tool for extracting such underlying structure in a faithful manner. The resulting geometric structure naturally introduces local and global relationships among variables, thereby providing a systematic way of imputing missing data. We propose a model-based imputation method that enables sampling from p(xmis∣xobs)p(\bm{x}_{\mathrm{mis}} \mid \bm{x}_{\mathrm{obs}}) via a sampling-importance-resampling (SIR) procedure, which can be further augmented with a joint diffusion model in the latent space. Our method imputes missing data while respecting the underlying geometry, achieves competitive performance compared to state-of-the-art procedures, quantifies uncertainty in the imputations, and is model-based, thereby enabling on-the-fly imputation without rerunning the entire procedure.
Jul 8, 2026

Imputation Meets Clustering: Exploiting Latent Subgroup Structure for Missing Data Recovery

Missing data is prevalent in practical applications, making effective imputation an essential preprocessing step for downstream analysis. Real-world datasets often exhibit complex latent structures composed of multiple subgroups with distinct distributions. However, existing methods often overlook such population heterogeneity. Without explicit structural guidance, these methods tend to produce generic estimates that blur subgroup boundaries and lack instance-level fidelity. While incorporating subgroup information offers a remedy, it faces a circular dependency: reliable subgroup identification requires complete data, while data completion is the imputation objective itself. To resolve this, we propose CAGI (Cluster-Aware Generative Imputation), a framework that reformulates clustering and imputation as a mutually reinforcing co-optimization process. CAGI employs a ``Partition-Guide-Restore'' strategy where dynamic cluster assignments act as local priors to condition a Generative Adversarial Network. An iterative feedback loop is established to progressively refine both cluster structures and imputed values toward faithful subgroup distributions. To ensure distributional stability, CAGI further employs a multi-level optimization objective combining instance-level reconstruction with distribution-level regularization. Extensive experiments on 14 benchmark datasets with 15 representative baselines demonstrate the superiority of CAGI. The source code is available at: https://github.com/supercocachii/CAGI