mlsanityData to 14 Oct 2026

CLT and Edgeworth Expansion for m-out-of-n Bootstrap Estimators of The Studentized Median

arXiv 2505.11725 ↗First posted 16 May 2025cs.LG cs.AI cs.CEcited by 2

Not on the map. Why?

Abstract (arXiv)

The m-out-of-n bootstrap, originally proposed by Bickel, Gotze, and Zwet (1992), approximates the distribution of a statistic by repeatedly drawing m subsamples (with m much smaller than n) without replacement from an original sample of size n. It is now routinely used for robust inference with heavy-tailed data, bandwidth selection, and other large-sample applications. Despite its broad applicability across econometrics, biostatistics, and machine learning, rigorous parameter-free guarantees for the soundness of the m-out-of-n bootstrap when estimating sample quantiles have remained elusive. This paper establishes such guarantees by analyzing the estimator of sample quantiles obtained from m-out-of-n resampling of a dataset of size n. We first prove a central limit theorem for a fully data-driven version of the estimator that holds under a mild moment condition and involves no unknown nuisance parameters. We then show that the moment assumption is essentially tight by constructing a counter-example in which the CLT fails. Strengthening the assumptions slightly, we derive an Edgeworth expansion that provides exact convergence rates and, as a corollary, a Berry Esseen bound on the bootstrap approximation error. Finally, we illustrate the scope of our results by deriving parameter-free asymptotic distributions for practical statistics, including the quantiles for random walk Metropolis-Hastings and the rewards of ergodic Markov decision processes, thereby demonstrating the usefulness of our theory in modern estimation and learning tasks.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 13 of its 75 references that are in the map. First posted on arXiv 16 May 2025.

Builds on

13 of 75 references.

References · 13

  1. 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 735
  2. 2023mBLIP: Efficient Bootstrapping of Multilingual Vision-LLMscited by 41
  3. 2016Partially Observed Markov Decision Processes. Problem Sets and Internet Supplementcited by 34
  4. 2021Online Bootstrap Inference For Policy Evaluation in Reinforcement Learningcited by 26
  5. 2023Efficient Toxic Content Detection by Bootstrapping and Distilling Large Language Modelscited by 21
  6. 2024Free and Customizable Code Documentation with LLMs: A Fine-Tuning Approachcited by 10
  7. 2019On Applications of Bootstrap in Continuous Space Reinforcement Learningcited by 9
  8. 2023Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple!cited by 8
  9. 2022Offline Estimation of Controlled Markov Chains: Minimaxity and Sample Complexitycited by 5
  10. 2023On the Consistency of Maximum Likelihood Estimation of Probabilistic Principal Component Analysiscited by 5
  11. 2024MM-PoE: Multiple Choice Reasoning via. Process of Elimination using Multi-Modal Modelscited by 5
  12. 2016Bootstrap Model Aggregation for Distributed Statistical Learningcited by 4
1 more
  1. 2024Bootstrap Your Own Context Lengthcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.