paper-with-me

홈 › Papers

Hidden yet quantifiable: A lower bound for confounding strength using randomized trials

2023-12-06 · Piersilvio De Bartolomeis, Javier Abad, Konstantin Donhauser, Fanny Yang

In the era of fast-paced precision medicine, observational studies play a major role in properly evaluating new treatments in clinical practice. Yet, unobserved confounding can significantly compromise causal conclusions drawn from non-randomized data. We propose a novel strategy that leverages randomized trials to quantify unobserved confounding. First, we design a statistical test to detect unobserved confounding with strength above a given threshold. Then, we use the test to estimate an asymptotically valid lower bound on the unobserved confounding strength. We evaluate the power and validity of our statistical test on several synthetic and semi-synthetic datasets. Further, we show how our lower bound can correctly identify the absence and presence of unobserved confounding in a real-world setting.

📄 PDF Abstract BibTeX arXiv:2312.03871

Code (2)

jaabmar/confounder-lower-bound 공식 구현 pytorch
jaabmar/kernel-test-bias jax

Tasks

valid

Similar Papers 제목 키워드 기반

Algorithmic Recourse in Partially and Fully Confounded Settings Through Bounding Counterfactual Effects

2021-06-22 · Julius von Kügelgen, Nikita Agarwal, Jakob Zeitler, Afsaneh Mastouri 외

Algorithmic recourse aims to provide actionable recommendations to individuals to obtain a more favourable outcome from an automated decision-making system. As it involves reasoning about interventions performed in the p…

counterfactualDecision Making

Robust Personalized Recommendation under Hidden Confounding in MNAR

2026-05-20 · Zongyu Li, Wanting Su, Tianyu Xia arxiv

Recommender systems often rely on observational user--item interaction data, which is prone to selection bias due to users' selective interactions with items. Inverse propensity weighting and doubly robust estimators eff…

Removing Hidden Confounding in Recommendation: A Unified Multi-Task Learning Approach

2023-09-21 · NeurIPS 2023 11

In recommender systems, the collected data used for training is always subject to selection bias, which poses a great challenge for unbiased learning. Previous studies proposed various debiasing methods based on observed…

Hölder Bounds for Sensitivity Analysis in Causal Reasoning

2021-07-09 · Serge Assaad, Shuxi Zeng, Henry Pfister, Fan Li 외

We examine interval estimation of the effect of a treatment T on an outcome Y given the existence of an unobserved confounder U. Using H\"older's inequality, we derive a set of bounds on the confounding bias |E[Y|T=t]-E[…

Sensitivity

$ρ$-GNF: A Copula-based Sensitivity Analysis to Unobserved Confounding Using Normalizing Flows

2022-09-15 · Sourabh Balgi, Jose M. Peña, Adel Daoud

We propose a novel sensitivity analysis to unobserved confounding in observational studies using copulas and normalizing flows. Using the idea of interventional equivalence of structural causal models, we develop $\rho$-…

Causal InferenceSensitivity