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

推荐订阅源

B
Blog
量子位
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Last Week in AI
Last Week in AI
酷 壳 – CoolShell
酷 壳 – CoolShell
人人都是产品经理
人人都是产品经理
Jina AI
Jina AI
雷峰网
雷峰网
博客园_首页
WordPress大学
WordPress大学
博客园 - 司徒正美
爱范儿
爱范儿
博客园 - 聂微东
IT之家
IT之家
美团技术团队
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 三生石上(FineUI控件)
有赞技术团队
有赞技术团队
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
T
Tailwind CSS Blog
博客园 - Franky
V
V2EX
GbyAI
GbyAI
阮一峰的网络日志
阮一峰的网络日志

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
Adaptive Experimental Design Using Shrinkage Estimators
[Submitted on 7 Feb 2026 (v1), last revised 30 Jul 2026 (this ve · 2026-02-07 · via math.ST updates on arXiv.org

View PDF HTML (experimental)

Abstract:In multi-armed trials, adaptive designs are a popular way to increase estimation efficiency or identify optimal treatments. Several recent papers have proposed adaptive variants of the classical Neyman allocation to assign treatments in sequential trials, with the goal of minimizing the error of a Horvitz-Thompson-style estimator. However, this approach may be inefficient, because it fails to borrow information across the treatment arms. In this paper, we consider adaptivity in a sequential trial with K active treatments and a control, and suggest the use of Stein-like shrinkage estimators to obtain the final causal estimates. These estimators share information across arms, yielding provable reductions in expected squared error loss relative to estimating each causal effect in isolation. Moreover, for each of our candidate shrinkers, the risk is the expectation of ratios of Gaussian quadratic forms, and can be computed efficiently via numerical integration. Hence, we suggest a simple algorithm for sequential adaptivity: assign treatments to each new arrival by choosing the arm that will minimize the estimated shrinker loss. Through simulations, we demonstrate that this approach can yield meaningful reductions in estimation error, especially in the low signal-to-noise regime. We also characterize how our adaptive algorithm assigns treatments differently than would a sequential Neyman allocation, and suggest a method for constructing shorter confidence intervals at the trial's conclusion.

Submission history

From: Evan Rosenman [view email]
[v1] Sat, 7 Feb 2026 06:51:18 UTC (2,751 KB)
[v2] Thu, 30 Jul 2026 07:55:59 UTC (4,498 KB)