ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
Weakly convex coupling continuous cuts and shape priors
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Optimization by ℓ1-constrained Markov fitness modelling
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Stable graphical model estimation with Random Forests for discrete, continuous, and mixed variables
Computational Statistics & Data Analysis
Hi-index | 0.00 |
We consider the problems of estimating the parameters as well as the structure of binary-valued Markov networks. For maximizing the penalized log-likelihood, we implement an approximate procedure based on the pseudo-likelihood of Besag (1975) and generalize it to a fast exact algorithm. The exact algorithm starts with the pseudo-likelihood solution and then adjusts the pseudo-likelihood criterion so that each additional iterations moves it closer to the exact solution. Our results show that this procedure is faster than the competing exact method proposed by Lee, Ganapathi, and Koller (2006a). However, we also find that the approximate pseudo-likelihood as well as the approaches of Wainwright et al. (2006), when implemented using the coordinate descent procedure of Friedman, Hastie, and Tibshirani (2008b), are much faster than the exact methods, and only slightly less accurate.