TL;DR: Covariate balancing propensity score (CBPS) as mentioned in this paper was proposed to improve the empirical performance of propensity score matching and weighting methods by exploiting the dual characteristics of the propensity score as a covariate balancing score and the conditional probability of treatment assignment.
Abstract: The propensity score plays a central role in a variety of causal inference settings. In particular, matching and weighting methods based on the estimated propensity score have become increasingly common in observational studies. Despite their popularity and theoretical appeal, the main practical difficulty of these methods is that the propensity score must be estimated. Researchers have found that slight misspecification of the propensity score model can result in substantial bias of estimated treatment effects. This workshop introduces a simple and yet powerful new methodology, covariate balancing propensity score (CBPS) estimation, which significantly improves the empirical performance of propensity score methods. The CBPS simultaneously optimizes the covariate balance and the prediction of treatment assignment by exploiting the dual characteristics of the propensity score as a covariate balancing score and the conditional probability of treatment assignment. The CBPS is shown to dramatically improve the poor empirical performance of propensity score matching and weighting methods reported in the literature. In addition, the CBPS can be extended to a number of other important settings, including the estimation of the generalized propensity score for non-binary treatments, the generalization of experimental estimates to a target population, and causal inference in the longitudinal settings with marginal structural models. The open-source R package, CBPS, is available for implementing the proposed methods.
TL;DR: The generalized propensity score (GPS) as discussed by the authors is a generalized version of the binary treatment propensity score, which was proposed to remove all biases associated with dierences in the covariates.
Abstract: of the binary treatment propensity score, which we label the generalized propensity score (GPS). We demonstrate that the GPS has many of the attractive properties of the binary treatment propensity score. Just as in the binary treatment case, adjusting for this scalar function of the covariates removes all biases associated with dierences in the covariates. The GPS also has certain balancing properties that can be used to assess the adequacy of particular specications of the score. We discuss estimation and inference in a parametric
TL;DR: In this article, the authors introduce a class of robust estimators of the parameters of a stochastic utility function, called maximum score estimators, which require only weak distributional assumptions for consistency.
TL;DR: In this article, linear rank statistics are developed for tests on regression coefficients with censored data, which arise as score statistics based on the marginal probability of a generalized rank vector, and the observed Fisher information provides a variance estimator generally, while in certain special cases a permutation approach to variance estimation is also possible.
Abstract: SUMMARY Linear rank statistics are developed for tests on regression coefficients with censored data These statistics arise as score statistics based on the marginal probability of a generalized rank vector The observed Fisher information provides a variance estimator generally, while in certain special cases a permutation approach to variance estimation is also possible The
TL;DR: In this article, a generalized Fisher score was proposed to jointly select features, which maximizes the lower bound of traditional Fisher score by solving a quadratically constrained linear programming (QCLP) problem.
Abstract: Fisher score is one of the most widely used supervised feature selection methods. However, it selects each feature independently according to their scores under the Fisher criterion, which leads to a suboptimal subset of features. In this paper, we present a generalized Fisher score to jointly select features. It aims at finding an subset of features, which maximize the lower bound of traditional Fisher score. The resulting feature selection problem is a mixed integer programming, which can be reformulated as a quadratically constrained linear programming (QCLP). It is solved by cutting plane algorithm, in each iteration of which a multiple kernel learning problem is solved alternatively by multivariate ridge regression and projected gradient descent. Experiments on benchmark data sets indicate that the proposed method outperforms Fisher score as well as many other state-of-the-art feature selection methods.