Open Problem: Is Margin Sufficient for NonInteractive Private Distributed Learning?
[edit]
Proceedings of the ThirtySecond Conference on Learning Theory, PMLR 99:31803184, 2019.
Abstract
We ask whether every class of Boolean functions that has polynomial margin complexity can be PAC learned efficiently by a noninteractive locally differentially private algorithm.
Related Material


