资源分类
》 资源 》论文》Linear and Parallel Learning of Markov Random Fields

Linear and Parallel Learning of Markov Random Fields

2020-03-03 | |  52 |   37 |   0

Abstract

We introduce a new embarrassingly parallel parameter learning algorithm for Markov random fields with untied parameters which is efficient for a large class of practical models. Our algorithm parallelizes naturally over cliques and, for graphs of bounded degree, its complexity is linear in the number of cliques. Unlike its competitors, our algorithm is fully parallel and for loglinear models it is also data efficient, requiring only the local sufficient statistics of the data to estimate parameters.

上一篇：Bayesian Optimization with Inequality Constraints

下一篇：Low-Density Parity Constraints for Hashing-Based Discrete Integration

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...