Can Foundation Models Help Us Achieve Perfect Secrecy?
Simran Arora, Christopher R\'e

TL;DR
This paper explores whether in-context learning with pretrained models can serve as a privacy-preserving baseline, achieving perfect secrecy and competing with federated learning on multiple benchmarks.
Contribution
It introduces a simple baseline using in-context learning that guarantees perfect secrecy without privacy parameters, challenging the reliance on federated learning for privacy.
Findings
In-context learning matches FL on 6 of 7 benchmarks.
The proposed method does not require privacy parameters.
It provides a stronger privacy guarantee than traditional FL.
Abstract
A key promise of machine learning is the ability to assist users with personal tasks. Because the personal context required to make accurate predictions is often sensitive, we require systems that protect privacy. A gold standard privacy-preserving system will satisfy perfect secrecy, meaning that interactions with the system provably reveal no private information. However, privacy and quality appear to be in tension in existing systems for personal tasks. Neural models typically require copious amounts of training to perform well, while individual users typically hold a limited scale of data, so federated learning (FL) systems propose to learn from the aggregate data of multiple users. FL does not provide perfect secrecy, but rather practitioners apply statistical notions of privacy -- i.e., the probability of learning private information about a user should be reasonably low. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data
