A self-adaptive hierarchical belief propagation algorithm
Ling Chi · Journal of the Graduate School of the Chinese Academy of Sciences · 2011
We propose a self-adaptive algorithm with convergence detection to reduce the computational complexity of HBP.In the conventional HBP,the computational complexity linearly increases with specified iteration upper bound.We introduce convergence detection to stop the iteration of messages which have already converged to optimal values.Experimental results show that the self-adaptive algorithm reduces computational time by 38% or more,and the computational time is insensitive to iteration upper bound.The convergence detection methodology can be used in other HBP-related applications.