Relaxed Marginal Consistency for Differentially Private Query Answering

Abstract

Many differentially private algorithms for answering database queries involve a step that reconstructs a discrete data distribution from noisy measurements. This provides consistent query answers and reduces error, but often requires space that grows exponentially with dimension. Private-PGM is a recent approach that uses graphical models to represent the data distribution, with complexity proportional to that of exact marginal inference in a graphical model with structure determined by the co-occurrence of variables in the noisy measurements. Private-PGM is highly scalable for sparse measurements, but may fail to run in high dimensions with dense measurements. We overcome the main scalability limitation of Private-PGM through a principled approach that relaxes consistency constraints in the estimation objective. Our new approach works with many existing private query answering algorithms and improves scalability or accuracy with no privacy cost.

References in corpus (11)

• A simple and practical algorithm for differentially private data release
• Learning Graphical Model Parameters with Approximate Marginal Inference
• Convergent message passing algorithms - a unifying view
• Optimizing error of high-dimensional statistical queries under differential privacy
• Convergent Message-Passing Algorithms for Inference over General Graphs with Convex Free Energies
• Graphical-model based estimation and inference for differential privacy
• New Oracle-Efficient Algorithms for Private Synthetic Data Release
• Leveraging Public Data for Practical Private Query Release
• Iterative Methods for Private Synthetic Data: Unifying Framework and New Methods
• Data-Dependent Differentially Private Parameter Learning for Directed Graphical Models
• Concavity of reweighted Kikuchi approximation