Covariate Balancing Propensity Score (CBPS)
The Covariate Balancing Propensity Score (CBPS) algorithm estimates the propensity score in a way that maximizes the covariate balance as well as the prediction accuracy of sample inclusion - against some target population of interest. Its main advantage is in cases when the researcher wants better balance on the covariates than traditional propensity score methods - because one believes the assignment model might be misspecified and would like to avoid the need to fit followup models to improve the balance of the covariates.
References and implementation
Reference: Imai, K., & Ratkovic, M. (2014). Covariate balancing propensity score. Journal of the Royal Statistical Society: Series B: Statistical Methodology, 243-263. (link)
The implementation of CBPS in balance is based on the R package, but is enhanced so to match balance's workflow by adding: features transformations, ability to bound the design effect by running a constrained optimization, and weight trimming.
For the implementation in balance see code.
The CBPS implementation in balance was written by Luke Sonnet and Tal Sarig.
Goal: Estimate the propensity score that will also result in maximizing the covariate balance.
Background: When estimating propensity score, there is often a process of adjusting the model and choosing the covariates for better covariate balancing. The goal of CBPS is to allow the researcher to avoid this iterative process and suggest an estimator that is optimizing both the propensity score and the balance of the covariates together.
Advantages of this method over propensity score methods:
- Preferable in the cases of misspecification of the propensity score model, which may lead to a bias in the estimated measure.
- Simple to adjust and extend to other settings in causal inference.
- Inherits theoretical properties of GMM (generalized method of moments) and EL (empirical likelihood), which offers some theoretical guarantees of the method.
A full description of the methodology and details are described in Imai and Ratkovic (2014). We provide here a short description of the methodology.
Consider a sample of respondents of size and a random sample from a target populaiton of size . For each , let be the indicator for inclusion in sample (0 for target and 1 for sample) and be a vector of observed covariates. The propensity score is defined as the conditional probability of being included in the sample conditioned on the covariates, .
Let be the potential outcome observed only for .
- The propensity is bounded away from 0 and 1 (all individuals have a theoretical probability to be in the respondents group): for all .
- Ignorability assumption: , where indicates the response of unit if it is from the sample, and indicates the hypothetical response of unit if it is from the target population. Rosenbaum and Rubin (1983)  showed that this assumption implies that the outcome is independent of the inclusion in the sample given the (theoretical) propensity score (this is the "dimension reduction" property of the propensity score). I.e.: .
Recap - Propensity score estimation
Using a logistic regression model, the propensity score is modeled by: for all .
This is estimated by maximizing the log-likelihood, which results in:
which implies the first order condition:
where the derivative of is by . This condition can be viewed as a condition that balances a certain function of the covariates, in this case the derivative of the propensity score .
Generally, we can expand the above to hold for any function : (given the expectation exists). CBPS chooses as the balancing function in addition to the traditional logistic regression condition (this is what implemented in R and in balance), but generally any function the researcher may choose could be used here. The function results in balancing the first moment of each covariate
Estimation of CBPS
The estimation is done by using Generalized Methods of Moments (GMM): Given moments conditions of the form , the optimal solution minimizes the norm of the sample analog, , with respect to . This results in an estimator of the form:
where is semi-definite positive matrix, often chosen to be the variance matrix (which is unknown). This can be solved by iterative algorithm, by starting with , computing and , and so on (for two-step GMM, we stop after optimizing to ). Alternatively, it can be solved by Continuously updating GMM algorithm, which estimate and on the same time. The model is over-identified if the number of equations is larger than the number of parameters.
For CBPS, the sample analog for the covariate balancing moment condition is: , which can be written as (for ).
be the vector representing the moments we would like to solve. This contains the two conditions of maximizing the log-likelihood and balancing the covariates. Note that this is over-identified, since the number of equations is larger then the number of parameters. Another option is to consider the “just-identified” ("exact") CBPS, where we consider only the covariate balancing conditions and not the propensity score condition.
Using GMM, we have
where and , which can be estimated by
To optimize this, we use the two-step GMM, using gradient-based optimization, starting with (from the original logistic regression):
- - use gradient based optimization
 Imai, K., & Ratkovic, M. (2014). Covariate balancing propensity score. Journal of the Royal Statistical Society: Series B: Statistical Methodology, 243-263.
 PAUL R. ROSENBAUM, DONALD B. RUBIN, The central role of the propensity score in observational studies for causal effects, Biometrika, Volume 70, Issue 1, April 1983, Pages 41–55, https://doi.org/10.1093/biomet/70.1.41