Improving reproducibility by controlling random seed stability in machine learning based estimation via bagging

arXiv:2604.17694v1 Announce Type: cross Abstract: Predictions from machine learning algorithms can vary across random seeds, inducing instability in downstream debiased machine learning estimators. We formalize random seed stability via a concentration condition and prove that subbagging guarantees stability for any bounded-outcome regression algorithm. We introduce a new cross-fitting procedure, adaptive cross-bagging, which simultaneously eliminates seed dependence from both nuisance estimation and sample splitting in debiased machine learning. Numerical experiments confirm that the method achieves the targeted level of stability whereas alternatives do not. Our method incurs a small computational penalty relative to standard practice whereas alternative methods incur large penalties.

Related

• Stability of a Generalized Debiased Lasso with Applications to Resampling-Based Variable Selection
• Wasserstein-p Central Limit Theorem Rates: From Local Dependence to Markov Chains
• Binomial Gradient-Based Meta-Learning for Enhanced Meta-Gradient Estimation
• Random Matrix Theory for Deep Learning: Beyond Eigenvalues of Linear Models

Source: arXiv cs.LG | 2026-04-21