English
Related papers

Related papers: Adaptive Neyman Allocation

200 papers

We address the computational efficiency in solving the A-optimal Bayesian design of experiments problems for which the observational map is based on partial differential equations and, consequently, is computationally expensive to evaluate.…

Numerical Analysis · Mathematics 2023-08-14 Vinh Hoang , Luis Espath , Sebastian Krumscheid , Raúl Tempone

Most Bayesian response-adaptive designs unbalance randomization rates towards the most promising arms with the goal of increasing the number of positive treatment outcomes during the study, even though the primary aim of the trial is…

Applications · Statistics 2018-07-02 Steffen Ventz , Matteo Cellamare , Sergio Bacallado , Lorenzo Trippa

We present a new experimental design procedure that divides a set of experimental units into two groups in order to minimize error in estimating an additive treatment effect. One concern is minimizing error at the experimental design stage…

Methodology · Statistics 2021-02-02 Abba M. Krieger , David Azriel , Adam Kapelner

Online controlled experiments (A/B tests) have become the gold standard for learning the impact of new product features in technology companies. Randomization enables the inference of causality from an A/B test. The randomized assignment…

Applications · Statistics 2022-12-20 Qike Li , Samir Jamkhande , Pavel Kochetkov , Pai Liu

We study clustered multitask learning in a semiparametric setting where tasks share a latent cluster structure in their target parameters but exhibit heterogeneous, potentially infinite-dimensional nuisance components. Such heterogeneity…

Machine Learning · Statistics 2026-05-05 Hanxiao Chen , Debarghya Mukherjee

Adaptive approaches, allowing for more flexible trial design, have been proposed for individually randomized trials to save time or reduce sample size. However, adaptive designs for cluster-randomized trials in which groups of participants…

Methodology · Statistics 2022-01-10 Junwei Shen , Shirin Golchi , Erica E. M. Moodie , David Benrimoh

Matching is a widely used causal inference design that aims to approximate a randomized experiment using observational data by forming matched sets of treated and control units based on similarities in their covariates. Ideally, treated…

Methodology · Statistics 2026-04-06 Jianan Zhu , Jeffrey Zhang , Zijian Guo , Siyu Heng

A/B testing is an important decision-making tool in product development for evaluating user engagement or satisfaction from a new service, feature or product. The goal of A/B testing is to estimate the average treatment effects (ATE) of a…

Methodology · Statistics 2020-08-21 Yifan Zhou , Yang Liu , Ping Li , Feifang Hu

Response-adaptive randomization has recently attracted a lot of attention in the literature. In this paper, we propose a new and simple family of response-adaptive randomization procedures that attain the Cramer--Rao lower bounds on the…

Statistics Theory · Mathematics 2009-08-25 Feifang Hu , Li-Xin Zhang , Xuming He

While scaling test-time compute can substantially improve model performance, existing approaches either rely on static compute allocation or sample from fixed generation distributions. In this work, we introduce a test-time compute…

Artificial Intelligence · Computer Science 2026-04-24 Bowen Zuo , Dongruo Zhou , Yinglun Zhu

In the first stage of a two-stage study, the researcher uses a statistical model to impute the unobserved exposures. In the second stage, imputed exposures serve as covariates in epidemiological models. Imputation error in the first stage…

Applications · Statistics 2021-07-19 Ron Sarafian , Itai Kloog , Jonathan D. Rosenblatt

When data is of an extraordinarily large size or physically stored in different locations, the distributed nearest neighbor (NN) classifier is an attractive tool for classification. We propose a novel distributed adaptive NN classifier for…

Machine Learning · Statistics 2023-06-06 Ruiqi Liu , Ganggang Xu , Zuofeng Shang

Suppose an online platform wants to compare a treatment and control policy, e.g., two different matching algorithms in a ridesharing system, or two different inventory management algorithms in an online retail site. Standard randomized…

Methodology · Statistics 2022-12-27 Peter Glynn , Ramesh Johari , Mohammad Rasouli

The question of selecting the "best" amongst different choices is a common problem in statistics. In drug development, our motivating setting, the question becomes, for example: what is the dose that gives me a pre-specified risk of…

Statistics Theory · Mathematics 2018-03-15 Pavel Mozgunov , Thomas Jaki

Accurate detection of infected individuals is one of the critical steps in stopping any pandemic. When the underlying infection rate of the disease is low, testing people in groups, instead of testing each individual in the population, can…

In his seminal 1923 work, Neyman studied the variance estimation problem for the difference-in-means estimator of the average treatment effect in completely randomized experiments. He proposed a variance estimator that is conservative in…

Methodology · Statistics 2025-07-01 Ambarish Chattopadhyay , Guido W. Imbens

We consider an experiment with at least two stages or batches and $O(N)$ subjects per batch. First, we propose a semiparametric treatment effect estimator that efficiently pools information across the batches, and show it asymptotically…

Methodology · Statistics 2023-09-28 Harrison H. Li , Art B. Owen

Adaptive experiments, including efficient average treatment effect estimation and multi-armed bandit algorithms, have garnered attention in various applications, such as social experiments, clinical trials, and online advertisement…

Methodology · Statistics 2021-03-24 Masahiro Kato

We present a new experimental design procedure that divides a set of experimental units into two groups so that the two groups are balanced on a prespecified set of covariates and being almost as random as complete randomization. Under…

Statistics Theory · Mathematics 2016-12-08 Abba M. Krieger , David Azriel , Adam Kapelner

Group testing is a well known search problem that consists in detecting the defective members of a set of objects O by performing tests on properly chosen subsets (pools) of the given set O. In classical group testing the goal is to find…

Data Structures and Algorithms · Computer Science 2016-06-13 Annalisa De Bonis
‹ Prev 1 3 4 5 6 7 10 Next ›