analiza aiqbench
The paper tackles causal effect estimation when some confounders are unobserved, using negative controls and "bridge functions." Its main move is to replace the completeness and uniqueness conditions used in earlier work with an existence assumption, and to estimate the bridge functions with minimax learning that accommodates kernel methods and neural networks. For ML readers, the value lies in the identification argument and the finite-sample guarantees, which show when flexible learners can be trusted in a causal setting.
Causal Inference Under Unmeasured Confounding With Negative Controls: A Minimax Learning Approach
arXiv:2103.14029v5 Announce Type: replace-cross Abstract: We study the estimation of causal parameters when not all confounders are observed and instead negative controls are available. Recent work has shown how these can enable identification and efficient estimation via two so-called bridge functions. In this paper, we tackle the primary challenges in causal inference with negative controls: identifying and estimating these bridge functions. Previous work has typically relied on completeness conditions for identification, imposed uniqueness assumptions for estimation, and focused on parametric models for the bridge functions. Instead, we provide an alternative identification strategy that assumes the existence of two bridge functions rather than completeness conditions. We also provide new estimators for these functions based on minimax learning formulations. These estimators accommodate general function classes such as Reproducing Kernel Hilbert Spaces and neural networks. We study finite-sample convergence results both for estimating bridge functions themselves and for the final estimation of the causal parameter under a variety of combinations of assumptions. We avoid uniqueness conditions on the bridge functions as much as possible.
Abstract:We study the estimation of causal parameters when not all confounders are observed and instead negative controls are available. Recent work has shown how these can enable identification and efficient estimation via two so-called bridge functions. In this paper, we tackle the primary challenges in causal inference with negative controls: identifying and estimating these bridge functions. Previous work has typically relied on completeness conditions for identification, imposed uniqueness assumptions for estimation, and focused on parametric models for the bridge functions. Instead, we provide an alternative identification strategy that assumes the existence of two bridge functions rather than completeness conditions. We also provide new estimators for these functions based on minimax learning formulations. These estimators accommodate general function classes such as Reproducing Kernel Hilbert Spaces and neural networks. We study finite-sample convergence results both for estimating bridge functions themselves and for the final estimation of the causal parameter under a variety of combinations of assumptions. We avoid uniqueness conditions on the bridge functions as much as possible.
Machine Learning (stat.ML); Machine Learning (cs.LG); Methodology (stat.ME)
arXiv:2103.14029 [stat.ML]
(or arXiv:2103.14029v5 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2103.14029 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 263 cuvinte
Subiecte conexe
Flexible Doubly Robust Proximal Causal Inference for Censored Outcomes
arXiv · 16 oct. 2026
Proximal Balancing for Causal Effect Estimation under Unmeasured Confounding
arXiv · 1 oct. 2026
Proximal Causal Learning under Unmeasured Confounding
arXiv · 6 oct. 2026
Blessing from Human-AI Interaction: Super Reinforcement Learning in Confounded Environments
arXiv · 5 iun. 2026