Performing probabilistic inference in multi-target dynamic systems is a challenging task. When the system, its evidence and/or its targets evolve, most of the inference algorithms either recompute everything from scratch, even though incremental changes do not invalidate all the previous computations, or do not fully exploit incrementality to minimize computations. This incurs strong unnecessary overheads when the system under study is large. To alleviate this problem, we propose in this paper a new junction tree-based message-passing inference algorithm that, given a new query, minimizes computations by identifying precisely the set of messages that differ from the preceding computations. Experimental results highlight the efficiency of our approach.
IPMU16 http://hal.upmc.fr/hal-01345418 IPMU16, Jun 2016, Eindhoven, Netherlands. 2016, <10.1007/978-3-319-40596-4_28>ARRAY(0x7f5470477880) 2016-06-20