Pith. sign in

UTBoost: Gradient Boosted Decision Trees for Uplift Modeling

1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.

1 Pith paper citing it
1 external citations · Pith
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.

citation-role summary

baseline 1

citation-polarity summary

fields

cs.LG 1

years

2025 1

verdicts

REJECT 1

roles

baseline 1

polarities

baseline 1

representative citing papers

FairUDT: Fairness-aware Uplift Decision Trees

cs.LG · 2025-02-03 · reject · novelty 5.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • FairUDT: Fairness-aware Uplift Decision Trees cs.LG · 2025-02-03 · reject · none · ref 38 · internal anchor

    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.