arXiv (All)
open access
Overcoming the Randomness-Utility Trade-off in Answering Differentially Private Linear Queries
We study the question of answering linear queries with differential privacy using few (expected) random bits. We provide a randomness-efficient analog of the $\| \cdot \|_K$-norm mechanism of Hardt and Talwar [HT10]. For the $\ell_\infty$-error, our algorithm can answer $d$ linear queries with $O(d
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Overcoming the Randomness-Utility Trade-off in Answering Differentially Private Linear Queries#632758
- Overcoming the Randomness-Utility Trade-off in Answering Differentially Private Linear Queries#920762
- Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning#609724
- Contraction and Statistical Inference under Privacy for Uniformly Bounded Distributions#1064841
- LAPRAS : Learning-Augmented PRivate Answering for linear query Streams#155416
Record · ID 924996
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive