On the Consistency of a Random Forest Algorithm in the Presence of Missing Entries

Abstract

This paper tackles the problem of constructing a non-parametric predictor when the latent variables are given with incomplete information. The convenient predictor for this task is the random forest algorithm in conjunction to the so-called CART criterion. The proposed technique enables a partial imputation of the missing values in the data set in a way that suits both a consistent estimator of the regression function as well as a partial recovery of the missing values. A proof of the consistency of the random forest estimator is given in the case where each latent variable is missing completely at random (MCAR).

References in corpus (8)

• On the consistency of supervised learning with missing values
• EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAE
• NeuMiss networks: differentiable programming for supervised learning with missing values
• Recovering Loss to Followup Information Using Denoising Autoencoders
• What's a good imputation to predict with missing values?
• not-MIWAE: Deep Generative Modelling with Missing not at Random Data
• Learning from Irregularly-Sampled Time Series: A Missing Data Perspective
• Linear predictor on linearly-generated data with missing values: non consistency and solutions