The MAP inference problem in many graphical models can be solved efficiently using a fast algorithm for computing min-sum products of n × n matrices. The class of models in question includes cyclic and skip-chain models that arise in many applications.
Minimisation of discrete energies defined over factors is an important problem in computer vision, a...
Belief propagation (BP) on cyclic graphs is an efficient algorithm for computing approximate margina...
We consider the energy minimization problem for undirected graphical models, also known as MAP-infer...
Inference, along with estimation and decoding, are the three key operations one must be able to perf...
Sum-product networks (SPNs) are a class of probabilistic graphical models that allow tractable margi...
Maximum A Posteriori inference in graphical models is often solved via message-passing algorithms, s...
Linear chains and trees are basic building blocks in many applications of graphical models. Although...
We study the marginal-MAP problem on graphical models, and present a novel approximation method base...
Message passing algorithms powered by the distributive law of mathematics are efficient in finding a...
We describe the Multiplicative Approximation Scheme (MAS) for approximate inference in multiplicativ...
We show that solving the LP relaxation of the MAP inference problem in graphical models (also known ...
Linear chains and trees are basic building blocks in many applications of graphi-cal models, and the...
We study the problem of approximate infer-ence in collective graphical models (CGMs), which were rec...
One way to approximate inference in richly-connected graphical models is to apply the sum-product al...
Markov Logic Networks (MLNs) use a few weighted first-order logic formulas to represent large probab...
Minimisation of discrete energies defined over factors is an important problem in computer vision, a...
Belief propagation (BP) on cyclic graphs is an efficient algorithm for computing approximate margina...
We consider the energy minimization problem for undirected graphical models, also known as MAP-infer...
Inference, along with estimation and decoding, are the three key operations one must be able to perf...
Sum-product networks (SPNs) are a class of probabilistic graphical models that allow tractable margi...
Maximum A Posteriori inference in graphical models is often solved via message-passing algorithms, s...
Linear chains and trees are basic building blocks in many applications of graphical models. Although...
We study the marginal-MAP problem on graphical models, and present a novel approximation method base...
Message passing algorithms powered by the distributive law of mathematics are efficient in finding a...
We describe the Multiplicative Approximation Scheme (MAS) for approximate inference in multiplicativ...
We show that solving the LP relaxation of the MAP inference problem in graphical models (also known ...
Linear chains and trees are basic building blocks in many applications of graphi-cal models, and the...
We study the problem of approximate infer-ence in collective graphical models (CGMs), which were rec...
One way to approximate inference in richly-connected graphical models is to apply the sum-product al...
Markov Logic Networks (MLNs) use a few weighted first-order logic formulas to represent large probab...
Minimisation of discrete energies defined over factors is an important problem in computer vision, a...
Belief propagation (BP) on cyclic graphs is an efficient algorithm for computing approximate margina...
We consider the energy minimization problem for undirected graphical models, also known as MAP-infer...
DOI
Add to ORKG