no code implementations • 9 Dec 2023 • Alireza F. Pour, Hassan Ashtiani, Shahab Asoodeh
Namely, it breaks the known lower bound of $\Omega\left(\frac{k\log k}{\alpha^2\min \{ \varepsilon^2 , 1\}} \right)$ for the sample complexity of non-interactive hypothesis selection.
