What's the Harm? Sharp Bounds on the Fraction Negatively Affected by Treatment
Nathan Kallus
Abstract
The fundamental problem of causal inference -- that we never observe counterfactuals -- prevents us from identifying how many might be negatively affected by a proposed intervention. If, in an A/B test, half of users click (or buy, or watch, or renew, etc.), whether exposed to the standard experience A or a new one B, hypothetically it could be because the change affects no one, because the change positively affects half the user population to go from no-click to click while negatively affecting the other half, or something in between. While unknowable, this impact is clearly of material importance to the decision to implement a change or not, whether due to fairness, long-term, systemic, or operational considerations. We therefore derive the tightest-possible (i.e., sharp) bounds on the fraction negatively affected (and other related estimands) given data with only factual observations, whether experimental or observational. Naturally, the more we can stratify individuals by observable covariates, the tighter the sharp bounds. Since these bounds involve unknown functions that must be learned from data, we develop a robust inference algorithm that is efficient almost regardless of how and how fast these functions are learned, remains consistent when some are mislearned, and still gives valid conservative bounds when most are mislearned. Our methodology altogether therefore strongly supports credible conclusions: it avoids spuriously point-identifying this unknowable impact, focusing on the best bounds instead, and it permits exceedingly robust inference on these. We demonstrate our method in simulation studies and in a case study of career counseling for the unemployed.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 67115500-3db1-4d0f-b78f-525e65df50ccCited by top-tier papers11
- Partial Identification of Policy Values under Network InterferenceZiyan Wang, Yiran Liu, Zhiheng ZhangICML 2026 · 36 citations
- Trustworthy Policy Learning under the Counterfactual No-Harm CriterionHaoxuan Li, Chunyuan Zheng, Yixiao Cao, Zhi Geng et al.ICML 2023 · 34 citations
- Policy Learning for Balancing Short-Term and Long-Term RewardsPeng Wu, Ziyu Shen, Feng Xie, Zhongyao Wang et al.ICML 2024 · 16 citations
- Quantifying Aleatoric Uncertainty of the Treatment Effect: A Novel Orthogonal LearnerValentyn Melnychuk, Stefan Feuerriegel, Mihaela van der SchaarNeurIPS 2024 · 13 citations
- Learning the Optimal Policy for Balancing Short-Term and Long-Term RewardsQinwei Yang, Xueqing Liu, Yan Zeng, Ruocheng Guo et al.NeurIPS 2024 · 13 citations
Builds on1
Related papers
- Estimation of Bounds on Potential Outcomes For Decision MakingMaggie Makar, Fredrik D. Johansson, John V. Guttag, David A. SontagICML 2020 · 11 citations
- Towards Safe Policy Learning under Partial Identifiability: A Causal ApproachShalmali Joshi, Junzhe Zhang, Elias BareinboimAAAI 2024 · 10 citations
- Statistical Inference Under Constrained Selection BiasSantiago Cortes-Gomez, Mateo Dulce-Rubio, Carlos Miguel Patiño, Bryan WilderICML 2024
- Confounding-Robust Policy Evaluation in Infinite-Horizon Reinforcement LearningNathan Kallus, Angela ZhouNeurIPS 2020 · 78 citations
- Quantifying Ignorance in Individual-Level Causal-Effect Estimates under Hidden ConfoundingAndrew Jesson, Sören Mindermann, Yarin Gal, Uri ShalitICML 2021 · 66 citations
