3 papers
cs.DS2025
Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph
Gautam Kamath, Alireza F. Pour, Matthew Regehr +1
We propose an algorithm with improved query-complexity for the problem of hypothesis selection under local differential privacy constraints. Given a set of probability distribu…
stat.ML2023
Sample-Optimal Locally Private Hypothesis Selection and the Provable Benefits of Interactivity
Alireza F. Pour, Hassan Ashtiani, Shahab Asoodeh
We study the problem of hypothesis selection under the constraint of local differential privacy. Given a class of distributions and a set of i.i.d. samples from a…
stat.ML2023
On the Role of Noise in the Sample Complexity of Learning Recurrent Neural Networks: Exponential Gaps for Long Sequences
Alireza Fathollah Pour, Hassan Ashtiani
We consider the class of noisy multi-layered sigmoid recurrent neural networks with (unbounded) weights for classification of sequences of length , where independent noise d…