Sciweavers

7 search results - page 1 / 2
» Convex optimization techniques for fitting sparse Gaussian g...
Sort
View
ICML
2006
IEEE
14 years 4 months ago
Convex optimization techniques for fitting sparse Gaussian graphical models
We consider the problem of fitting a large-scale covariance matrix to multivariate Gaussian data in such a way that the inverse is sparse, thus providing model selection. Beginnin...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
ICML
2009
IEEE
14 years 4 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
CORR
2010
Springer
228views Education» more  CORR 2010»
13 years 2 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
ICASSP
2011
IEEE
12 years 7 months ago
Soft frame margin estimation of Gaussian Mixture Models for speaker recognition with sparse training data
—Discriminative Training (DT) methods for acoustic modeling, such as MMI, MCE, and SVM, have been proved effective in speaker recognition. In this paper we propose a DT method fo...
Yan Yin, Qi Li
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 3 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...