Metraipolis › archive › dc_4853600ae016

Hybrid Methods for Robust Tabular Data Imputation — arXiv:2609.39613

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39613
License (as archived)
CC0-1.0
Archived
2026-10-07T13:46:22.830Z
SHA-256 of the archived text
fd7016c7aa46dce29f5d8f3b05c3e12ebe521ab01786bca79afe22a2a2e26402
Stable URL of this page
https://metraipolis.com/documento/dc_4853600ae016

How to cite

Hybrid Methods for Robust Tabular Data Imputation — arXiv:2609.39613 — arXiv (en), https://arxiv.org/abs/2609.39613 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4853600ae016 (Metraipolis archive dc_4853600ae016, sha256 fd7016c7aa46dce29f5d8f3b05c3e12ebe521ab01786bca79afe22a2a2e26402)
BibTeX
@misc{dc4853600ae016,
  title = {Hybrid Methods for Robust Tabular Data Imputation — arXiv:2609.39613},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39613},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4853600ae016; sha256 fd7016c7aa46dce29f5d8f3b05c3e12ebe521ab01786bca79afe22a2a2e26402},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39613. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Missing data are a fundamental challenge in statistical analysis and machine learning, as the choice of imputation method substantially impacts downstream inference. In this work, we propose two hybrid imputation methods called NuclearForest and SoftForest, which combine nuclear-norm-based low-rank initialization using Singular Value Thresholding (SVT) and SoftImpute, respectively, with a non-iterative Random Forest refinement. For the SVT-based component, we further introduce an adaptive step-size rule, prove adaptive step-size bounds, and establish convergence for the corresponding zero-initialized iteration. The low-rank initialization provides a structured warm start that captures the global covariance patterns in the data, while the subsequent Random Forest step recovers residual nonlinear signals encoding local dependencies. We conduct an extensive benchmark on diverse datasets from different application domains, comparing the proposed methods with seven established imputation methods under the Missing Completely at Random (MCAR), Missing at Random (MAR), and Missing Not at Random (MNAR) mechanisms across varying missingness rates. Our results demonstrate that NuclearForest and SoftForest match or exceed the imputation fidelity of state-of-the-art iterative methods such as MissForest, while significantly reducing computational cost. In particular, they achieve speedups of approximately 5.81 times and 9.52 times over MissForest by replacing iterative cycles with a single refinement step. Our approach effectively exploits the low-rank structure of real-world tabular data and accommodates mixed-type variables, providing an efficient and robust solution for data imputation in bioinformatics, economics, and beyond.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-01 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.39613 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T13:18:10.414Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).