Name
Abstract | ||
|---|---|---|
We present a model for Bayesian filtering (BF) in discrete dynamic systems where multiple entities (inter)-act, i.e. where the system dynamics is naturally described by a Multiset rewriting system (MRS). Typically, BF in such situations is computationally expensive due to the high number of discrete states that need to be maintained explicitly.We devise a lifted state representation, based on a suitable decomposition of multiset states, such that some factors of the distribution are exchangeable and thus afford an efficient representation. Intuitively, this representation groups together similar entities whose properties follow an exchangeable joint distribution. Subsequently, we introduce a BF algorithm that works directly on lifted states, without resorting to the original, much larger ground representation.This algorithm directly lends itself to approximate versions by limiting the number of explicitly represented lifted states in the posterior. We show empirically that the lifted representation can lead to a factorial reduction in the representational complexity of the distribution, and in the approximate cases can lead to a lower variance of the estimate and a lower estimation error compared to the original, ground representation. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1613/jair.1.12066 | JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH |
DocType | Volume | Issue |
Journal | 69 | 1 |
ISSN | Citations | PageRank |
1076-9757 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefan Lüdtke | 1 | 3 | 5.15 |
| Thomas Kirste | 2 | 93 | 18.37 |