SearcharxivSearch

arXiv · 2301.01549

Matching Using Sufficient Dimension Reduction for Heterogeneity Causal Effect Estimation

Abstract

Causal inference plays an important role in under standing the underlying mechanisation of the data generation process across various domains. It is challenging to estimate the average causal effect and individual causal effects from observational data with high-dimensional covariates due to the curse of dimension and the problem of data sufficiency. The existing matching methods can not effectively estimate individual causal effect or solve the problem of dimension curse in causal inference. To address this challenge, in this work, we prove that the reduced set by sufficient dimension reduction (SDR) is a balance score for confounding adjustment. Under the theorem, we propose to use an SDR method to obtain a reduced representation set of the original covariates and then the reduced set is used for the matching method. In detail, a non-parametric model is used to learn such a reduced set and to avoid model specification errors. The experimental results on real-world datasets show that the proposed method outperforms the compared matching methods. Moreover, we conduct an experiment analysis and the results demonstrate that the reduced representation is enough to balance the imbalance between the treatment group and control group individuals.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haoran Zhao, Yinghao Zhang, Debo Cheng, Chen Li, Zaiwen Feng. 2023-01-04. Matching Using Sufficient Dimension Reduction for Heterogeneity Causal Effect Estimation. https://arxiv.org/abs/2301.01549

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS