Missing value imputation with adversarial random forests -- MissARF

Pegah Golchian, Jan Kapar, David S. Watson, Marvin N. Wright
7/21/2025
stat.MLcs.AIcs.LG

No official code found. Best implementation: bips-hb/MissARF-imputation-benchmark (0 stars, last commit 2025-10-28).

Abstract

Handling missing values is a common challenge in biostatistical analyses, typically addressed by imputation methods. We propose a novel, fast, and easy-to-use imputation method called missing value imputation with adversarial random forests (MissARF), based on generative machine learning, that provides both single and multiple imputation. MissARF employs adversarial random forest (ARF) for density estimation and data synthesis. To impute a missing value of an observation, we condition on the non-missing values and sample from the estimated conditional distribution generated by ARF. Our experiments demonstrate that MissARF performs comparably to state-of-the-art single and multiple imputation methods in terms of imputation quality and fast runtime with no additional costs for multiple imputation.

View on arXivView PDF

Code Implementations(1)

This repository contains the code and material to reproduce the results of the manuscript "Missing value imputation with adversarial random forests - MissARF". The paper is currently under review.

00RJul 21, 202511 months ago

Similar Papers

Cite this paper

@article{golchian2025missing,
  title  = {Missing value imputation with adversarial random forests -- MissARF},
  author = {Pegah Golchian and Jan Kapar and David S. Watson and Marvin N. Wright},
  year   = {2025},
  eprint = {2507.15681},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.15681v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.15681.svg)](https://codeofpaper.com/paper/2507.15681)

Discussion