Prioritized Asynchronous Belief Propagation

Invalid Date (modified: Apr 29, 2013) ICML 2013 Inferning submission readers: everyone
  • Decision: conferenceOral
  • Abstract: Message scheduling is shown to be very effective in belief propagation (BP) algorithms. However, most existing scheduling algorithms use fixed heuristics regardless of the structure of the graphs or properties of the distribution. On the other hand, designing different scheduling heuristics for all graph structures are not feasible. In this paper, we propose a reinforcement learning based message scheduling framework (RLBP) to learn the heuristics automatically which generalizes to any graph structures and distributions. In the experiments, we show that the learned problem-specific heuristics largely outperform other baselines in speed.
0 Replies