On Learning Discrete Graphical Models using Greedy Methods

作者: Ali Jalali , Pradeep K. Ravikumar , Christopher C. Johnson

DOI:

关键词:

摘要: … computationally tractable method that … greedy algorithm for general objectives is of independent interest even outside the context of graphical models. As we show, the greedy method is …

参考文章(30)
Clark N. Glymour, Peter Spirtes, Richard Scheines, Causation, prediction, and search ,(1993)
David Maxwell Chickering, Learning Bayesian Networks is NP-Complete Learning from Data. pp. 121- 130 ,(1996) , 10.1007/978-1-4612-2404-4_12
Guy Bresler, Elchanan Mossel, Allan Sly, Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms international workshop and international workshop on approximation randomization and combinatorial optimization algorithms and techniques. pp. 343- 356 ,(2008) , 10.1007/978-3-540-85363-3_28
Martin J Wainwright, Alekh Agarwal, Sahand Negahban, Fast global convergence rates of gradient methods for high-dimensional statistical recovery neural information processing systems. ,vol. 23, pp. 37- 45 ,(2010)
Scott Shaobing Chen, David L. Donoho, Michael A. Saunders, Atomic Decomposition by Basis Pursuit SIAM Journal on Scientific Computing. ,vol. 20, pp. 33- 61 ,(1998) , 10.1137/S1064827596304010
Nicolai Meinshausen, Peter Bühlmann, High-dimensional graphs and variable selection with the Lasso Annals of Statistics. ,vol. 34, pp. 1436- 1462 ,(2006) , 10.1214/009053606000000281
Jerome Friedman, Trevor Hastie, Robert Tibshirani, Additive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors) Annals of Statistics. ,vol. 28, pp. 337- 407 ,(2000) , 10.1214/AOS/1016218223
Emmanuel Candes, Terence Tao, None, The Dantzig selector: Statistical estimation when p is much larger than n Annals of Statistics. ,vol. 35, pp. 2313- 2351 ,(2007) , 10.1214/009053606000001523
Nathan Srebro, Maximum likelihood bounded tree-width Markov networks Artificial Intelligence. ,vol. 143, pp. 123- 138 ,(2003) , 10.1016/S0004-3702(02)00360-0