70 citations · 149 across the 6 of their papers we have counts for
6 papers · 1 filter
Join-Graph Propagation Algorithms
Robert Mateescu, Kalev Kask, Vibhav Gogate +1
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl's belief propagation algorithm (BP). We start…
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding
Irina Rish, Kalev Kask, Rina Dechter
It was recently shown that the problem of decoding messages transmitted through a noisy channel can be formulated as a belief updating task over a probabilistic network [McEliece].…
Mini-Bucket Heuristics for Improved Search
Kalev Kask, Rina Dechter
The paper is a second in a series of two papers evaluating the power of a new scheme that generates search heuristics mechanically. The heuristics are extracted from an approximati…
Iterative Join-Graph Propagation
Rina Dechter, Kalev Kask, Robert Mateescu
The paper presents an iterative version of join-tree clustering that applies the message passing of join-tree clustering algorithm to join-graphs rather than to join-trees, iterati…
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
Radu Marinescu, Kalev Kask, Rina Dechter
The paper continues the study of partitioning based inference of heuristics for search in the context of solving the Most Probable Explanation task in Bayesian Networks. We compare…
BEEM : Bucket Elimination with External Memory
Kalev Kask, Rina Dechter, Andrew E. Gelfand
A major limitation of exact inference algorithms for probabilistic graphical models is their extensive memory usage, which often puts real-world problems out of their reach. In thi…