Open Problem: Is Margin Sufficient for Non-Interactive Private Distributed Learning?


Amit Daniely, Vitaly Feldman ;
Proceedings of the Thirty-Second Conference on Learning Theory, PMLR 99:3180-3184, 2019.


We ask whether every class of Boolean functions that has polynomial margin complexity can be PAC learned efficiently by a non-interactive locally differentially private algorithm.

Related Material