paper-with-me

홈 › Papers

Learning Pairwise Graphical Models with Nonlinear Sufficient Statistics

2013-11-21 · Xiao-Tong Yuan, Ping Li, Tong Zhang

We investigate a generic problem of learning pairwise exponential family graphical models with pairwise sufficient statistics defined by a global mapping function, e.g., Mercer kernels. This subclass of pairwise graphical models allow us to flexibly capture complex interactions among variables beyond pairwise product. We propose two $\ell_1$-norm penalized maximum likelihood estimators to learn the model parameters from i.i.d. samples. The first one is a joint estimator which estimates all the parameters simultaneously. The second one is a node-wise conditional estimator which estimates the parameters individually for each node. For both estimators, we show that under proper conditions the extra flexibility gained in our model comes at almost no cost of statistical and computational efficiency. We demonstrate the advantages of our model over state-of-the-art methods on synthetic and real datasets.

📄 PDF Abstract BibTeX arXiv:1311.5479

Code (0)

등록된 구현이 없습니다.

Tasks

Computational Efficiency

Similar Papers 제목 키워드 기반

Generalized Root Models: Beyond Pairwise Graphical Models for Univariate Exponential Families

2016-06-02 · David I. Inouye, Pradeep Ravikumar, Inderjit S. Dhillon

We present a novel k-way high-dimensional graphical model called the Generalized Root Model (GRM) that explicitly models dependencies between variable sets of size k > 2---where k = 2 is the standard pairwise graphical m…

Differentially Private Learning of Undirected Graphical Models using Collective Graphical Models

2017-06-14 · Garrett Bernstein, Ryan McKenna, Tao Sun, Daniel Sheldon 외

We investigate the problem of learning discrete, undirected graphical models in a differentially private way. We show that the approach of releasing noisy sufficient statistics using the Laplace mechanism achieves a good…

Differentially Private Learning of Graphical Models using CGMs

2017-08-01 · ICML 2017 8 · Garrett Bernstein, Ryan McKenna, Tao Sun, Daniel Sheldon 외

We investigate the problem of learning discrete graphical models in a differentially private way. Approaches to this problem range from privileged algorithms that conduct learning completely behind the privacy barri…

Collective Graphical Models

2011-12-01 · NeurIPS 2011 12 · Daniel R. Sheldon, Thomas G. Dietterich

There are many settings in which we wish to fit a model of the behavior of individuals but where our data consist only of aggregate information (counts or low-dimensional contingency tables). This paper introduces Colle…

Computational Implications of Reducing Data to Sufficient Statistics

2014-09-12 · Andrea Montanari

Given a large dataset and an estimation task, it is common to pre-process the data by reducing them to a set of sufficient statistics. This step is often regarded as straightforward and advantageous (in that it simplifie…