REVIEW 1 cited by
UTBoost: Gradient Boosted Decision Trees for Uplift Modeling
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Uplift modeling comprises a collection of machine learning techniques designed for managers to predict the incremental impact of specific actions on customer outcomes. However, accurately estimating this incremental impact poses significant challenges due to the necessity of determining the difference between two mutually exclusive outcomes for each individual. In our study, we introduce two novel modifications to the established Gradient Boosting Decision Trees (GBDT) technique. These modifications sequentially learn the causal effect, addressing the counterfactual dilemma. Each modification innovates upon the existing technique in terms of the ensemble learning method and the learning objective, respectively. Experiments with large-scale datasets validate the effectiveness of our methods, consistently achieving substantial improvements over baseline models.
Forward citations
Cited by 1 Pith paper
-
FairUDT: Fairness-aware Uplift Decision Trees
FairUDT uses uplift-style divergence splitting and selective leaf relabeling to reduce demographic parity and average odds gaps on three fairness benchmarks, with test-set relabeling in its main evaluation.
Discussion (0). Continue with ORCID to comment.