4 citations · 6 across the 6 of their papers we have counts for
7 papers
Convergence of Some Convex Message Passing Algorithms to a Fixed Point
Vaclav Voracek, Tomas Werner
A popular approach to the MAP inference problem in graphical models is to minimize an upper bound obtained from a dual linear programming or Lagrangian relaxation by (block-)coordi…
Super-Reparametrizations of Weighted CSPs: Properties and Optimization Perspective
Tomáš Dlask, Tomáš Werner, Simon de Givry
The notion of reparametrizations of Weighted CSPs (WCSPs) (also known as equivalence-preserving transformations of WCSPs) is well-known and finds its use in many algorithms to appr…
A Class of Linear Programs Solvable by Coordinate-Wise Minimization
Tomáš Dlask, Tomáš Werner
Coordinate-wise minimization is a simple popular method for large-scale optimization. Unfortunately, for general (non-differentiable) convex problems it may not find global minima.…
Relative Interior Rule in Block-Coordinate Minimization
Tomáš Werner, Daniel Průša
(Block-)coordinate minimization is an iterative optimization method which in every iteration finds a global minimum of the objective over a variable or a subset of variables, while…
On Coordinate Minimization of Convex Piecewise-Affine Functions
Tomas Werner
A popular class of algorithms to optimize the dual LP relaxation of the discrete energy minimization problem (a.k.a.\ MAP inference in graphical models or valued constraint satisfa…
Primal View on Belief Propagation
Tomas Werner
It is known that fixed points of loopy belief propagation (BP) correspond to stationary points of the Bethe variational problem, where we minimize the Bethe free energy subject to…