Inference and Sampling of $K_{33}$-free Ising Models

22 Dec 2018Valerii LikhosherstovYury MaximovMichael Chertkov

We call an Ising model tractable when it is possible to compute its partition function value (statistical inference) in polynomial time. The tractability also implies an ability to sample configurations of this model in polynomial time... (read more)

PDF Abstract

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.