On the inconsistency of matching without replacement
The paper shows that matching without replacement on propensity scores produces estimators that generally are inconsistent for the average treatment effect of the treated. To achieve consistency, practitioners must either assume that no units exist with propensity scores greater than one-half or assume that there is no confounding among such units. The result is not driven by the use of propensity scores, and similar artifacts arise when matching on other scores as long as it is without replacement.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
SIGMA: A Structural Inconsistency Reducing Graph Matching Algorithm
Graph matching finds the correspondence of nodes across two correlated graphs and lies at the core of many applications. When graph side information is not available, the node correspondence is estimated on the sole basi…
Graph MatchingMinibatch vs Local SGD with Shuffling: Tight Convergence Bounds and Beyond
In distributed learning, local SGD (also known as federated averaging) and its simple baseline minibatch SGD are widely studied optimization methods. Most existing analyses of these methods assume independent and unbiase…
Cross-PCR: A Robust Cross-Source Point Cloud Registration Framework
Due to the density inconsistency and distribution difference between cross-source point clouds, previous methods fail in cross-source point cloud registration. We propose a density-robust feature extraction and matching …
Point Cloud RegistrationIncremental Sampling Without Replacement for Sequence Models
Sampling is a fundamental technique, and sampling without replacement is often desirable when duplicate samples are not beneficial. Within machine learning, sampling is useful for generating diverse outputs from a traine…
Combinatorial OptimizationProgram SynthesisOn the Trajectories of SGD Without Replacement
This article examines the implicit regularization effect of Stochastic Gradient Descent (SGD). We consider the case of SGD without replacement, the variant typically used to optimize large-scale neural networks. We analy…