Functional Approximation Methods for Differentially Private Distribution Estimation
Ye Tao, Anand D. Sarwate

TL;DR
This paper presents new functional approximation techniques for differentially private CDF estimation, enabling efficient and accurate privacy-preserving distribution analysis suitable for streaming and decentralized data.
Contribution
It introduces polynomial projection and sparse approximation methods for private CDF estimation, advancing practical approaches with systematic evaluation of function spaces.
Findings
Methods achieve comparable or better accuracy than existing approaches.
Effective in decentralized and streaming data scenarios.
Systematic analysis of dictionary choices impacts performance.
Abstract
The cumulative distribution function (CDF) is fundamental for characterizing random variables, making it essential in applications that require privacy-preserving data analysis. This paper introduces a novel framework for constructing differentially private CDFs inspired by functional analysis and the functional mechanism. We develop two variants: a polynomial projection method, which projects the empirical CDF into a polynomial space, and a sparse approximation method via matching pursuit, which projects it into arbitrary function spaces constructed from dictionaries. In both cases, the empirical CDF is approximated within the chosen space, and the corresponding coefficients are privatized to guarantee differential privacy. Compared with existing approaches such as histogram queries and adaptive quantiles, our methods achieve comparable or superior performance. Our methods are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
