On the Partition Function and Random Maximum A-Posteriori Perturbations

06/27/2012
by   Tamir Hazan, et al.
0

In this paper we relate the partition function to the max-statistics of random variables. In particular, we provide a novel framework for approximating and bounding the partition function using MAP inference on randomly perturbed models. As a result, we can use efficient MAP solvers such as graph-cuts to evaluate the corresponding partition function. We show that our method excels in the typical "high signal - high coupling" regime that results in ragged energy landscapes difficult for alternative approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2016

High Dimensional Inference with Random Maximum A-Posteriori Perturbations

This paper presents a new approach, called perturb-max, for high-dimensi...
research
08/19/2022

Estimating a potential without the agony of the partition function

Estimating a Gibbs density function given a sample is an important probl...
research
12/24/2022

On the path partition of graphs

Let G be a graph of order n. The maximum and minimum degree of G are den...
research
09/11/2013

Approximate Counting CSP Solutions Using Partition Function

We propose a new approximate method for counting the number of the solut...
research
01/20/2019

Markov chains for the hard-core model via polymer models

Jenssen, Keevash and Perkins give an FPTAS and an efficient sampling alg...
research
03/10/2019

Rectangular Bounding Process

Stochastic partition models divide a multi-dimensional space into a numb...
research
06/13/2017

Lost Relatives of the Gumbel Trick

The Gumbel trick is a method to sample from a discrete probability distr...

Please sign up or login with your details

Forgot password? Click here to reset