New algorithm improves private synthetic data utility for smooth queries

Researchers have developed a new algorithm for generating differentially private synthetic data that offers improved utility for specific types of queries. The algorithm achieves a minimax error rate of O(n^{-min{1, k/d}}) for k-smooth queries, outperforming previous methods for these specific query classes. This work also establishes the first minimax lower bound for k-smooth query utility under $(\varepsilon, \delta)$-differential privacy. AI

IMPACT Enhances privacy-preserving data analysis techniques, potentially enabling broader use of sensitive datasets for research.

RANK_REASON This is a research paper detailing a new algorithm and theoretical bounds for differentially private synthetic data generation. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv stat.ML →

• $(\varepsilon, \delta)$-differentially private synthetic data
• Yizhe Zhu

• paper
• safety

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →