Higher-order coverage errors of batching methods via Edgeworth expansions on t-statistics
利用t统计量的Edgeworth展开分析分批方法的高阶覆盖误差AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要属于通用模拟与置信区间覆盖理论,未明确对应所列领域细分。
反馈分类问题利用t统计量的Edgeworth展开分析分批方法的高阶覆盖误差AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
While batching methods have been widely used in simulation and statistics, their higher-order coverage behaviors and relative advantages in this regard remain open. We develop techniques to obtain higher-order coverage errors for batching methods by building Edgeworth-type expansions on t-statistics. The coefficients in these expansions are intricate analytically, but we provide algorithms to estimate the coefficients of the n−1 error terms via Monte Carlo simulation. We provide insights on the effect of the number of batches on the coverage error, where we demonstrate generally nonmonotonic relations. We also compare different batching methods both theoretically and numerically, and argue that none of the methods is uniformly better than others in terms of coverage. However, when the number of batches is large, sectioned jackknife has the best coverage among all.
Two frequent approaches for identifying structural VARs are external instruments, which carry economic content but are often weak, and non-Gaussianity of the shocks, which provides statistical identification but carries no economic meaning. We combine the two strategies in a single generalized method of moments framework. This hybrid approach point-identifies the target shocks while also identifying the non-target shocks up to sign and ordering. Under suitable rank…
逐点 CATE 估计的极小极大速率:设计平滑度的作用
We study the role of design smoothness in the minimax estimation of conditional average treatment effects at a fixed covariate point. For design densities bounded above and away from zero, without further regularity, we derive upper and lower risk bounds with an arbitrarily small gap in the convergence-rate exponent. Under uniform design, we obtain matching upper and lower bounds at interior points in the regime of low nuisance smoothness. These results show that rough…
多层主效应矩阵因子模型
We propose a multilevel main effects matrix factor model (MMEFM) to extract meaningful row and column effects from groups of matrix data. As a generalization of a multilevel matrix factor model, we provide rigorous definitions of MMEFM and identifications, together with iterative algorithms for the estimators of all global and local components in the main effects and common component, including global/local main effects and core ranks, with rates of convergence spelt out. An…
高维稀疏组卷积平滑分位数回归
In many applications, covariates are naturally organized into groups, yet conventional group-selection methods often retain all variables within selected groups, failing to achieve within-group sparsity. To address this limitation, we propose an adaptive two-stage sparse-group selection procedure for high-dimensional quantile regression. The proposed method integrates convolution-smoothed quantile loss with $\ell_{2,0}$ and $\ell_0$ penalties to identify important groups and…
PICPIs:预测区间条件预测区间
A classical question in statistics is which observable quantities to condition on when drawing inferences about unobservable targets. For conformal prediction in nonparametric uncertainty quantification, standard marginal validity offers limited resolution at the prediction values on which decisions are based, and fully conditional guarantees with respect to the covariates are provably unattainable. We address this gap by introducing a prediction-based conditioning framework…
Bayesian additive regression trees (BART) is a popular Bayesian ensemble model used in regression and classification analysis. Under this modeling framework, the regression function is approximated by an ensemble of decision trees, interpreted as weak learners. In this work, we propose a generalization of the BART model that has two main features: first, it automatically selects the number of decision trees using the given data; second, the model allows clusters of…