3 papers
cs.IT2026
Tight Information Complexity of the Coin Problem in the Broadcast Model
Hadi Kazemi, Varun Jog
We study distributed testing of versus in the broadcast, or shared-blackboard, model. For protocols with constant advantage, we characterise up…
cs.IT2025
The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints
Hadi Kazemi, Ankit Pensia, Varun Jog
This paper resolves two open problems from a recent paper, arXiv:2403.16981, concerning the sample complexity of distributed simple binary hypothesis testing under information cons…
math.ST2025
The Sample Complexity of Simple Binary Hypothesis Testing
Ankit Pensia, Varun Jog, Po-Ling Loh
The sample complexity of simple binary hypothesis testing is the smallest number of i.i.d.\ samples required to distinguish between two distributions and in either: (i) the…