Name
Abstract | ||
|---|---|---|
Traditional learning methods for training Markov random fields require doing inference over all variables to compute the likelihood gradient. The iteration complexity for those methods therefore scales with the size of the graphical models. In this paper, we propose block belief propagation learning (BBPL), which uses block-coordinate updates of approximate marginals to compute approximate gradients, removing the need to compute inference on the entire graphical model. Thus, the iteration complexity of BBPL does not scale with the size of the graphs. We prove that the method converges to the same solution as that obtained by using full inference per iteration, despite these approximations, and we empirically demonstrate its scalability improvements over standard training methods. |
Year | Venue | Field |
|---|---|---|
2018 | national conference on artificial intelligence | Graph,Mathematical optimization,Random field,Inference,Markov chain,Algorithm,Parameter learning,Graphical model,Mathematics,Belief propagation,Scalability |
DocType | Volume | Citations |
Journal | abs/1811.04064 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| You Lu | 1 | 19 | 5.52 |
| Zhiyuan Liu | 2 | 17 | 13.84 |
| Bert Huang | 3 | 563 | 39.09 |