Linear-Time Estimators for Propensity Scores
Abstract
We present linear-time estimators for three popular covariate shift correction and propensity scoring algorithms: logistic regression(LR), kernel mean matching(KMM), and maximum entropy mean matching(MEMM). This allows applications in situations where both treatment and control groups are large. We also show that the last two algorithms differ only in their choice of regularizer ($\ell_2$ of the Radon Nikodym derivative vs. maximum entropy). Experiments show that all methods scale well.
Cite
Text
Agarwal et al. "Linear-Time Estimators for Propensity Scores." Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011.Markdown
[Agarwal et al. "Linear-Time Estimators for Propensity Scores." Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011.](https://mlanthology.org/aistats/2011/agarwal2011aistats-lineartime/)BibTeX
@inproceedings{agarwal2011aistats-lineartime,
title = {{Linear-Time Estimators for Propensity Scores}},
author = {Agarwal, Deepak and Li, Lihong and Smola, Alexander},
booktitle = {Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics},
year = {2011},
pages = {93-100},
volume = {15},
url = {https://mlanthology.org/aistats/2011/agarwal2011aistats-lineartime/}
}