资源分类
》 资源 》论文》Anytime Marginal Maximum a Posteriori Inference

Anytime Marginal Maximum a Posteriori Inference

2020-02-28 | |  74 |   32 |   0

Abstract

This paper presents a new anytime algorithm for the marginal MAP problem in graphical models of bounded treewidth. We show asymptotic convergence and theoretical error bounds for any fixed step. Experiments show that it compares well to a state-of-the-art systematic search algorithm.

上一篇：Online Structured Prediction via Coactive Learning

下一篇：Estimating Sparse Precision Matrices from Data with Missing Values

用户评价
全部评价

热门资源

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