On Learning Continuous Pairwise Markov Random Fields

10/28/2020
by   Abhin Shah, et al.
19

We consider learning a sparse pairwise Markov Random Field (MRF) with continuous-valued variables from i.i.d samples. We adapt the algorithm of Vuffray et al. (2019) to this setting and provide finite-sample analysis revealing sample complexity scaling logarithmically with the number of variables, as in the discrete and Gaussian settings. Our approach is applicable to a large class of pairwise MRFs with continuous variables and also has desirable asymptotic properties, including consistency and normality under mild conditions. Further, we establish that the population version of the optimization criterion employed in Vuffray et al. (2019) can be interpreted as local maximum likelihood estimation (MLE). As part of our analysis, we introduce a robust variation of sparse linear regression a` la Lasso, which may be of interest in its own right.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2016

An ABC interpretation of the multiple auxiliary variable method

We show that the auxiliary variable method (Møller et al., 2006; Murray ...
research
09/12/2023

On Computationally Efficient Learning of Exponential Family Distributions

We consider the classical problem of learning, with arbitrary accuracy, ...
research
04/18/2018

Estimation of the extreme value index in a censorship framework: asymptotic and finite sample behaviour

We revisit the estimation of the extreme value index for randomly censor...
research
11/27/2019

Strong structure recovery for partially observed discrete Markov random fields on graphs

We propose a penalized maximum likelihood criterion to estimate the grap...
research
05/12/2020

Stochastic Learning for Sparse Discrete Markov Random Fields with Controlled Gradient Approximation Error

We study the L_1-regularized maximum likelihood estimator/estimation (ML...
research
09/09/2022

On the posterior contraction of the multivariate spike-and-slab LASSO

We study the asymptotic properties of the multivariate spike-and-slab LA...
research
10/08/2011

On the trade-off between complexity and correlation decay in structural learning algorithms

We consider the problem of learning the structure of Ising models (pairw...

Please sign up or login with your details

Forgot password? Click here to reset