A conditional game for comparing approximations
published: May 6, 2011, recorded: April 2011, views: 4051
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
We present a "conditional game" to be played between two approximate inference algorithms. We prove that exact inference is an optimal strategy and demonstrate how the game can be used to estimate the relative accuracy of two different approximations in the absence of exact marginals.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !