Distributed MAP Inference for Undirected Graphical Models

author: Sameer Singh, University of Massachusetts Amherst
published: Jan. 13, 2011,   recorded: December 2010,   views: 237
Categories
You might be experiencing some problems with Your Video player.

Slides

Slides
0:00 Distributed MAP Inference for Undirected Graphical Models
0:11 Motivation (1)
1:07 Motivation (2)
1:12 Motivation (3)
1:36 Outline, Model and Inference
1:39 Factor Graphs (1)
2:09 Factor Graphs (2)
2:40 Factor Graphs (3)
2:56 MAP1 Inference (1)
3:16 MAP1 Inference (2)
3:50 MCMC for MAP Inference (1)
4:40 MCMC for MAP Inference (2)
5:04 Mutually Exclusive Proposals (1)
5:48 Mutually Exclusive Proposals (2)
6:00 Distributed Inference (1)
6:25 Distributed Inference (2)
7:00 Distributed Inference (3)
7:20 Outline, Cross-Document Coreference
7:29 Coreference Problem (1)
7:31 Coreference Problem (2)
8:16 Coreference Problem (3)
8:25 Input Features
9:08 Graphical Model (1)
9:28 Graphical Model (2)
10:20 Graphical Model (3)
10:59 Graphical Model (4)
11:35 MCMC for MAP Inference
11:54 Mutually Exclusive Proposals (1)
12:16 Mutually Exclusive Proposals (2)
12:24 Mutually Exclusive Proposals (3)
12:47 Results - graph (1)
13:05 Results - graph (2)
13:20 Results - graph (3)
13:26 Results - graph (4)
13:31 Results - graph (5)
13:35 Outline, Hierarchical Models
13:44 Sub-Entities (1)
14:12 Sub-Entities (2)
14:35 Sub-Entities (3)
15:01 Super-Entities (1)
15:42 Super-Entities (2)
16:14 Hierarchical Representation (1)
17:03 Hierarchical Representation (2)
17:21 Evaluation (1)
17:33 Evaluation (2)
17:45 Evaluation (3)
17:54 Evaluation (4)
18:15 Outline, Large-Scale Experiments
18:24 Preliminary Large-Scale Experiments (1)
18:47 Preliminary Large-Scale Experiments (2)
19:09 Speed of Inference
19:36 Related Work (1)
20:02 Related Work (2)
20:24 Related Work (3)
20:45 Conclusions
21:07 Future Work
21:33 Thanks!

Related content

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.
 
    Delicious Bibliography

Description

In this work, we distribute the MCMC-based MAP inference using the Map-Reduce framework. The variables are assigned randomly to machines, which leads to some factors that neighbor vari- ables on separate machines. Parallel MCMC-chains are initiated using proposal distributions that only suggest local changes such that factors that lie across machines are not examined. After a fixed number of samples on each machine, we redistribute the variables amongst the machines to enable proposals across variables that were on different machines. To demonstrate the distribution strategy on a real-world information extraction application, we model the task of cross-document coreference.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: