arXiv Machine Learning By Rundong Ding, Yiyun He, Yizhe Zhu

Minimax optimal differentially private synthetic data for smooth queries

Read the original on arXiv Machine Learning →

arXiv:2602. 01607v3 Announce Type: replace-cross Abstract: Differentially private synthetic data enables the sharing and analysis of sensitive datasets while providing rigorous privacy guarantees for individual contributors.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 21

The Binary Tree Mechanism is Optimal for Differentially Private Continual Counting

arXiv:2607. 00876v3 Announce Type: replace-cross Abstract: Private continual counting is a fundamental problem in differential privacy: given a binary stream of length $n$, where each $1$ corresponds to the contribution of one individual, the goal is to release all running counts while protecting the privacy of each individual.

By Konstantina Bairaktari, Markus Engelund Dahl, Kasper Green Larsen