Table of Contents
Fetching ...

Personalized Policy Learning through Discrete Experimentation: Theory and Empirical Evidence

Zhiqi Zhang, Zhiyu Zeng, Ruohan Zhan, Dennis Zhang

TL;DR

The paper tackles the challenge of learning personalized policies over a continuous treatment space when only discrete A/B arms are observed. It introduces DLPT, a three-stage framework that first estimates a high-dimensional nuisance function via structured neural networks, then uses Neyman orthogonal scores for unbiased policy-value estimation, and finally learns the optimal personalized policy within flexible policy classes. The authors establish theoretical guarantees, including asymptotic unbiasedness, semi-parametric efficiency, and a minimax $\sqrt{n}$ regret rate for the learned policy, and validate the method with a large field experiment on Platform O, showing substantial gains over benchmarks in both policy evaluation and policy learning. Complementary semi-synthetic experiments corroborate robustness across continuous policy spaces and provide practical guidance on design choices, such as treatment coverage and polynomial degree. The work offers a scalable, post-experiment tool for extrapolating continuous, personalized decisions from discrete experiments with real-world significance for platform operations.

Abstract

Randomized Controlled Trials (RCTs), or A/B testing, have become the gold standard for optimizing various operational policies on online platforms. However, RCTs on these platforms typically cover a limited number of discrete treatment levels, while the platforms increasingly face complex operational challenges involving optimizing continuous variables, such as pricing and incentive programs. The current industry practice involves discretizing these continuous decision variables into several treatment levels and selecting the optimal discrete treatment level. This approach, however, often leads to suboptimal decisions as it cannot accurately extrapolate performance for untested treatment levels and fails to account for heterogeneity in treatment effects across user characteristics. This study addresses these limitations by developing a theoretically solid and empirically verified framework to learn personalized continuous policies based on high-dimensional user characteristics, using observations from an RCT with only a discrete set of treatment levels. Specifically, we introduce a deep learning for policy targeting (DLPT) framework that includes both personalized policy value estimation and personalized policy learning. We prove that our policy value estimators are asymptotically unbiased and consistent, and the learned policy achieves a root-n-regret bound. We empirically validate our methods in collaboration with a leading social media platform to optimize incentive levels for content creation. Results demonstrate that our DLPT framework significantly outperforms existing benchmarks, achieving substantial improvements in both evaluating the value of policies for each user group and identifying the optimal personalized policy.

Personalized Policy Learning through Discrete Experimentation: Theory and Empirical Evidence

TL;DR

The paper tackles the challenge of learning personalized policies over a continuous treatment space when only discrete A/B arms are observed. It introduces DLPT, a three-stage framework that first estimates a high-dimensional nuisance function via structured neural networks, then uses Neyman orthogonal scores for unbiased policy-value estimation, and finally learns the optimal personalized policy within flexible policy classes. The authors establish theoretical guarantees, including asymptotic unbiasedness, semi-parametric efficiency, and a minimax regret rate for the learned policy, and validate the method with a large field experiment on Platform O, showing substantial gains over benchmarks in both policy evaluation and policy learning. Complementary semi-synthetic experiments corroborate robustness across continuous policy spaces and provide practical guidance on design choices, such as treatment coverage and polynomial degree. The work offers a scalable, post-experiment tool for extrapolating continuous, personalized decisions from discrete experiments with real-world significance for platform operations.

Abstract

Randomized Controlled Trials (RCTs), or A/B testing, have become the gold standard for optimizing various operational policies on online platforms. However, RCTs on these platforms typically cover a limited number of discrete treatment levels, while the platforms increasingly face complex operational challenges involving optimizing continuous variables, such as pricing and incentive programs. The current industry practice involves discretizing these continuous decision variables into several treatment levels and selecting the optimal discrete treatment level. This approach, however, often leads to suboptimal decisions as it cannot accurately extrapolate performance for untested treatment levels and fails to account for heterogeneity in treatment effects across user characteristics. This study addresses these limitations by developing a theoretically solid and empirically verified framework to learn personalized continuous policies based on high-dimensional user characteristics, using observations from an RCT with only a discrete set of treatment levels. Specifically, we introduce a deep learning for policy targeting (DLPT) framework that includes both personalized policy value estimation and personalized policy learning. We prove that our policy value estimators are asymptotically unbiased and consistent, and the learned policy achieves a root-n-regret bound. We empirically validate our methods in collaboration with a leading social media platform to optimize incentive levels for content creation. Results demonstrate that our DLPT framework significantly outperforms existing benchmarks, achieving substantial improvements in both evaluating the value of policies for each user group and identifying the optimal personalized policy.
Paper Structure (40 sections, 11 theorems, 45 equations, 4 figures, 8 tables)

This paper contains 40 sections, 11 theorems, 45 equations, 4 figures, 8 tables.

Key Result

Proposition 1

Suppose that $\mathbb{E}[\tilde{\bm T}_K \tilde{\bm T}_K'|\bm X]$ is positive definite across all $\bm X$, and that Assumption ass:loss function and Assumption ass:data bounded and nuisance smoonth in Appendix app:assumptions hold,

Figures (4)

  • Figure 1: Illustration of the 'Point" System on Platform
  • Figure 2: Illustration of Structured Deep Neural Network in Empirical Application
  • Figure 3: Policy Regret Scales with $1/\sqrt{n}$
  • Figure 4: Policy Regret with Treatment Level Coverage and Polynomial Degree Assumption.

Theorems & Definitions (15)

  • Proposition 1: Indentifiability and Convergence of Nuisance Estimate
  • Remark 1: CHOOSING OPTIMAL $K$
  • Proposition 2: Influence Function
  • Remark 2: Explicit computation of nuisance parameter $\bm\Lambda(\bm x)$
  • Proposition 3: Universal Orthogonality
  • Proposition 4: Asymptotic Normality
  • Theorem 1
  • Remark 3: Role of policy class
  • Theorem 2: Uniform Approximation Error
  • Lemma 1: Theorem 1 in farrell2020deep
  • ...and 5 more