Causal Effect Estimation Using Random Hyperplane Tessellations
Matching is one of the simplest approaches for estimating causal effects from observational data. Matching techniques compare the observed outcomes across pairs of individuals with similar covariate values but different treatment statuses in order to estimate causal effects. However, traditional matching techniques are unreliable given high-dimensional covariates due to the infamous curse of dimensionality. To overcome this challenge, we propose a simple, fast, yet highly effective approach to matching using Random Hyperplane Tessellations (RHPT). First, we prove that the RHPT representation is an approximate balancing score -- thus maintaining the strong ignorability assumption -- and provide empirical evidence for this claim. Second, we report results of extensive experiments showing that matching using RHPT outperforms traditional matching techniques and is competitive with state-of-the-art deep learning methods for causal effect estimation. In addition, RHPT avoids the need for computationally expensive training of deep neural networks.
Code (1)
Similar Papers 제목 키워드 기반
Minimax Rates for High-Dimensional Random Tessellation Forests
Random forests are a popular class of algorithms used for regression and classification. The algorithm introduced by Breiman in 2001 and many of its variants are ensembles of randomized decision trees built from axis-ali…
Learning TheoryVocal Bursts Intensity PredictionBinary AddiVortes: (Bayesian) Additive Voronoi Tessellations for Binary Classification with an application to Predicting Home Mortgage Application Outcomes
The Additive Voronoi Tessellations (AddiVortes) model is a multivariate regression model that uses multiple Voronoi tessellations to partition the covariate space for an additive ensemble model. In this paper, the AddiVo…
Binary ClassificationData AugmentationDecision MakingregressionExploration of Gibbs-Laguerre tessellations for three-dimensional stochastic modeling
Random tessellations are well suited for probabilistic modeling of three-dimensional (3D) grain microstructures of polycrystalline materials. The present paper is focused on so-called Gibbs-Laguerre tessellations, in whi…
Robust Visual Tracking Using Oblique Random Forests
Random forest has emerged as a powerful classification technique with promising results in various vision tasks including image classification, pose estimation and object detection. However, current techniques have shown…
General Classificationimage-classificationImage ClassificationIncremental Learning+4The Uniformly Rotated Mondrian Kernel
Random feature maps are used to decrease the computational cost of kernel machines in large-scale problems. The Mondrian kernel is one such example of a fast random feature approximation of the Laplace kernel, generated …