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

推荐订阅源

J
Java Code Geeks
月光博客
月光博客
aimingoo的专栏
aimingoo的专栏
Google DeepMind News
Google DeepMind News
Recent Announcements
Recent Announcements
MyScale Blog
MyScale Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
S
SegmentFault 最新的问题
Hugging Face - Blog
Hugging Face - Blog
Martin Fowler
Martin Fowler
WordPress大学
WordPress大学
F
Fortinet All Blogs
小众软件
小众软件
D
Docker
U
Unit 42
博客园 - 聂微东
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
爱范儿
爱范儿
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
IT之家
IT之家
云风的 BLOG
云风的 BLOG
博客园 - 司徒正美
有赞技术团队
有赞技术团队
腾讯CDC

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Efficient Covariate-Adaptive Randomization with Smallest ...
[Submitted on 8 Dec 2019 (v1), last revised 3 Sep 2026 (this ver · 2019-12-08 · via math 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)