16 citations · 44 across the 36 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.LG2016★ 1 cited
Approximate maximum entropy principles via Goemans-Williamson with applications to provable variational methods
Yuanzhi Li, Andrej Risteski
The well known maximum-entropy principle due to Jaynes, which states that given mean parameters, the maximum entropy distribution matching them is in an exponential family, has bee…
cs.LG2016★ 4 cited
How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods
Andrej Risteski
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex prog…