Sparse estimation in Ising Model via penalized Monte Carlo methods
arXiv:1612.07497
Abstract
We consider a problem of model selection in high-dimensional binary Markov random fields. The usefulness of the Ising model in studying systems of complex interactions has been confirmed in many papers. The main drawback of this model is the intractable norming constant that makes estimation of parameters very challenging. In the paper we propose a Lasso penalized version of the Monte Carlo maximum likelihood method. We prove that our algorithm, under mild regularity conditions, recognizes the true dependence structure of the graph with high probability. The efficiency of the proposed method is also investigated via simulation studies.
References in corpus (5)
- Simultaneous analysis of Lasso and Dantzig selector
- General state space Markov chains and MCMC algorithms
- High-dimensional Ising model selection using -regularized logistic regression
- Oracle inequalities for the lasso in the Cox model
- Combined l_1 and greedy l_0 penalized least squares for linear model selection