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

推荐订阅源

aimingoo的专栏
aimingoo的专栏
博客园 - 三生石上(FineUI控件)
GbyAI
GbyAI
大猫的无限游戏
大猫的无限游戏
M
MIT News - Artificial intelligence
Microsoft Azure Blog
Microsoft Azure Blog
月光博客
月光博客
Engineering at Meta
Engineering at Meta
I
InfoQ
T
Tailwind CSS Blog
N
Netflix TechBlog - Medium
S
SegmentFault 最新的问题
H
Help Net Security
博客园 - 【当耐特】
WordPress大学
WordPress大学
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
美团技术团队
博客园 - 叶小钗
T
The Blog of Author Tim Ferriss
腾讯CDC
雷峰网
雷峰网
Martin Fowler
Martin Fowler
The GitHub Blog
The GitHub Blog
D
Docker

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
Efficient Covariate-Adaptive Randomization with Smallest ...
[Submitted on 8 Dec 2019 (v1), last revised 3 Sep 2026 (this ver · 2019-12-08 · via math.ST updates on arXiv.org

View PDF HTML (experimental)

Abstract:The power of conventional hypothesis tests and the selection bias in covariate-adaptive randomized clinical trials are typically investigated through simulation studies. In this article, we develop a theoretical framework for analyzing both the asymptotic power of linear-model-based tests for treatment effects and the asymptotic selection bias. Our results reveal that under covariate-adaptive randomization: (i) hypothesis tests generally lose power when covariates are not sufficiently balanced; in particular, the more covariates included in the testing model that are not accounted for in the randomization procedure, the greater the loss of power; (ii) the hypothesis test is usually more powerful than that under complete randomization; and (iii) compared with complete randomization, many popular covariate-adaptive randomization procedures in the literature such as Pocock and Simon's marginal procedure, the stratified permuted block design, and Taves's minimization method-are generally efficient in terms of power but yield non-negligible selection bias. To address this trade-off, we propose a new family of covariate-adaptive randomization procedures that simultaneously account for both power and selection bias. Under these procedures, covariate imbalances are kept sufficiently small to achieve asymptotically maximal power for testing treatment effects, while the selection bias remains asymptotically negligible. These theoretical results provide a comprehensive picture of how the power of hypothesis testing, covariate imbalance, and selection bias interact with one another.

Submission history

From: Li-Xin Zhang [view email]
[v1] Sun, 8 Dec 2019 08:05:09 UTC (29 KB)
[v2] Mon, 3 May 2021 03:23:25 UTC (31 KB)
[v3] Thu, 3 Sep 2026 03:49:05 UTC (33 KB)