Reproduce “The Price of List Replicability: Tight Bounds for Bias Estimation” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Michael Chen, Atieh Bastan, A. Pavan, N. V. Vinodchandran
The authors characterize the coin tosses needed to estimate d unknown coin biases while returning a reliable list of accurate answers. Their algorithm uses a shared random shift and selectively takes extra tosses near rounding boundaries. For lists of size d+1, upper and lower bounds match at ~d²/ε² up to polylogarithmic factors, under the stated parameter conditions.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.