Improved Estimation of High-dimensional Ising Models

Convex analysis

T.R. Rockafellar · 1970

Earlier work this paper cites.

Geometry of Cuts and Metrics (Algorithms and Combinatorics)

M.M. Deza and M. Laurent · 1997

Earlier work this paper cites.

Nonlinear Programming

D. P. Bertsekas · 1999

Earlier work this paper cites.

Convergence of a block coordinate descent method for nondifferentiable minimization

P. Tseng · 2001

Earlier work this paper cites.

Graphical models, exponential families, and variational inference, 2003

M.J. Wainwright and M.I. Jordan · 2003

Earlier work this paper cites.

Model selection for Gaussian concentration graphs

M. Drton and M.D. Perlman · 2004

Earlier work this paper cites.

A new class of upper bounds on the log partition function

M.J. Wainwright, T.S. Jaakkola, and A.S. Willsky · 2005

Earlier work this paper cites.

Approximations with reweighted generalized belief propagation

W. Wiegerinck · 2005

Cited alongside, same era.

Constructing free-energy approximations and generalized belief propagation algorithms

J. S. Yedidia, W. T. Freeman, and Y. Weiss · 2005

Cited alongside, same era.

High-dimensional graphs and variable selection with the lasso

N. Meinshausen and P. Buhlmann · 2006

Cited alongside, same era.

High-dimensional graphical model selection using ℓ 1 \ell_{1} -regularized logistic regression

M. Wainwright, P. Ravikumar, and J. Lafferty · 2006

Cited alongside, same era.

Estimating the ”wrong” graphical model: Benefits in the computation-limited setting

M.J. Wainwright · 2006

Cited alongside, same era.

Log-determinant relaxation for approximate inference in discrete markov random fields

M.J. Wainwright and M.I. Jordan · 2006

Efficient structure learning of markov networks using l 1 l_{1} -regularization

S.-I. Lee, V. Ganapathi, and D. Koller · 2007

Later among the works it cites.

Model selection through sparse maximum likelihood estimation

O. Banerjee, L. El Ghaoui, and A. d’Aspremont · 2008

Closest in time.

Projected subgradient methods for learning sparse gaussians

J. Duchi, S. Gould, and D. Koller · 2008

Closest in time.

Efficient projections onto the l1-ball for learning in high dimensions

J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra · 2008

Closest in time.

Regularized paths for generalized linear models via coordinate descent

T. Hastie J. Friedman and R. Tibshirani · 2008

Closest in time.

Sparse permutation invariant covariance estimation, 2008

A. Rothman, P. Bickel, E. Levina, and J. Zhu · 2008

Closest in time.