paper-with-me

Papers

Private Query Release Assisted by Public Data

2020-04-23 · ICML 2020 1 · Raef Bassily, Albert Cheu, Shay Moran, Aleksandar Nikolov, Jonathan Ullman, Zhiwei Steven Wu

We study the problem of differentially private query release assisted by access to public data. In this problem, the goal is to answer a large class $\mathcal{H}$ of statistical queries with error no more than $\alpha$ using a combination of public and private samples. The algorithm is required to satisfy differential privacy only with respect to the private samples. We study the limits of this task in terms of the private and public sample complexities. First, we show that we can solve the problem for any query class $\mathcal{H}$ of finite VC-dimension using only $d/\alpha$ public samples and $\sqrt{p}d^{3/2}/\alpha^2$ private samples, where $d$ and $p$ are the VC-dimension and dual VC-dimension of $\mathcal{H}$, respectively. In comparison, with only private samples, this problem cannot be solved even for simple query classes with VC-dimension one, and without any private samples, a larger public sample of size $d/\alpha^2$ is needed. Next, we give sample complexity lower bounds that exhibit tight dependence on $p$ and $\alpha$. For the class of decision stumps, we give a lower bound of $\sqrt{p}/\alpha$ on the private sample complexity whenever the public sample size is less than $1/\alpha^2$. Given our upper bounds, this shows that the dependence on $\sqrt{p}$ is necessary in the private sample complexity. We also give a lower bound of $1/\alpha$ on the public sample complexity for a broad family of query classes, which by our upper bound, is tight in $\alpha$.

📄 PDF Abstract BibTeX arXiv:2004.10941

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Leveraging Public Data for Practical Private Query Release

2021-02-17 · Terrance Liu, Giuseppe Vietri, Thomas Steinke, Jonathan Ullman 외

In many statistical problems, incorporating priors can significantly improve performance. However, the use of prior knowledge in differentially private query release has remained underexplored, despite such priors common…

Private Synthetic Data with Hierarchical Structure

2022-06-13 · Terrance Liu, Zhiwei Steven Wu

We study the problem of differentially private synthetic data generation for hierarchical datasets in which individual data points are grouped together (e.g., people within households). In particular, to measure the simi…

Synthetic Data Generation

Leveraging Vertical Public-Private Split for Improved Synthetic Data Generation

2025-04-15 · Samuel Maddock, Shripad Gade, Graham Cormode, Will Bullock

Differentially Private Synthetic Data Generation (DP-SDG) is a key enabler of private and secure tabular-data sharing, producing artificial data that carries through the underlying statistical properties of the input dat…

Synthetic Data Generation

Joint Selection: Adaptively Incorporating Public Information for Private Synthetic Data

2024-03-12 · Miguel Fuentes, Brett Mullins, Ryan McKenna, Gerome Miklau 외

Mechanisms for generating differentially private synthetic data based on marginals and graphical models have been successful in a wide range of settings. However, one limitation of these methods is their inability to inc…

Synthetic Data Generation

BenchPress: A Human-in-the-Loop Annotation System for Rapid Text-to-SQL Benchmark Curation

2025-10-11 · Fabian Wenz, Omar Bouattour, Devin Yang, Justin Choi 외 arxiv

Large language models (LLMs) have been successfully applied to many tasks, including text-to-SQL generation. However, much of this work has focused on publicly available datasets, such as Fiben, Spider, and Bird. Our ear…