Accelerated Adaptive Markov Chain for Partition Function Computation
暂无分享,去创建一个
[1] Martin J. Wainwright,et al. A new class of upper bounds on the log partition function , 2002, IEEE Transactions on Information Theory.
[2] Matthew Richardson,et al. Markov logic networks , 2006, Machine Learning.
[3] D. Landau,et al. Efficient, multiple-range random walk algorithm to calculate the density of states. , 2000, Physical review letters.
[4] Bart Selman,et al. Computing the Density of States of Boolean Formulas , 2010, CP.
[5] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.
[6] William T. Freeman,et al. Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.
[7] Nicol N. Schraudolph,et al. Efficient Exact Inference in Planar Ising Models , 2008, NIPS.
[8] Mark Jerrum,et al. The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .
[9] Pedro M. Domingos,et al. Sound and Efficient Inference with Probabilistic and Deterministic Dependencies , 2006, AAAI.
[10] Vibhav Gogate,et al. SampleSearch: A Scheme that Searches for Consistent Samples , 2007, AISTATS.
[11] Michael I. Jordan,et al. Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..
[12] Jörg Hoffmann,et al. From Sampling to Model Counting , 2007, IJCAI.
[13] Vibhav Gogate,et al. Approximate Counting by Sampling the Backtrack-free Search Space , 2007, AAAI.