Search Results for author: Garrett Bernstein

Found 7 papers, 2 papers with code

Differentially Private Bayesian Linear Regression

1 code implementation NeurIPS 2019 Garrett Bernstein, Daniel Sheldon

Linear regression is an important tool across many fields that work with sensitive human-sourced data.

regression

Differentially Private Bayesian Inference for Exponential Families

1 code implementation NeurIPS 2018 Garrett Bernstein, Daniel Sheldon

The study of private inference has been sparked by growing concern regarding the analysis of data when it stems from sensitive sources.

Bayesian Inference

Differentially Private Learning of Graphical Models using CGMs

no code implementations ICML 2017 Garrett Bernstein, Ryan McKenna, Tao Sun, Daniel Sheldon, Michael Hay, Gerome Miklau

A naive learning algorithm that uses the noisy sufficient statistics “as is” outperforms general-purpose differentially private learning algorithms.

Differentially Private Learning of Undirected Graphical Models using Collective Graphical Models

no code implementations14 Jun 2017 Garrett Bernstein, Ryan McKenna, Tao Sun, Daniel Sheldon, Michael Hay, Gerome Miklau

We investigate the problem of learning discrete, undirected graphical models in a differentially private way.

Consistently Estimating Markov Chains with Noisy Aggregate Data

no code implementations14 Apr 2016 Garrett Bernstein, Daniel Sheldon

We develop a new, simpler method of moments estimator that bypasses this problem and is consistent under noisy observations.

Bayesian Discovery of Threat Networks

no code implementations21 Nov 2013 Steven T. Smith, Edward K. Kao, Kenneth D. Senne, Garrett Bernstein, Scott Philips

A link to well-known spectral detection methods is provided, and the equivalence of the random walk and harmonic solutions to the Bayesian formulation is proven.

Network Detection Theory and Performance

no code implementations22 Mar 2013 Steven T. Smith, Kenneth D. Senne, Scott Philips, Edward K. Kao, Garrett Bernstein

The specific problem of network discovery is addressed as a special case of graph partitioning in which membership in a small subgraph of interest must be determined.

Community Detection graph partitioning

Cannot find the paper you are looking for? You can Submit a new open access paper.