101 citations · 355 across the 29 of their papers we have counts for
4 papers · 1 filter
Inference algorithms for pattern-based CRFs on sequence data
Rustem Takhanov, Vladimir Kolmogorov
We consider Conditional Random Fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) is the sum of terms over…
On the optimality of tree-reweighted max-product message-passing
Vladimir Kolmogorov, Martin Wainwright
Tree-reweighted max-product (TRW) message passing is a modified form of the ordinary max-product algorithm for attempting to find minimal energy configurations in Markov random fie…
The power of linear programming for valued CSPs: a constructive characterization
Vladimir Kolmogorov
A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the pr…
Generalized sequential tree-reweighted message passing
Vladimir Kolmogorov, Thomas Schoenemann
This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem…