arXiv AI By Pegah Golchian, Jan Kapar, David S. Watson, Marvin N. Wright

Missing value imputation with adversarial random forests - MissARF

Read the original on arXiv AI →

The paper introduces MissARF, a new imputation technique that uses adversarial random forests (ARF) for density estimation and data synthesis. MissARF can perform both single and multiple imputations by sampling from the conditional distribution estimated by ARF, conditioned on observed values. Experiments show that MissARF achieves imputation quality comparable to leading methods while offering faster runtimes and no extra cost for multiple imputations.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Oct 2

Hybrid Methods for Robust Tabular Data Imputation

The paper introduces two hybrid imputation methods, NuclearForest and SoftForest, that combine a low‑rank initialization (using Singular Value Thresholding or SoftImpute) with a single Random Forest refinement. These methods capture global covariance patterns and local nonlinear dependencies, respectively, and are benchmarked against seven existing techniques across MCAR, MAR, and MNAR scenarios. Results show comparable or superior imputation accuracy to state‑of‑the‑art iterative methods while achieving significant speedups of roughly 5.8× and 9.5× over MissForest.

By Jinwei Li, Michelle Bruch, Daniel Tenbrinck
Hugging Face Trending Papers
Aug 6

Handling Missing Data in Probabilistic Regression Trees

Probabilistic Regression Trees (PRTrees) are a smooth and consistent alternative to classical regression trees, producing continuous predictions through probabilistic split assignments. This paper extends the PRTree framework to accommodate missing predictor values directly during tree construction, eliminating the need for prior imputation.

arXiv Machine Learning
Aug 7

Handling Missing Data in Probabilistic Regression Trees

arXiv:2608. 06195v1 Announce Type: cross Abstract: Probabilistic Regression Trees (PRTrees) are a smooth and consistent alternative to classical regression trees, producing continuous predictions through probabilistic split assignments.

By Taiane Schaedler Prass, Alisson Silva Neimaier, Guilherme Pumi
arXiv AI
Sep 21

A Hybrid Computational Intelligence Framework for scRNA-seq Imputation: Integrating scRecover and Random Forests

The paper introduces SCR-MF, a two‑stage workflow for single‑cell RNA sequencing imputation that first detects dropout events with scRecover and then imputes missing values using the non‑parametric missForest algorithm. Benchmarking on public and simulated datasets shows that SCR‑MF delivers robust, interpretable results that match or surpass existing methods while maintaining biological fidelity. Runtime analysis indicates that SCR‑MF balances accuracy with computational efficiency, making it well suited for mid‑scale single‑cell studies.

By Ali Anaissi, Deshao Liu, Yuanzhe Jia, Weidong Huang, Widad Alyassine, Junaid Akram