A Simple Algorithm for Scalable Monte Carlo Inference

01/02/2019
by   Alexander Borisenko, et al.
0

Statistical inference involves estimation of parameters of a model based on observations. Building on the recently proposed Equilibrium Expectation approach and Persistent Contrastive Divergence, we derive a simple and fast Markov chain Monte Carlo algorithm for maximum likelihood estimation (MLE) of parameters of exponential family distributions. The algorithm has good scaling properties and is suitable for Monte Carlo inference on large network data with billions of tie variables. The performance of the algorithm is demonstrated on Markov random fields, conditional random fields, exponential random graph models and Boltzmann machines.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2016

Convergence of Contrastive Divergence Algorithm in Exponential Family

This paper studies the convergence properties of contrastive divergence ...
research
02/28/2018

Fast Maximum Likelihood estimation via Equilibrium Expectation for Large Network Data

Complex network data may be analyzed by constructing statistical models ...
research
07/15/2013

Bayesian Structured Prediction Using Gaussian Processes

We introduce a conceptually novel structured prediction model, GPstruct,...
research
11/07/2005

Discrete Network Dynamics. Part 1: Operator Theory

An operator algebra implementation of Markov chain Monte Carlo algorithm...
research
05/26/2022

A Partially Separable Temporal Model for Dynamic Valued Networks

The Exponential-family Random Graph Model (ERGM) is a powerful statistic...
research
07/13/2020

Minimum Relative Entropy Inference for Normal and Monte Carlo Distributions

We represent affine sub-manifolds of exponential family distributions as...

Please sign up or login with your details

Forgot password? Click here to reset