Pith. sign in

Balancing Covariates in Randomized Experiments with the Gram-Schmidt Walk Design

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

The design of experiments involves a compromise between covariate balance and robustness. This paper provides a formalization of this trade-off and describes an experimental design that allows experimenters to navigate it. The design is specified by a robustness parameter that bounds the worst-case mean squared error of an estimator of the average treatment effect. Subject to the experimenter's desired level of robustness, the design aims to simultaneously balance all linear functions of potentially many covariates. Less robustness allows for more balance. We show that the mean squared error of the estimator is bounded in finite samples by the minimum of the loss function of an implicit ridge regression of the potential outcomes on the covariates. Asymptotically, the design perfectly balances all linear functions of a growing number of covariates with a diminishing reduction in robustness, effectively allowing experimenters to escape the compromise between balance and robustness in large samples. Finally, we describe conditions that ensure asymptotic normality and provide a conservative variance estimator, which facilitate the construction of asymptotically valid confidence intervals.

years

2026 2

representative citing papers

Dynamic Rank, Basis, and Matching

cs.DS · 2026-05-11 · unverdicted · novelty 8.0

The first dynamic algorithms for matrix rank and related objects achieve update times scaling with rank r, specifically Õ(r^1.405) per entry update and Õ(r^1.528 + z) per column update, extending to dynamic maximum matching.

Optimal Designs with Robust Inference for Binary Treatment Effects

stat.ME · 2026-07-07 · conditional · novelty 6.0

Balanced designs that balance covariates (especially blocking) are asymptotically variance-optimal for binary ATE under Neyman's nonparametric model, and a CMH-based variance estimator is finite-sample conservative and asymptotically tight under local alternatives.

citing papers explorer

Showing 2 of 2 citing papers.

  • Dynamic Rank, Basis, and Matching cs.DS · 2026-05-11 · unverdicted · none · ref 74

    The first dynamic algorithms for matrix rank and related objects achieve update times scaling with rank r, specifically Õ(r^1.405) per entry update and Õ(r^1.528 + z) per column update, extending to dynamic maximum matching.

  • Optimal Designs with Robust Inference for Binary Treatment Effects stat.ME · 2026-07-07 · conditional · none · ref 13 · internal anchor

    Balanced designs that balance covariates (especially blocking) are asymptotically variance-optimal for binary ATE under Neyman's nonparametric model, and a CMH-based variance estimator is finite-sample conservative and asymptotically tight under local alternatives.