Concept
Deterministic Equal-Count Plan
A sampling constraint framework in SR-type algorithms in which the number of samples drawn from each candidate arm in every phase is predetermined and equal, making the phase length the only degree of freedom available for optimization.
Timeline (last 90 days)
Oct 16
H₁-SR's optimized schedule is optimal among SR-type algorithms with deterministic equal-counting schedules.
Unverified50%
Oct 16
A deterministic equal-counting schedule means that in SR-type algorithms, the number of times each candidate arm is sampled in each stage is predetermined and equal.
Unverified50%