Open Problem - Is Margin Sufficient for Non-Interactive Private Distributed Learning?
COLT(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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要