# An Efficient Pseudo-likelihood Method for Sparse Binary Pairwise Markov Network Estimation

arXiv: https://arxiv.org/abs/1702.08320 · HTML: https://mlsanity.com/paper/1702.08320/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Feb 2017.

## Built on by (most cited first, 3 of 3)

- [A Data-Driven State Aggregation Approach for Dynamic Discrete Choice Models](https://mlsanity.com/paper/2304.04916/) (2023)
- [Deep PQR: Solving Inverse Reinforcement Learning using Anchor Actions](https://mlsanity.com/paper/2007.07443/) (2020)
- [SMILE: Evaluation and Domain Adaptation for Social Media Language Understanding](https://mlsanity.com/paper/2307.00135/) (2023)

## Abstract (arXiv)

The pseudo-likelihood method is one of the most popular algorithms for learning sparse binary pairwise Markov networks. In this paper, we formulate the L1 regularized pseudo-likelihood problem as a sparse multiple logistic regression problem. In this way, many insights and optimization procedures for sparse logistic regression can be applied to the learning of discrete Markov networks. Specifically, we use the coordinate descent algorithm for generalized linear models with convex penalties, combined with strong screening rules, to solve the pseudo-likelihood problem with L1 regularization. Therefore a substantial speedup without losing any accuracy can be achieved. Furthermore, this method is more stable than the node-wise logistic regression approach on unbalanced high-dimensional data when penalized by small regularization parameters. Thorough numerical experiments on simulated data and real world data demonstrate the advantages of the proposed method.