7 Unconfounded Treatment Assignment & Estimating Propensity Score

Randomized Experiments and Observational Studies

Randomized Experiments

A randomized experiment is an assignment mechanism that

  1. is probabilistic and
  2. has a known functional form that is controlled by the researcher

And there are a special case of randomized experiment called classical randomized experiment whose assignment mechanism is

  1. individualistic, and
  2. unconfounded

Four important special cases:

  1. Bernoulli trials
  2. Complete randomized experiments
  3. Stratified randomized experiments
  4. Paired randomized experiments

Observational Studies

An observational study is an assignment mechanism if the functional form of the assignment mechanism is unknown.

Two categories: Regular Assignment Mechanism and Irregular Assignment Mechanism.

An assignment mechanism is regular if it is

  1. individualistic
  2. probabilistic
  3. unconfounded

Introduce the Irregular Assignment Mechanism briefly here.

  • Assignment to treatment may differ for some units from the receipt of treatment, i.e., noncompliance.
  • We often assume that assignment to treatment itself is unconfounded, but allow receipt of treatment to be confounded.

Caution

Unconfoundedness Is Not Testable. There is no information in the data that can tell us that unconfoundedness does not hold, even in settings with a large number of units.

RAMs vs SREs

Common features:

  • Base inference on strata defined by covariates Xi=xX_{i}=x.
  • Stratum-level causal effects are identifiable & estimable.

Key differences

  • e(j)=Nt(j)Ne(j)=\frac{N_{t}(j)}{N} are known in SREs.
  • But unknown in a RAM.

RAM can be treated as SREs with unknown propensity score in each stratum. The textbook says:

The fact that we do not know a priori the probability of assignment to the treatment is irrelevant here: we can use the results for the analysis of completely randomized experiments by conditioning on the number of treated women and treated men. (Textbook p259)

Just see the finite sample expectation of Yˉtobs(f)=1Nt(f)∑i:Xi=fWiYi(1)\bar{Y}^{\mathrm{obs}}_{t}(f)=\frac{1}{N_{t}(f)}\sum _{i:X_{i}=f}W_{i}Y_{i}(1). Let

C=(X,Y(1),Y(0),Nt(f),Nt(m))\mathcal{C}= \left( \boldsymbol{X},\boldsymbol{Y}(1),\boldsymbol{Y}(0),N_{t}(f),N_{t}(m) \right)

then the finite sample expectation

E[Yˉtobs(f)∣C]=1Nt(f)∑i:Xi=fYi(1)E[Wi∣C]=1Nt(f)∑i:Xi=fYi(1)Nt(f)N(f)=1N(f)∑i:Xi=fYi(1)\begin{align} \mathbb{E}[\bar{Y}^{\mathrm{obs}}_{t}(f)\mid \mathcal{C}] & = \frac{1}{N_{t}(f)}\sum _{i:X_{i}=f}Y_{i}(1)\mathbb{E}[W_{i}\mid \mathcal{C}] \\ & = \frac{1}{N_{t}(f)}\sum _{i:X_{i}=f}Y_{i}(1) \frac{N_{t}(f)}{N(f)} \\ & = \frac{1}{N(f)}\sum _{i:X_{i}=f}Y_{i}(1) \end{align}

The fact that P(Wi=1∣C)=Nt(f)/N(f)P(W_{i}=1\mid \mathcal{C})=N_{t}(f)/N(f) is not obvious. The second part of the individualistic assignment is the core (refer here).


Since we don't know the propensity score, we want to estimate them. Note that in a RAM

e(x)=P(Wi∣Xi=x)=E[Wi∣Xi=x]e(x)=P(W_{i}\mid X_{i}=x)=\mathbb{E}[W_{i}\mid X_{i}=x]

so we can use the sample mean of Wi∣Xi=xW_{i}\mid X_{i}=x, which is Nt(x)N(x)\frac{N_{t}(x)}{N(x)}, to estimate it. This is guaranteed by LLN (the version that allows dependency).

Then here comes the problem. If XiX_{i} can take many values, then in each stratum, the sample size would be rather small. So balancing score is introduced.

Balancing Score and Propensity Score

Concepts

Definition (Balancing Scores)
A balancing score b(x)b(x) is a function of the covariates such that Wi⊥Xi∣b(Xi)W_{i}\perp X_{i}\mid b(X_{i}).

Lemma (Unconfoundedness Given a Balancing Score)
Suppose assignment to treatment is unconfounded. Then assignment is unconfounded given any balancing score:

Wi⊥(Yi(1),Yi(0))∣b(Xi)W_{i}\perp (Y_{i}(1),Y_{i}(0))\mid b(X_{i})

The proof is as follows:

Let

C=(Yi(1),Yi(0))\mathcal{C}=(Y_{i}(1),Y_{i}(0))

Then

P(Wi=1∣C,b(Xi))=E[Wi∣C,b(Xi)]=E[E[Wi∣C,b(Xi),Xi]∣C,b(Xi)]=E[E[Wi∣b(Xi),Xi]∣C,b(Xi)](Unconfounded)=E[E[Wi∣b(Xi)]∣C,b(Xi)](Definition of PS)=E[Wi∣b(Xi)]=P(Wi=1∣b(Xi))\begin{align} P(W_{i}=1\mid \mathcal{C},b(X_{i})) & = \mathbb{E}[W_{i}\mid \mathcal{C},b(X_{i})] \\ & = \mathbb{E}\left[ {\color{blue}\mathbb{E}[W_{i}\mid \mathcal{C},b(X_{i}),X_{i}]} \mid \mathcal{C},b(X_{i})\right] \\ & = \mathbb{E}\left[ {\color{blue}\mathbb{E}[W_{i}\mid b(X_{i}),X_{i}]} \mid \mathcal{C},b(X_{i})\right]\quad \text{(Unconfounded)} \\ & = \mathbb{E}\left[ {\color{blue}\mathbb{E}[W_{i}\mid b(X_{i})]} \mid \mathcal{C},b(X_{i})\right]\quad \text{(Definition of PS)} \\ & = \mathbb{E}[W_{i}\mid b(X_{i})] \\ & = P(W_{i}=1\mid b(X_{i})) \end{align}

Lemma (Balancing Property of Propensity Score)
The propensity score is a balancing score.

On one hand,

P(Wi=1∣Xi,e(Xi))=P(Wi=1∣Xi)=e(Xi)P(W_{i}=1\mid X_{i},e(X_{i}))=P(W_{i}=1\mid X_{i})=e(X_{i})

On the other hand

P(Wi=1∣e(Xi))=E[Wi∣e(Xi)]=E[E[Wi∣e(Xi),Xi]∣e(Xi)]=E[E[Wi∣Xi]∣e(Xi)]=E[e(Xi)∣e(Xi)]=e(Xi)\begin{align} P(W_{i}=1\mid e(X_{i})) & =\mathbb{E}[W_{i}\mid e(X_{i})] \\ & = \mathbb{E}\big[\mathbb{E}[W_{i}\mid e(X_{i}),X_{i}]\mid e(X_{i})\big] \\ & = \mathbb{E}\big[\mathbb{E}[W_{i}\mid X_{i}]\mid e(X_{i})\big] \\ & = \mathbb{E}[e(X_{i})\mid e(X_{i})] \\ & = e(X_{i}) \end{align}

So

P(Wi=1∣Xi,e(Xi))=P(Wi=1∣e(Xi))P(W_{i}=1\mid X_{i},e(X_{i}))=P(W_{i}=1\mid e(X_{i}))

thus

Wi⊥Xi∣e(Xi)W_{i}\perp X_{i}\mid e(X_{i})


Back to the main topic. We want to reduce the number of strata, so b(Xi)b(X_{i}) should take less possible values, i.e. the coarser the better.

How to define coarseness? We know a mapping usually loses information. So if b′=f∘bb'=f \circ b, where ff is not injection (单射), then we say b′b' is coarser.

What is the coarsest balancing score? The propensity score has this good property.

Lemma (Coarseness of Balancing Scores)
The propensity score is the coarsest balancing score.

Suppose e(Xi)e(X_{i}) is not the coarsest. Then there exist xx and x′x', such that

e(x)≠e(x′) but b(x)=b(x′)e(x)\ne e(x')\ \text{but}\ b(x)=b(x')

But we have

e(x)=P(Wi=1∣Xi=x)=P(Wi=1∣Xi=x,b(Xi)=b(x))=P(Wi=1∣b(Xi)=b(x))=P(Wi=1∣b(Xi)=b(x′))=P(Wi=1∣Xi=x′,b(Xi)=b(x′))=P(Wi=1∣Xi=x′)=e(x′)\begin{align} e(x) & = P(W_{i}=1\mid X_{i}=x) \\ & = P(W_{i}=1\mid X_{i}=x,b(X_{i})=b(x)) \\ & = P(W_{i}=1\mid b(X_{i})=b(x)) \\ & = P(W_{i}=1\mid b(X_{i})=b(x')) \\ & = P(W_{i}=1\mid X_{i}=x',b(X_{i})=b(x')) \\ & = P(W_{i}=1\mid X_{i}=x') \\ & = e(x') \end{align}

It is contradictory!

Methods for Estimation in RAMs

Imputation

The core of the model-based method and the regression method is to predict the counter-factual potential outcomes and use the predicted results to estimate the ATE.

Model-Based Method

Regression Method

Summary of Imputation Methods

The two methods are not recommended in RAMs because of the systematical difference of the distribution of the covariates between the treated and the controlled groups. The predictions are not very trustable. Consider the setting: a model is trained on the data of males but is used to predict females.

Balance the Covariates

Weighting Estimators

Can show that

E[YiobsWie(Xi)]=Esp[Yi(1)]\mathbb{E}\left[ \frac{Y_{i}^{\mathrm{obs}}W_{i}}{e(X_{i})} \right]=\mathbb{E}_{sp}[Y_{i}(1)]

E[YiobsWie(Xi)]=E[E[YiobsWie(Xi)∣Xi]]=E[E[Yi(1)Wie(Xi)∣Xi]]=E[1e(Xi)E[Yi(1)∣Xi]⋅E[Wi∣Xi]]=E[E[Yi(1)∣Xi]]=E[Yi(1)]\begin{align} \mathbb{E}\left[ \frac{Y_{i}^{\mathrm{obs}}W_{i}}{e(X_{i})} \right] & = \mathbb{E}\left[ \mathbb{E}\left[ \frac{Y_{i}^{\mathrm{obs}}W_{i}}{e(X_{i})} \mid X_{i}\right] \right] \\ \\ & = \mathbb{E}\left[ \mathbb{E}\left[ \frac{Y_{i}(1)W_{i}}{e(X_{i})} \mid X_{i}\right] \right]\\ & = \mathbb{E}\left[ \frac{1}{e(X_{i})}\mathbb{E}[Y_{i}(1)\mid X_{i}]\cdot\mathbb{E}[W_{i}\mid X_{i}] \right] \\ & = \mathbb{E}\big[\mathbb{E}[Y_{i}(1)\mid X_{i}]\big] \\ & = \mathbb{E}[Y_{i}(1)] \end{align}

and

E[Yiobs(1−Wi)1−e(Xi)]=Esp[Yi(0)]\mathbb{E}\left[ \frac{Y_{i}^{\mathrm{obs}}(1-W_{i})}{1-e(X_{i})} \right]=\mathbb{E}_{sp}[Y_{i}(0)]

So we can use

τ^ht=1N∑i=1NWiYiobse(Xi)−1N∑i=1N(1−Wi)Yiobs1−e(Xi)\hat{\tau}^{\mathrm{ht}}=\frac{1}{N}\sum_{i=1}^{N} \frac{W_{i}Y_{i}^{\mathrm{obs}}}{e(X_{i})}-\frac{1}{N}\sum_{i=1}^{N} \frac{(1-W_{i})Y_{i}^{\mathrm{obs}}}{1-e(X_{i})}

to estimate the ATE.

But in practice we don't know the propensity score, so we have to estimate it. Later we will talk about how to estimate it.

Blocking Estimators

A more robust approach involving the propensity score is to coarsen it through blocking (i.e., subclassification). In this third approach, the sample is partitioned into subclasses, based on the value of the estimated propensity score. Within each subclass, the data can be analyzed as if they arose from a completely randomized experiment. (Textbook p274)

The estimator comes with issues of bias.

In particular, we recommend reducing the bias and increasing the precision further by using covariance adjustment within the subclasses. (Textbook p275)

Matching Estimators

... it relies on finding direct comparisons, that is, matches, for each unit. For a given treated unit with a particular set of values for the covariates, one looks for a control unit with as similar a set of covariates as possible. (Textbook p275)

Estimating Propensity Score

Does the estimation accuracy matter?

Be clear about the goal.

用估计的 PS,估计量的统计性质不会被破坏吗?比如无偏性啥的。

Three comments:

  • 只看满足分配假设的观察性研究
  • 观察性研究中,N(f)N(f)、Nt(f)N_{t}(f) 等有随机性,或者说未知,propensity score 无法计算,需要估计
  • XX 取值很多,或者是个向量,分层会分得很细,样本量少,propensity score 估计不准确,需要 bs
  • balancing score
    • given bs still unconfounded
    • why named like this?
    • the propensity score is a bs
    • ps is the coarsest. 映射会丢失信息,故若能表示为某 bs 的映射,即为更粗
  • 观察性研究
    • 贝叶斯方法,不推荐,对模型假设敏感,若 XX 取值多,往往不准
    • 回归法,不推荐
    • Weighting estimators, unbiased
    • Blocking estimators
    • matching estimators
  • 估计 PS

7 Unconfounded Treatment Assignment & Estimating Propensity Score
https://wtx17.github.io/2026/11/04/7-Unconfounded-Treatment-Assignment-and-Estimating-Propensity-Score/
作者
wtx
发布于
2026年11月4日
更新于
2026年11月6日
许可协议