New neural model improves uplift modeling accuracy.
problem Improving accuracy in uplift modeling for specific treatments.
method Developed a twin neural network architecture with a new loss function.
result Proposed model outperforms existing methods in simulations and real data.
The paper compares methods for estimating individual treatment effects.
problem Estimating the optimal treatment effect for each individual.
method Comparison of machine learning methods for individual treatment effect estimation.
result Combination of Logistic Regression and Difference Score method, as well as Uplift Random Forest method, provides the best prediction accuracy.
Customer scoring models are the core of scalable direct marketing. Uplift models provide an estimate of the incremental benefit from a treatment that is used for operational decision-making. Training and monitoring of uplift models require experimental data. However, the collection of data under randomized treatment as…
Our paper improves uplift model evaluation on randomized controlled trials (RCT) data.
problem Variance in uplift evaluation metrics makes their signals arbitrary and unreliable.
method Theoretical analysis and statistical adjustment of the outcome to reduce variance.
result Variance reduction methods improve uplift evaluation metrics on RCT data.
GCF estimates heterogeneous treatment effects for continuous treatments in online marketplaces.
problem Estimating heterogeneous treatment effects for continuous treatments in online marketplaces.
method Kernel-based doubly robust estimator and distance-based splitting criterion.
result GCF estimates heterogeneous treatment effects for continuous treatments effectively.
Randomized experiments have been critical tools of decision making for decades. However, subjects can show significant heterogeneity in response to treatments in many important applications. Therefore it is not enough to simply know which treatment is optimal for the entire population. What we need is a model that corr…
New neural network method improves uplift modeling accuracy.
problem Overfitting in uplift modeling.
method Jointly optimizing difference in conditional means and transformed outcome losses using neural networks.
result Improves state-of-the-art uplift modeling on synthetic and real data.
UCB algorithms estimate uplifts in multi-variable reward systems.
problem Marketing campaigns and recommender systems with multiple outcome variables.
method UCB-style algorithms for estimating uplifts over a baseline.
result Sublinear regret bounds for multiple problem variants.
A new method flips class values to address class and treatment imbalance in uplift modeling and HTE.
problem Class and treatment imbalance in imbalanced RCT data.
method Class flipping approach to address imbalance without distorting predictions.
result The method does not distort predicted effects and does not require calibration.
A Qini-based uplift model improves retention marketing campaign performance.
problem Isolating the marketing effect of a campaign and identifying responsive customers.
method Qini-based uplift regression model using logistic regression.
result Qini-optimized uplift models improve performance and provide interpretable models.
Proposes a resampling method to compare uplift models with uncertainty.
problem Uncertainty in estimating uplift curves when full population data is unavailable.
method Two-step sampling procedure and resampling-based approach.
result Validates the proposed method through simulations and real data applications.
The paper introduces revenue uplift modeling to maximize marketing profits.
problem Maximizing incremental sales versus maximizing incremental revenue in marketing campaigns.
method Response transformation and two-stage models to decompose campaign profit.
result Revenue uplift modeling can improve campaign profit substantially.
A new method for uplift modeling using learning-to-rank techniques.
problem Improving customer targeting in marketing and retention.
method Unified formalization of uplift measures, learning-to-rank with PCG metric, LambdaMART optimization.
result Improved results compared to standard learning-to-rank metrics and state-of-the-art uplift modeling.
Large dataset released for ITE and UM research.
problem Estimating causal impact of actions in various sectors.
method Release of a large dataset, formalization of UM, synthetic response surfaces, heterogeneous treatment assignment.
result Validation of ITE prediction and UM methods with high statistical significance.
Uplift modeling is an area of machine learning which aims at predicting the causal effect of some action on a given individual. The action may be a medical procedure, marketing campaign, or any other circumstance controlled by the experimenter. Building an uplift model requires two training sets: the treatment group, w…
Graph neural networks integrate causal knowledge for more accurate uplift modeling.
problem Identifying the most effective treatments and clients for marketing interventions.
method Combining graph neural networks with causal knowledge to estimate uplift values.
result The proposed method outperforms traditional approaches in predicting uplift values with minimal errors.
New feature selection methods improve uplift modeling accuracy.
problem Overfitting and poor interpretability in feature selection for uplift models.
method Explicitly designed feature selection methods inspired by statistics and information theory.
result Proposed methods outperform traditional feature selection methods in uplift modeling.
Ensembles of randomized decision trees, usually referred to as random forests, are widely used for classification and regression tasks in machine learning and statistics. Random forests achieve competitive predictive performance and are computationally efficient to train and test, making them excellent candidates for r…
New random forest method provides optimal rates and confidence bands.
problem Improving random forest regression rates and constructing confidence bands.
method Proposed Ehrenfest centered purely random forests achieve optimal rates; used Gaussian approximation for supremum of empirical processes.
result Explicit asymptotic uniform confidence bands constructed for both random forest types.
Improved random forest proximities capture data geometry.
problem Inaccurate random forest proximities do not reflect learned data geometry.
method Introduce RF-GAP: Geometry- and Accuracy-Preserving proximities.
result RF-GAP improves geometric representation in tasks like data imputation.
This paper enhances uplift modeling for multi-treatment marketing campaigns.
problem Optimizing marketing strategies by selecting individuals likely to respond to different treatments.
method Leveraging score ranking and calibration techniques.
result Improves overall performance of marketing campaigns.
A framework for causal classification using uplift and causal heterogeneity methods.
problem Predicting the effect of interventions on different individuals from data.
method Causal classification framework using off-the-shelf supervised methods.
result Framework works for causal classification and uplift modelling, competitive with other methods.
We propose random hinge forests, a simple, efficient, and novel variant of decision forests. Importantly, random hinge forests can be readily incorporated as a general component within arbitrary computation graphs that are optimized end-to-end with stochastic gradient descent or variants thereof. We derive random hinge…
Heteroskedasticity biases uplift model rankings, leading to inefficient treatment allocation.
problem Bias in uplift model rankings due to heteroskedasticity.
method Theoretical analysis and simulation on real-world data.
result Heteroskedasticity can cause individuals with high treatment effects to be ranked at the bottom, leading to inefficient treatment allocation.
Random forests reduce bias and variance, especially in low SNR settings.
problem Reducing bias and variance in machine learning models, particularly in low SNR scenarios.
method Empirical study of random forests and bagging ensembles, focusing on the importance of mtry tuning. result Random forests reduce both bias and variance, outperforming bagging ensembles in high SNR settings.
Improved random forest models enhance machine learning predictions.
problem Equal weights for random forest base decision trees are not optimal.
method Proposes algorithms to modify weighting strategy of regular random forest.
result Numerical results show significant improvements over regular random forest.
Enhances random forest consistency and introduces DMRF for improved performance.
problem Improving the consistency and efficiency of random forest algorithms.
method Strengthened proof methods and propose DMRF algorithm.
result DMRF achieves better theoretical and experimental performance than previous variants.
Uplift modeling is an emerging machine learning approach for estimating the treatment effect at an individual or subgroup level. It can be used for optimizing the performance of interventions such as marketing campaigns and product designs. Uplift modeling can be used to estimate which users are likely to benefit from …
New random forest variants achieve optimal performance in high dimensions.
problem Handling dependencies between features in high-dimensional data.
method Using oblique splits in random forests with general split directions.
result Achieved minimax optimal convergence rates in arbitrary dimension.
This paper is a comment on the survey paper by Biau and Scornet (2016) about random forests. We focus on the problem of quantifying the impact of each ingredient of random forests on their performance. We show that such a quantification is possible for a simple pure forest , leading to conclusions that could apply more…
RFpredInterval package builds prediction intervals for random forests and boosted forests.
problem Quantifying uncertainty in random forest and boosted forest point predictions.
method 16 methods to build prediction intervals with random forests and boosted forests.
result The proposed method outperforms existing methods in building prediction intervals.
Bridges uplift modeling and sequential decision-making with online budget allocation.
problem Treatment allocation under budget constraints in digital advertising.
method Budget-Constrained Causal Bandits (BCCB) integrates learning, exploration, and budget pacing.
result Data-efficiency crossover: BCCB operates effectively from the first user, 3-5x lower performance variance.
Enhances random forest performance with exogenous randomness.
problem Improving random forest performance through exogenous randomness.
method Developed non-asymptotic MSE expansions for individual trees and forests, identified two types of randomness, and conducted simulations.
result Exogenous randomness, particularly feature subsampling, reduces both bias and variance of random forests.
We improve random forest consistency and performance with DMRF, a new variant.
problem Improving the consistency and performance of random forest models.
method Developed DMRF, a data-driven multinomial random forest, by modifying proof methods and improving data utilization.
result DMRF achieves strong consistency with probability 1, surpassing previous models in classification tasks.
Online random forests improve Q-learning performance in specific gym environments.
problem Improving Q-learning performance in reinforcement learning tasks.
method Proposed online random forests as Q-function approximators and growing them as learning progresses.
result Improved performance over state-of-the-art Deep Q-Networks in specific gym environments.
Paper explores grafting consistent estimators to improve Random Forest consistency.
problem Ensuring Random Forests are consistent despite their performance.
method Grafting consistent estimators onto a shallow CART.
result Grafted estimators provide a consistency guarantee and perform well empirically.
Random forests have proven to be reliable predictive algorithms in many application areas. Not much is known, however, about the statistical properties of random forests. Several authors have established conditions under which their predictions are consistent, but these results do not provide practical estimates of ran…
Transforms random forests into efficient neural networks using imitation learning.
problem Inefficient architectures of existing methods for transforming random forests into neural networks.
method Generates training data from a random forest and learns a neural network to imitate its behavior.
result Implicit transformation creates efficient neural networks with better generalization.
Theoretical study of random forests for nonlinear time series.
problem Theoretical justification for using random forests in time series modeling.
method Uniform concentration inequality for regression trees and random forests consistency proof.
result Consistency of random forests for nonlinear autoregressive processes.
We propose an algorithm named best-scored random forest for binary classification problems. The terminology "best-scored" means to select the one with the best empirical performance out of a certain number of purely random tree candidates as each single tree in the forest. In this way, the resulting forest can be more …
In this paper we propose using the principle of boosting to reduce the bias of a random forest prediction in the regression setting. From the original random forest fit we extract the residuals and then fit another random forest to these residuals. We call the sum of these two random forests a \textit{one-step boosted …
Alpha-trimming prunes trees in random forests to improve predictive performance.
problem Improving predictive performance of random forests by locally adaptive tree pruning.
method Alpha-trimming is a fast pruning algorithm that prunes trees in a random forest based on signal-to-noise ratio, controlled by a tuning parameter.
result Alpha-trimming often lowers mean squared prediction error compared to fully grown random forests.
Uplift modeling is aimed at estimating the incremental impact of an action on an individual's behavior, which is useful in various application domains such as targeted marketing (advertisement campaigns) and personalized medicine (medical treatments). Conventional methods of uplift modeling require every instance to be…
New methods improve prediction performance and reduce computation time in boosting and random forest models.
problem Improving prediction performance and reducing computation time in boosting and random forest models.
method Random tree depth injection approach for Boosting and Random Forests.
result The new methods can improve prediction performance and reduce computation time by up to 40%.
Random forests are a type of ensemble method which makes predictions by combining the results of several independent trees. However, the theory of random forests has long been outpaced by their application. In this paper, we propose a novel random forests algorithm based on cooperative game theory. Banzhaf power index …
A random forest is a popular tool for estimating probabilities in machine learning classification tasks. However, the means by which this is accomplished is unprincipled: one simply counts the fraction of trees in a forest that vote for a certain class. In this paper, we forge a connection between random forests and ke…
Despite widespread interest and practical use, the theoretical properties of random forests are still not well understood. In this paper we contribute to this understanding in two ways. We present a new theoretically tractable variant of random regression forests and prove that our algorithm is consistent. We also prov…
Paper proposes a new method combining random forests and Lasso selection.
problem Improving random forest performance by applying Lasso regression.
method Adaptive Lasso weighting applied to random forest predictions.
result Unified framework strictly outperforms other methods in simulations and real-world datasets.