Approximating the Log-Partition Function
Graphical Models are used to represent structural information on a high-dimensional joint probability distribution. Their expressiveness offers simple reductions from a large number of NP-hard problems to inference tasks such as computing the partition function (exact inference) or approximating the...
Yazar: | Cosson, Romain |
---|---|
Diğer Yazarlar: | Shah, Devavrat |
Materyal Türü: | Tez |
Baskı/Yayın Bilgisi: |
Massachusetts Institute of Technology
2022
|
Online Erişim: | https://hdl.handle.net/1721.1/139223 |
Benzer Materyaller
-
Approximating the partition function of the ferromagnetic potts model
Yazar:: Goldberg, L, ve diğerleri
Baskı/Yayın Bilgisi: (2012) -
Approximation algorithms and inapproximability of partition functions of spin systems
Yazar:: Yang, K
Baskı/Yayın Bilgisi: (2019) -
The complexity of approximating complex-valued Ising and Tutte partition functions
Yazar:: Goldberg, L, ve diğerleri
Baskı/Yayın Bilgisi: (2017) -
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
Yazar:: Asadpour, Arash, ve diğerleri
Baskı/Yayın Bilgisi: (2011) -
Missing mass approximations for the partition function of stimulus driven Ising models
Yazar:: Galuske, Ralf, ve diğerleri
Baskı/Yayın Bilgisi: (2013)