Internet Archive Scholar

A Computational Separation between Private Learning and Online Learning [article]

Mark Bun
2020 arXiv   pre-print

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (210.0 kB)
https://web.archive.org/web/20200720170730/https://arxiv.org/pdf/2007.05665v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

A recent line of work has shown a qualitative equivalence between differentially private PAC learning and online learning: A concept class is privately learnable if and only if it is online learnable with a finite mistake bound. However, both directions of this equivalence incur significant losses in both sample and computational efficiency. Studying a special case of this connection, Gonen, Hazan, and Moran (NeurIPS 2019) showed that uniform or highly sample-efficient pure-private learners can
more » ... be time-efficiently compiled into online learners. We show that, assuming the existence of one-way functions, such an efficient conversion is impossible even for general pure-private learners with polynomial sample complexity. This resolves a question of Neel, Roth, and Wu (FOCS 2019).
arXiv:2007.05665v1 fatcat:wljwfhh2avcgxfevzglvcv37me
Citation

Mark Bun. "A Computational Separation between Private Learning and Online Learning." arXiv (2020)