Learning Differentially Private Mechanisms
원문 초록
Differential privacy is a formal, mathematical definition of data privacy that has gained traction in academia, industry, and government. The task of correctly constructing differentially private algorithms is non-trivial, and mistakes have been made in foundational algorithms. Currently, there is no automated support for converting an existing, non-private program into a differentially private version. In this paper, we propose a technique for automatically learning an accurate and differentially private version of a given non-private program. We show how to solve this difficult program synthesis problem via a combination of techniques: carefully picking representative example inputs, reducing the problem to continuous optimization, and mapping the results back to symbolic expressions. We demonstrate that our approach is able to learn foundational algorithms from the differential privacy literature and significantly outperforms natural program synthesis baselines.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
CLEVER: A Curated Benchmark for Formally Verified Code Generation
Transductively Informed Inductive Program Synthesis
PoE-World: Compositional World Modeling with Products of Programmatic Experts
Enhancing Code Generation via Bidirectional Comment-Level Mutual Grounding
Rewriting Pre-Training Data Boosts LLM Performance in Math and Code
OSVBench: Benchmarking LLMs on Specification Generation Tasks for Operating System Verification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.