2 citations · 4 across the 11 of their papers we have counts for
3 papers · 1 filter
Inference and Sampling of -free Ising Models
Valerii Likhosherstov, Yury Maximov, Michael 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…
Gauges, Loops, and Polynomials for Partition Functions of Graphical Models
Michael Chertkov, Vladimir Chernyak, Yury Maximov
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main infer…
Entropy Penalized Semidefinite Programming
Mikhail Krechetov, Jakub Marecek, Yury Maximov +1
Low-rank methods for semidefinite programming (SDP) have gained a lot of interest recently, especially in machine learning applications. Their analysis often involves determinant-b…