Certified private data release for sparse Lipschitz functions

February 19, 2023 Β· Declared Dead Β· πŸ› International Conference on Artificial Intelligence and Statistics

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Konstantin Donhauser, Johan Lokna, Amartya Sanyal, March Boedihardjo, Robert HΓΆnig, Fanny Yang arXiv ID 2302.09680 Category cs.CR: Cryptography & Security Citations 5 Venue International Conference on Artificial Intelligence and Statistics Last Checked 6 months ago
Abstract
As machine learning has become more relevant for everyday applications, a natural requirement is the protection of the privacy of the training data. When the relevant learning questions are unknown in advance, or hyper-parameter tuning plays a central role, one solution is to release a differentially private synthetic data set that leads to similar conclusions as the original training data. In this work, we introduce an algorithm that enjoys fast rates for the utility loss for sparse Lipschitz queries. Furthermore, we show how to obtain a certificate for the utility loss for a large class of algorithms.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Cryptography & Security

Died the same way β€” πŸ‘» Ghosted