This is a theoretical mathematics preprint proving a conjecture in optimal stopping and information theory; it has not undergone peer review and does not involve clinical, biological, or empirical data.
Reported
Optimal sample complexity boundH(log(1/δ)+Ent(I)) within absolute constant…
Algorithm sample complexity boundconstant multiple of H(log(1/δ)+Ent(I)) plu…