Search arXivSearch

arXiv · 2504.13273

How Much Weak Overlap Can Doubly Robust T-Statistics Handle?

Abstract

In the presence of sufficiently weak overlap, it is known that no regular root-n-consistent estimators exist and standard estimators may fail to be asymptotically normal. This paper shows that a thresholded version of the standard doubly robust estimator is asymptotically normal with well-calibrated Wald confidence intervals even when constructed using nonparametric estimates of the propensity score and conditional mean outcome. The analysis implies a cost of weak overlap in terms of black-box nuisance rates, borne when the semiparametric bound is infinite, and the contribution of outcome smoothness to the outcome regression rate, which is incurred even when the semiparametric bound is finite. As a byproduct of this analysis, I show that under weak overlap, the optimal global regression rate is the same as the optimal pointwise regression rate, without the usual polylogarithmic penalty. The high-level conditions yield new rules of thumb for thresholding in practice. In simulations, thresholded AIPW can exhibit moderate overrejection in small samples, but I am unable to reject a null hypothesis of exact coverage in large samples. In an empirical application, the clipped AIPW estimator that targets the standard average treatment effect yields similar precision to a heuristic 10% fixed-trimming approach that changes the target sample.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jacob Dorn. 2025-04-22. How Much Weak Overlap Can Doubly Robust T-Statistics Handle?. https://arxiv.org/abs/2504.13273

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Testing for Monotone Equilibrium Strategies in Games of Incomplete Information

This paper develops a unified framework for testing monotonicity of Bayesian Nash equilibrium strategies in unobserved types in games of incomplete information. We show that, under symmetric independent private types, monotonicity of differentiable equilibrium strategies is equivalent to monotonicity of a quasi-inverse strategy identified from observed actions. This allows the problem to be reformulated as testing a countable set of moment inequalities involving unconditional expectations. We propose a Cramer-von Mises-type statistic with bootstrap critical values. The method accommodates covariates and game heterogeneity. Monte Carlo simulations demonstrate finite-sample performance, and an application to procurement auctions illustrates cartel detection.

econ.EM

Ordinal Distributional Change and Conservative Transition Benchmarks: Measurement, Identification, and Inference

Repeated cross-sections reveal changes in ordinal distributions but not the transitions producing them. I axiomatically characterize a threshold-weighted probability metric for ordinal change from threshold-crossing principles. For any threshold-additive ordinal geometry, the discrepancy coincides with the Wasserstein--1 distance induced by that ground metric and measures minimum displacement; its optimizing plans define conservative transition benchmarks. With missing outcomes, I derive sharp identified sets for the discrepancy and endpoint-conditioned benchmark plans. I develop finite-sample-valid projection inference using randomized Monte Carlo calibration and global search with an almost-sure convergence guarantee. Applied to Arab Barometer data, the framework documents a robust shift toward broader and more regular remittance receipt in Lebanon. The discrepancy interval remains well separated from zero after allowing for item nonresponse and sampling uncertainty, while benchmark bounds provide strong numerical evidence that least-displacement restructuring excludes movement toward less frequent receipt and requires reassignment from nonreceipt to recurrent receipt.

econ.EM

A Stochastic Nested Fixed Point Algorithm for Large-Scale BLP Estimation

We develop a stochastic nested fixed point (SNFP) estimator for random coefficients logit demand models that updates model parameters using stochastic gradients and performs demand inversion one market at a time. Relative to the conventional nested fixed point (NFP) estimator, SNFP substantially reduces memory requirements and computational cost, making estimation feasible in very large datasets. We establish the large-$T$ (number of markets) asymptotic properties of the estimator under regularity conditions. We also characterize the effect of sharing one block of simulation draws across markets and show how to correct for it. Monte Carlo simulations show that the SNFP estimator achieves statistical accuracy comparable to the NFP estimator, and in our benchmark a single online pass estimates a model with 100 million markets in about 5.5 hours. An empirical application using scanner data further demonstrates the practical advantages of SNFP for large-scale demand estimation.

econ.EM