Locally Private Bayesian Inference for Count Models
summary
Proposes locally private Bayesian inference for Poisson count models using the two-sided geometric mechanism for integer noise, rewrites noisy counts as differences of Poissons (Skellam) and introduces a Bessel auxiliary to sample true counts inside MCMC, then runs Poisson factorization (topic and community models). Shows on synthetic, State of the Union and Enron data that this posterior-aware method recovers much sparser means, often beating the naive truncate-and-fit baseline and nearly matching non-private error; notes scalability work moving to variational inference for speed.
AI-written summary · about
chapters (14)
- 0:00Introduction
- 0:40Project Background
- 3:25Bayesian Persona Factorization
- 7:15Poisson Distribution
- 9:05Example
- 9:45Motivation
- 20:19Data
- 20:57Geometric Distribution
- 32:40Email
- 33:19Experiments
- 36:33Data Set
- 37:43Community Detection
- 44:56Noise
- 45:26Faster Inference
related talks
01h 04mNonparametric Bayesian Methods: Models, Algorithms, and Applications II
01h 06mNonparametric Bayesian Methods: Models, Algorithms, and Applications I
01h 02mNonparametric Bayesian Methods: Models, Algorithms, and Applications III
01h 07mStatistical Inference and Privacy, Part I
43mPufferfish Privacy Mechanisms for Correlated Data
42mBayesian Non-parametric Models for Data Science using PyMC3
39mLocal Algorithms for Community Detection
25mScaling Bayesian Experimentation
