REVIEW 2 cited by
Asymptotic Representations for Sequential Decisions, Adaptive Experiments, and Batched Bandits
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We develop asymptotic approximations that can be applied to sequential estimation and inference problems, adaptive randomized controlled trials, and related settings. In batched adaptive settings where the decision at one stage can affect the observation of variables in later stages, our asymptotic representation characterizes all limit distributions attainable through a joint choice of an adaptive design rule and statistics applied to the adaptively generated data. This facilitates local power analysis of tests, comparison of adaptive treatments rules, and other analyses of batchwise sequential statistical decision rules.
Forward citations
Cited by 2 Pith papers
-
Minimax and Bayes Optimal Best-Arm Identification
TS-SPAS attains the exact asymptotic minimax and Bayes constants for fixed-budget best-arm identification, with matching lower and upper bounds over exponential family outcomes.
-
Admissibility of Completely Randomized Trials: A Large-Deviation Approach
Batched arm elimination designs with a sufficiently large first batch achieve a strictly higher large-deviation efficiency exponent than completely randomized trials for every Gaussian instance with K at least 3.
Discussion (0). Sign in to comment.