Refined Cluster Robust Inference
Bulat Gafarov, Takuya Ura

TL;DR
This paper introduces a refined inference method for clustered data that improves accuracy with small numbers of clusters by using a critical value based on the conditional Cramér-Edgeworth expansion, avoiding resampling.
Contribution
It proposes a third-order refined critical value for cluster-robust inference that performs well with few clusters, without resampling, and applies to both discrete and continuous regressors.
Findings
Improves size control with as few as 10 clusters.
Achieves third-order refinement in inference accuracy.
Avoids resampling methods like bootstrap.
Abstract
It has become standard for empirical studies to conduct inference robust to cluster dependence and heterogeneity. With a small number of clusters, the normal approximation for the -statistics of regression coefficients may be poor. This paper tackles this problem using a critical value based on the conditional Cram\'er-Edgeworth expansion for the -statistics. Our approach guarantees third-order refinement, regardless of whether a regressor is discrete or not, and, unlike the cluster pairs bootstrap, avoids resampling data. Simulations show that our proposal can make a difference in size control with as few as 10 clusters.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Statistical Methods and Inference · Stochastic Gradient Optimization Techniques
