Efficient Low Rank Convex Bounds for Pairwise Discrete Graphical ModelsDownload PDFOpen Website

Published: 01 Jan 2022, Last Modified: 06 Feb 2024ICML 2022Readers: Everyone
Abstract: In this paper, we extend a Burer-Monteiro style method to compute low rank Semi-Definite Programming (SDP) bounds for the MAP problem on discrete graphical models with an arbitrary number of states...
0 Replies

Loading