惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

量子位
云风的 BLOG
云风的 BLOG
小众软件
小众软件
IT之家
IT之家
T
Tailwind CSS Blog
WordPress大学
WordPress大学
S
SegmentFault 最新的问题
美团技术团队
博客园 - 叶小钗
V
V2EX
博客园 - Franky
大猫的无限游戏
大猫的无限游戏
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
阮一峰的网络日志
阮一峰的网络日志
博客园 - 【当耐特】
罗磊的独立博客
博客园_首页
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
爱范儿
爱范儿
宝玉的分享
宝玉的分享
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Jina AI
Jina AI
月光博客
月光博客
有赞技术团队
有赞技术团队

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Another look at Bootstrapping the Student t-statistic
Miklos Csorgo, Yuliya Martsynyuk, Masoud Nasari · 2012-09-19 · via math.ST updates on arXiv.org

Let X, X_1,X_2,... be a sequence of i.i.d. random variables with mean $μ=E X$. Let ${v_1^{(n)},...,v_n^{(n)}}_{n=1}^\infty$ be vectors of non-negative random variables (weights), independent of the data sequence ${X_1,...,X_n}_{n=1}^\infty$, and put $m_n=\sumn v_i^{(n)}$. Consider $ X^{*}_1,..., X^{*}_{m_n}$, $m_n\geq 1$, a bootstrap sample, resulting from re-sampling or stochastically re-weighing a random sample $X_1,...,X_n$, $n\geq 1$. Put $\bar{X}_n= \sumn X_i/n$, the original sample mean, and define $\bar{X^*}_{m_n}=\sumn v_i^{(n)} X_i/m_n$, the bootstrap sample mean. Thus, $\bar{X^*}_{m_n}- \bar{X}_n=\sumn ({v_i^{(n)}}/{m_n}-{1}/{n}) X_i$. Put $V_n^{2}=\sumn ({v_i^{(n)}}/{m_n}-{1}/{n})^2$ and let $S_n^{2}$, $S_{m_{n}}^{*^{2}}$ respectively be the the original sample variance and the bootstrap sample variance. The main aim of this exposition is to study the asymptotic behavior of the bootstrapped $t$-statistics $T_{m_n}^{*}:= (\bar{X^*}_{m_n}- \bar{X}_n)/(S_n V_n)$ and $T_{m_n}^{**}:= \sqrt{m_n}(\bar{X^*}_{m_n}- \bar{X}_n)/ S_{m_{n}}^{*} $ in terms of conditioning on the weights via assuming that, as $n,m_n\to \infty$, $\max_{1\leq i \leq n}({v_i^{(n)}}/{m_n}-{1}/{n})^2\big/ V_n^{2}=o(1)$ almost surely or in probability on the probability space of the weights. This view of justifying the validity of the bootstrap is believed to be new. The need for it arises naturally in practice when exploring the nature of information contained in a random sample via re-sampling, for example. Conditioning on the data is also revisited for Efron's bootstrap weights under conditions on $n,m_n$ as $n\to \infty $ that differ from requiring $m_n /n$ to be in the interval $(λ_1,λ_2)$ with 0< λ_1 < λ_2 < \infty as in Mason and Shao. Also, the validity of the bootstrapped $t$-intervals for both approaches to conditioning is established.