Which graphical models are difficult to learn?

Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference

Volumn , Issue , 2009, Pages 1303-1311

  Bento, José ^a   Montanari, Andrea ^a,b  

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES;

GRAPHICAL MODEL; LEARN+; LONG RANGE CORRELATIONS; LOW COMPLEXITY ALGORITHM; MARKOV RANDOM FIELDS; MODELING PHASIS; STRUCTURE OF ISING MODELS;

ISING MODEL;

EID: 84858782866     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. P. Abbeel, D. Koller and A. Ng, "Learning factor graphs in polynomial time and sample complexity". Journal of Machine Learning Research., 2006, Vol. 7, 1743-1788.
2. M. Wainwright, "Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting", arXiv:math/0702301v2 [math.ST], 2007.
3. N. Santhanam, M. Wainwright, "Information-theoretic limits of selecting binary graphical models in high dimensions", arXiv:0905.2639v1 [cs.IT], 2009.
4. G. Bresler, E. Mossel and A. Sly, "Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms", Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop RANDOM 2008, 2008, 343-356.
5. Csiszar and Z. Talata, "Consistent estimation of the basic neighborhood structure of Markov random fields", The Annals of Statistics, 2006, 34, Vol. 1, 123-145.
6. N. Friedman, I. Nachman, and D. Peer, "Learning Bayesian network structure from massive datasets: The sparse candidate algorithm". In UAI, 1999.
7. P. Ravikumar, M. Wainwright and J. Lafferty, "High-Dimensional Ising Model Selection Using l1-Regularized Logistic Regression", arXiv:0804.4202v1 [math.ST], 2008.
8. M. Wainwright, P. Ravikumar, and J. Lafferty, "Inferring graphical model structure using l1-regularized pseudolikelihood", In NIPS, 2006.
9. H. Höfling and R. Tibshirani, "Estimation of Sparse Binary Pairwise Markov Networks using Pseudo-likelihoods", Journal of Machine Learning Research, 2009, Vol. 10, 883-906.
10. O. Banerjee, L. El Ghaoui and A. d'Aspremont, "Model Selection Through Sparse Maximum Likelihood Estimation for Multivariate Gaussian or Binary Data", Journal of Machine Learning Research, March 2008, Vol. 9, 485-516.
11. M. Yuan and Y. Lin, "Model Selection and Estimation in Regression with Grouped Variables", J. Royal. Statist. Soc B, 2006, 68, Vol. 19, 49-67.
12. N. Meinshausen and P. Büuhlmann, "High dimensional graphs and variable selection with the lasso", Annals of Statistics, 2006, 34, Vol. 3.
13. R. Tibshirani, "Regression shrinkage and selection via the lasso", Journal of the Royal Statistical Society, Series B, 1994, Vol. 58, 267-288.
14. P. Zhao, B. Yu, "On model selection consistency of Lasso", Journal of Machine. Learning Research 7, 25412563, 2006.
15. D. Zobin, "Critical behavior of the bond-dilute two-dimensional Ising model", Phys. Rev., 1978, 5, Vol. 18, 2387 - 2390.
16. M. Fisher, "Critical Temperatures of Anisotropic Ising Lattices. II. General Upper Bounds", Phys. Rev. 162, Oct. 1967, Vol. 2, 480-485.
17. A. Dembo and A. Montanari, "Ising Models on Locally Tree Like Graphs", Ann. Appl. Prob. (2008), to appear, arXiv:0804.4726v2 [math.PR]