Papers for

mobile data analysts

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Efficient privacy-preserving learning of complex one-dimensional data

Efficient Agnostic Learning of Univariate Densities Under Local Differential Privacy

Abstract: We propose a general framework for non-interactive locally differentially private (LDP) learning of structured univariate distributions that can be approximated by piece-wise polynomials. This gives the first sample-efficient LDP learners for several distribution classes, including mixtures of log-concave distributions, such as Gaussian mixture models (GMMs). These learners also provide agnostic guarantees and are computationally efficient. We also prove a lower bound for learning GMMs under LDP, improving on the standard pure-DP packing lower bounds of Bun et al. [BKSW19]. To obtain our general learning framework, we develop an efficient non-interactive LDP algorithm for synthetic data generation over large domains, which may be of independent interest. We then use it together with a deterministic adaptation of the non-private piecewise polynomial learner of Acharya et al. [ADLS17].

Thu 15 OctCryptography and SecurityData Structures and AlgorithmsInformation Theory

The gist

Learning the shape of data while keeping each person's details private is challenging. The authors developed a new way to learn that works for complex data types like mixtures of normal distributions while protecting individual privacy without needing interactive communication. Their method is both sample-efficient and computationally efficient, meaning it learns accurately with fewer data and less computing power. They also proved limits on how well such learning can be done under strong privacy conditions.

Open → 2610.21033v1