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 / \varepsilon)$ error using $O(\log d)$ random bits, improving upon algorithms of Canonne et al. and Ghentiyala [CSV25, Ghe26]; this is optimal when $\varepsilon \le 1/d$. We also provide a computationally efficient version of our algorithm, albeit with an $O(\log d)$ multiplicative increase in the error.

Source: arXiv:2609.02880v1 - http://arxiv.org/abs/2609.02880v1 PDF: https://arxiv.org/pdf/2609.02880v1 Original Link: http://arxiv.org/abs/2609.02880v1