Search arXiv⌕ Search

arXiv · 2609.38175

Proximal causal inference through cross-proxy balancing

Abstract

Proximal causal inference identifies causal effects in the presence of unmeasured confounding by drawing on two sets of proxy variables. Identification typically utilizes bridge functions, defined as solutions to integral equations. However, the mechanism by which fitted bridge functions correct for confounding bias remains opaque, offering little to interpret, inspect or stress-test. We show that the defining equation of a treatment bridge function is already a balance condition, with a cross-proxy form: the weights are functions of the treatment confounding proxies and covariates, and they balance the outcome confounding proxies and covariates (i.e., reweighting the distribution in a particular treatment arm to match the distribution across treatment arms). Several existing identification paths via a treatment bridge function can then be interpreted as providing conditions under which balance on the outcome proxies implies balance on the unobserved confounders, which we call balance propagation. Leveraging this framing, we show that estimation of the treatment bridge function is a type of balancing weight estimation. Finally, we show that an outcome-weighted estimator form can also be obtained for a large class of proximal estimators, including those that utilize an outcome bridge function. Using this framing, we provide conditions under which common estimators are numerically equivalent.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Grace V. Ringlein, Trang Q. Nguyen, Elizabeth A. Stuart, Harsh Parikh. 2026-09-29. Proximal causal inference through cross-proxy balancing. https://arxiv.org/abs/2609.38175

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

KEEP EXPLORING

Related papers

Delaunay Weighted Two-sample Test for High-dimensional Data by Incorporating Geometric Information

Two-sample hypothesis testing is a fundamental problem with various applications, which faces new challenges in the high-dimensional context. To mitigate the issue of the curse of dimensionality, high-dimensional data are typically assumed to lie on a low-dimensional manifold. To incorporate geometric information in the data, we propose to apply the Delaunay triangulation and develop the Delaunay weight to measure the geometric proximity among data points. In contrast to existing similarity measures that only utilize pairwise distances, the Delaunay weight can take both the distance and direction information into account. A detailed computation procedure is developed to learn the unknown manifold and approximate the Delaunay weight. We further propose a novel nonparametric test statistic using the Delaunay weight matrix. Asymptotic normality under the null and consistency under the alternative of the test statistic are developed. Applied to simulated data, the new test shows robustness to the learning of the unknown manifold and exhibits substantial power gain if the distributions differ in the principal directions of covariance matrices. The proposed test also detects significant differences on a real dataset of mice protein expression levels.

stat.ME↗

Randomization Tests in Switchback Experiments

Switchback experiments assign an experimental unit, such as a market or a platform, to treatment or control over successive blocks of time. Inference can be challenging because these experiments often contain only a small number of randomized blocks, while outcomes may exhibit serial dependence, seasonality, and treatment effects that persist across periods. We develop a conditional randomization test for the null of no total treatment effect that is finite-sample valid under standard assumptions on temporal interference without requiring a parametric model for outcomes. We also develop randomization tests for these assumptions: a carryover test that assesses whether past assignments continue to affect outcomes beyond a prespecified horizon and a non-anticipation test that assesses whether future assignments affect current outcomes. For hypotheses about average treatment effects, we establish asymptotic validity of studentized randomization tests under additional regularity conditions. Finally, we derive power approximations and characterize the tradeoffs between experimental design choices, the number of informative randomized comparisons, and statistical power. Numerical experiments with stylized potential outcomes and a dynamic rideshare model illustrate finite-sample performance and implications for experimental design.

stat.ME↗

Minimum Specification Perturbation: Robustness as Distance-to-Falsification in Causal Inference

Empirical causal claims depend on many analyst decisions, from selecting covariates to choosing estimators. Existing robustness tools summarize how results vary across these choices, but, to the best of our knowledge, do not answer: \textbf{How many analyst decisions must change to reach a specification, which is a set of choices, whose confidence interval (CI) contains zero?} We introduce \emph{Minimum Specification Perturbation (MSP)}, the smallest number of changes. MSP is small under the null, grows with effect strength and captures distance-to-falsification information that dispersion-based summaries cannot report; when making decisions under weak effects, an MSP-based rule yields lower false-positive rates than dispersion-based rules. We show that Fragility Index and MSP measure orthogonal vulnerabilities: fragility to influential observations need not imply fragility to specification choices. On the LaLonde benchmark, MSP = 1 implies that one decision change makes the CI contain zero. We further provide exact permutation calibration under randomization and characterize computation, showing tractable cases under additive structure and NP-hardness in general.

stat.ME↗