资源分类
》 资源 》论文》On the Partition Function and Random Maximum A-Posteriori Perturbations

On the Partition Function and Random Maximum A-Posteriori Perturbations

2020-02-28 | |  66 |   35 |   0

Abstract

In this paper we relate the partition function to the max-statistics of random variables. In particular, we provide a novel framework for approximating and bounding the partition function using MAP inference on randomly perturbed models. As a result, we can use efficient MAP solvers such as graph-cuts to evaluate the corresponding partition function. We show that our method excels in the typical “high signal high coupling” regime that results in ragged energy landscapes difficult for alternative approaches.

上一篇：Improved Estimation in Time Varying Models

下一篇：A Binary Classification Framework for Two-Stage Multiple Kernel Learning

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...