Saved in:
Bibliographic Details
Main Authors: Verhelst, Théo, Mercier, Denis, Shrestha, Jeevan, Bontempi, Gianluca
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2211.07264
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911309760561152
author Verhelst, Théo
Mercier, Denis
Shrestha, Jeevan
Bontempi, Gianluca
author_facet Verhelst, Théo
Mercier, Denis
Shrestha, Jeevan
Bontempi, Gianluca
contents Counterfactuals are central in causal human reasoning and the scientific discovery process. The uplift, also called conditional average treatment effect, measures the causal effect of some action, or treatment, on the outcome of an individual. This paper discusses how it is possible to derive bounds on the probability of counterfactual statements based on uplift terms. First, we derive some original bounds on the probability of counterfactuals and we show that tightness of such bounds depends on the information of the feature set on the uplift term. Then, we propose a point estimator based on the assumption of conditional independence between the counterfactual outcomes. The quality of the bounds and the point estimators are assessed on synthetic data and a large real-world customer data set provided by a telecom company, showing significant improvement over the state of the art.
format Preprint
id arxiv_https___arxiv_org_abs_2211_07264
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Partial counterfactual identification and uplift modeling: theoretical results and real-world assessment
Verhelst, Théo
Mercier, Denis
Shrestha, Jeevan
Bontempi, Gianluca
Machine Learning
Counterfactuals are central in causal human reasoning and the scientific discovery process. The uplift, also called conditional average treatment effect, measures the causal effect of some action, or treatment, on the outcome of an individual. This paper discusses how it is possible to derive bounds on the probability of counterfactual statements based on uplift terms. First, we derive some original bounds on the probability of counterfactuals and we show that tightness of such bounds depends on the information of the feature set on the uplift term. Then, we propose a point estimator based on the assumption of conditional independence between the counterfactual outcomes. The quality of the bounds and the point estimators are assessed on synthetic data and a large real-world customer data set provided by a telecom company, showing significant improvement over the state of the art.
title Partial counterfactual identification and uplift modeling: theoretical results and real-world assessment
topic Machine Learning
url https://arxiv.org/abs/2211.07264