资源分类
》 资源 》论文》The Lazy Flipper: Efficient Depth-Limited Exhaustive Search in Discrete Graphical Models

The Lazy Flipper: Efficient Depth-Limited Exhaustive Search in Discrete Graphical Models

2020-04-02 | |  85 |   54 |   0

Abstract

We propose a new exhaustive search algorithm for optimiza- tion in discrete graphical models. When pursued to the full search depth (typically intractable), it is guaranteed to converge to a global optimum, passing through a series of monotonously improving local optima that are guaranteed to be optimal within a given and increasing Hamming distance. For a search depth of 1, it specializes to ICM. Between these extremes, a tradeoff between approximation quality and runtime is es- tablished. We show this experimentally by improving approximations for the non-submodular models in the MRF benchmark [1] and Decision Tree Fields [2].

上一篇：Self-similar Sketch

下一篇：Two-View Underwater Structure and Motion for Cameras under Flat Refractive Interfaces

用户评价
全部评价

热门资源

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