Search arXivSearch

arXiv · 2511.04957

Training and Testing with Multiple Splits: A Central Limit Theorem for Split-Sample Estimators

Abstract

As predictive algorithms grow in popularity, using the same dataset to both train and test a new model has become routine across research, policy, and industry. Sample-splitting attains valid inference on model properties by using separate subsamples to estimate the model and to evaluate it. However, this approach has two drawbacks, since each task uses only part of the data, and different splits can lead to widely different estimates. Averaging across multiple splits, I develop an inference approach that uses more data for training, uses the entire sample for testing, and improves reproducibility. I address the statistical dependence from reusing observations across splits by proving a new central limit theorem for a large class of split-sample estimators under arguably mild and general conditions. Importantly, I make no restrictions on model complexity or convergence rates. I show that confidence intervals based on the normal approximation are valid for many applications, but may undercover in important cases of interest, such as comparing the performance between two models. I develop a new inference approach for such cases, explicitly accounting for the dependence across splits. Moreover, I provide a measure of reproducibility for p-values obtained from split-sample estimators. Finally, I apply my results to two important problems in development and public economics: predicting poverty and learning heterogeneous treatment effects in randomized experiments. I show that my inference approach with repeated cross-fitting achieves better power than existing alternatives, often enough to reveal statistical significance that would otherwise be missed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bruno Fava. 2025-11-25. Training and Testing with Multiple Splits: A Central Limit Theorem for Split-Sample Estimators. https://arxiv.org/abs/2511.04957

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