Graphical Laplace-approximated maximum likelihood estimation: approximated likelihood inference for network data analysis

07/13/2021
by   Chaonan Jiang, et al.
0

We derive Laplace-approximated maximum likelihood estimators (GLAMLEs) of parameters in our Graph Generalized Linear Latent Variable Models. Then, we study the statistical properties of GLAMLEs when the number of nodes n_V and the observed times of a graph denoted by K diverge to infinity. Finally, we display the estimation results in a Monte Carlo simulation considering different numbers of latent variables. Besides, we make a comparison between Laplace and variational approximations for inference of our model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/06/2019

A new inequality for maximum likelihood estimation in statistical models with latent variables

Maximum-likelihood estimation (MLE) is arguably the most important tool ...
research
07/20/2022

Enhanced Laplace Approximation

The Laplace approximation (LA) has been proposed as a method for approxi...
research
07/31/2020

Gibbsian T-tessellation model for agricultural landscape characterization

A new class of planar tessellations, named T-tessellations, was introduc...
research
08/12/2019

Maximum Approximated Likelihood Estimation

Empirical economic research frequently applies maximum likelihood estima...
research
10/22/2019

Reduced-dimensional Monte Carlo Maximum Likelihood for Latent Gaussian Random Field Models

Monte Carlo maximum likelihood (MCML) provides an elegant approach to fi...
research
02/22/2020

Amortised Learning by Wake-Sleep

Models that employ latent variables to capture structure in observed dat...
research
10/22/2019

Better Approximate Inference for Partial Likelihood Models with a Latent Structure

Temporal Point Processes (TPP) with partial likelihoods involving a late...

Please sign up or login with your details

Forgot password? Click here to reset