Learning graphical models from the Glauber dynamics
暂无分享,去创建一个
[1] Pieter Abbeel,et al. Learning Factor Graphs in Polynomial Time and Sample Complexity , 2006, J. Mach. Learn. Res..
[2] Guy Bresler,et al. Efficiently Learning Ising Models on Arbitrary Graphs , 2014, STOC.
[3] Ali Jalali,et al. On Learning Discrete Graphical Models using Group-Sparse Regularization , 2011, AISTATS.
[4] Andrea Montanari,et al. Computational Implications of Reducing Data to Sufficient Statistics , 2014, ArXiv.
[5] Allan Sly,et al. The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[6] Vincent Y. F. Tan,et al. High-dimensional structure estimation in Ising models: Local separation criterion , 2011, 1107.1736.
[7] Dmitriy Katz,et al. Correlation decay and deterministic FPTAS for counting list-colorings of a graph , 2007, SODA '07.
[8] David Gamarnik,et al. Extension of the PAC framework to finite and countable Markov chains , 1999, COLT '99.
[9] A. Sokal,et al. Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem , 1996, cond-mat/9603068.
[10] Jure Leskovec,et al. On the Convexity of Latent Social Network Inference , 2010, NIPS.
[11] Alexandre B. Tsybakov,et al. Introduction to Nonparametric Estimation , 2008, Springer series in statistics.
[12] Devavrat Shah,et al. Rumors in a Network: Who's the Culprit? , 2009, IEEE Transactions on Information Theory.
[13] Devavrat Shah,et al. Structure learning of antiferromagnetic Ising models , 2014, NIPS.
[14] David Gamarnik,et al. Counting without sampling: Asymptotics of the log‐partition function for certain statistical physics models , 2008, Random Struct. Algorithms.
[15] Andrea Montanari,et al. Which graphical models are difficult to learn? , 2009, NIPS.
[16] Nathan Srebro,et al. Maximum likelihood bounded tree-width Markov networks , 2001, Artif. Intell..
[17] J. Lafferty,et al. High-dimensional Ising model selection using ℓ1-regularized logistic regression , 2010, 1010.0311.
[18] R. Dobrushin,et al. Constructive Criterion for the Uniqueness of Gibbs Field , 1985 .
[19] Christos Faloutsos,et al. Efficiently spotting the starting points of an epidemic in a large graph , 2013, Knowledge and Information Systems.
[20] David Gamarnik,et al. Correlation Decay in Random Decision Networks , 2009, Math. Oper. Res..
[21] Martin E. Dyer,et al. Mixing in time and space for lattice spin systems: A combinatorial view , 2002, RANDOM.
[22] D. Stroock,et al. The logarithmic sobolev inequality for discrete spin systems on a lattice , 1992 .
[23] R. Dobrushin. Prescribing a System of Random Variables by Conditional Distributions , 1970 .
[24] R. Srikant,et al. Learning loosely connected Markov random fields , 2012, 1204.5540.
[25] Daphne Koller,et al. Efficient Structure Learning of Markov Networks using L1-Regularization , 2006, NIPS.
[26] Martin J. Wainwright,et al. Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions , 2009, IEEE Transactions on Information Theory.
[27] Randall Berry,et al. Spotting trendsetters: Inference for network games , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[28] Fan Chung Graham,et al. Concentration Inequalities and Martingale Inequalities: A Survey , 2006, Internet Math..
[29] Avinatan Hassidim,et al. Topology discovery of sparse random graphs with few participants , 2011, SIGMETRICS '11.
[30] David Gamarnik. Correlation Decay Method for Decision, Optimization, and Inference in Large-Scale Networks , 2013 .
[31] Devavrat Shah,et al. Hardness of parameter estimation in graphical models , 2014, NIPS.
[32] Sanjoy Dasgupta,et al. Learning Polytrees , 1999, UAI.
[33] Dror Weitz,et al. Counting independent sets up to the tree threshold , 2006, STOC '06.
[34] Michael Chertkov,et al. Interaction Screening: Efficient and Sample-Optimal Learning of Ising Models , 2016, NIPS.
[35] Ali Jalali,et al. On Learning Discrete Graphical Models using Greedy Methods , 2011, NIPS.
[36] Andrea Montanari,et al. The spread of innovations in social networks , 2010, Proceedings of the National Academy of Sciences.
[37] Leslie G. Valiant,et al. Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..
[38] Sanjay Shakkottai,et al. Greedy learning of Markov network structure , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[39] F. Martinelli,et al. Approach to equilibrium of Glauber dynamics in the one phase region , 1994 .
[40] Bernhard Schölkopf,et al. Uncovering the Temporal Dynamics of Diffusion Networks , 2011, ICML.
[41] F. Martinelli,et al. Approach to equilibrium of Glauber dynamics in the one phase region , 1994 .
[42] Elchanan Mossel,et al. Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms , 2007, SIAM J. Comput..
[43] C. N. Liu,et al. Approximating discrete probability distributions with dependence trees , 1968, IEEE Trans. Inf. Theory.
[44] Peter L. Bartlett,et al. Exploiting random walks for learning , 1994, COLT '94.
[45] Ryan O'Donnell,et al. Learning DNF from random walks , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[46] Anima Anandkumar,et al. Learning Mixtures of Tree Graphical Models , 2012, NIPS.
[47] Umesh V. Vazirani,et al. A Markovian extension of Valiant's learning model , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[48] Sujay Sanghavi,et al. Learning the graph of epidemic cascades , 2012, SIGMETRICS '12.
[49] Imre Csiszár,et al. Consistent estimation of the basic neighborhood of Markov random fields , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[50] Sanjay Shakkottai,et al. Greedy learning of graphical models with small girth , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).