1 citations · 1 across the 4 of their papers we have counts for
4 papers
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…
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…
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…
Simple Binary Hypothesis Testing under Local Differential Privacy and Communication Constraints
Ankit Pensia, Amir R. Asadi, Varun Jog +1
We study simple binary hypothesis testing under both local differential privacy (LDP) and communication constraints. We qualify our results as either minimax optimal or instance op…