Perturb-and-max-product: Sampling and learning in discrete energy-based modelsDownload PDF

21 May 2021, 20:48 (edited 05 Nov 2021)NeurIPS 2021 PosterReaders: Everyone
  • Keywords: max-product, perturb-and-map, discrete graphical models, energy based models, belief revision, belief propagation
  • TL;DR: Perturb-and-MAP combined with max-product yields better performance than Gibbs sampling or LP-based MAP methods on discrete EBMs
  • Abstract: Perturb-and-MAP offers an elegant approach to approximately sample from a energy-based model (EBM) by computing the maximum-a-posteriori (MAP) configuration of a perturbed version of the model. Sampling in turn enables learning. However, this line of research has been hindered by the general intractability of the MAP computation. Very few works venture outside tractable models, and when they do, they use linear programming approaches, which as we will show, have several limitations. In this work we present perturb-and-max-product (PMP), a parallel and scalable mechanism for sampling and learning in discrete EBMs. Models can be arbitrary as long as they are built using tractable factors. We show that (a) for Ising models, PMP is orders of magnitude faster than Gibbs and Gibbs-with-Gradients (GWG) at learning and generating samples of similar or better quality; (b) PMP is able to learn and sample from RBMs; (c) in a large, entangled graphical model in which Gibbs and GWG fail to mix, PMP succeeds.
  • Supplementary Material: pdf
  • Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
  • Code: https://github.com/vicariousinc/perturb_and_max_product/
11 Replies

Loading