How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods

Andrej Risteski. How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods. In Vitaly Feldman, Alexander Rakhlin, Ohad Shamir, editors, Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016. Volume 49 of JMLR Workshop and Conference Proceedings, pages 1402-1416, JMLR.org, 2016. [doi]

Abstract

Abstract is missing.