Discrete Optimization in Machine Learning

Mixing sum-product and max-product type updates to tighten tree-reweighted upper bounds for the log-partiton function

author: Tamir Hazan, School of Computer Science and Engineering, The Hebrew University of Jerusalem
published: Jan. 13, 2011, recorded: December 2010, views: 3934

Slides

Report a problem or upload files

If 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.

Lecture popularity: You need to login to cast your vote.