Abstract
Recently, Lifted Marginal Filtering has been proposed, an efficient Bayesian filtering algorithm for stochastic systems consisting of multiple, (inter-)acting agents and objects (entities). The algorithm achieves its efficiency by performing inference jointly over groups of similar entities (i.e. their properties follow the same distribution).
In this paper, we explore the case where there are no entities that are directly suitable for grouping, which is typical for many real-world scenarios. We devise a mechanism to identify entity groups, by formulating the distribution that is described by the grouped representation as a mixture distribution, such that the parameters can be fitted by Expectation Maximization. Specifically, in this paper, we investigate the Gaussian mixture case. Furthermore, we show how Gaussian mixture merging methods can be used to prevent the number of groups from growing indefinitely over time. We evaluate our approach on an activity prediction task in an online multiplayer game. The results suggest that compared to the conventional approach, where all entities are handled individually, decrease in prediction accuracy is small, while inference runtime decreases significantly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
References
Alspach, D., Sorenson, H.: Nonlinear Bayesian estimation using Gaussian sum approximations. IEEE Trans. Autom. Control 17(4), 439–448 (1972)
Barbuti, R., Levi, F., Milazzo, P., Scatena, G.: Maximally parallel probabilistic semantics for multiset rewriting. Fundamenta Informaticae 112(1), 1–17 (2011). https://doi.org/10.3233/FI-2011-575
Doucet, A., De Freitas, N., Murphy, K., Russell, S.: Rao-Blackwellised particle filtering for dynamic Bayesian networks. In: Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, pp. 176–183. Morgan Kaufmann Publishers Inc. (2000)
Fraley, C., Raftery, A.E.: Model-based clustering, discriminant analysis, and density estimation. J. Am. Stat. Assoc. 97(458), 611–631 (2002)
Gogate, V., Domingos, P.: Probabilistic theorem proving. Commun. ACM 59(7), 107–115 (2016). https://doi.org/10.1145/2936726
Krüger, F., Nyolt, M., Yordanova, K., Hein, A., Kirste, T.: Computational state space models for activity and intention recognition. A feasibility study. PLoS ONE 9(11), e109381 (2014). https://doi.org/10.1371/journal.pone.0109381
Lüdtke, S., Schröder, M., Bader, S., Kersting, K., Kirste, T.: Lifted filtering via exchangeable decomposition. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence (2018)
Lüdtke, S., Schröder, M., Kirste, T.: Approximate probabilistic parallel multiset rewriting using MCMC. In: Trollmann, F., Turhan, A.-Y. (eds.) KI 2018. LNCS (LNAI), vol. 11117, pp. 73–85. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00111-7_7
Molina, A., Vergari, A., Di Mauro, N., Natarajan, S., Esposito, F., Kersting, K.: Mixed sum-product networks: a deep architecture for hybrid domains. In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (2018)
Parry, H.R., Evans, A.J.: A comparative analysis of parallel processing and super-individual methods for improving the computational performance of a large individual-based model. Ecol. Model. 214(2–4), 141–152 (2008)
Ramírez, M., Geffner, H.: Goal recognition over POMDPs: inferring the intention of a POMDP agent. In: Proceedings of the 22nd IJCAI, pp. 2009–2014. AAAI Press (2011)
Runnalls, A.R.: Kullback-Leibler approach to Gaussian mixture reduction. IEEE Trans. Aerosp. Electron. Syst. 43(3), 989–999 (2007)
Scheffer, M., Baveco, J., DeAngelis, D., Rose, K., van Nes, E.: Super-individuals a simple solution for modelling large populations on an individual basis. Ecol. Model. 80(2–3), 161–170 (1995)
Scrucca, L., Fop, M., Murphy, T.B., Raftery, A.E.: mclust 5: clustering, classification and density estimation using Gaussian finite mixture models. R J. 8(1), 289 (2016)
Thon, I., Landwehr, N., De Raedt, L.: Stochastic relational processes: efficient inference and applications. Mach. Learn. 82(2), 239–272 (2011). https://doi.org/10.1007/s10994-010-5213-8
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Lüdtke, S., Molina, A., Kersting, K., Kirste, T. (2019). Gaussian Lifted Marginal Filtering. In: Benzmüller, C., Stuckenschmidt, H. (eds) KI 2019: Advances in Artificial Intelligence. KI 2019. Lecture Notes in Computer Science(), vol 11793. Springer, Cham. https://doi.org/10.1007/978-3-030-30179-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-30179-8_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30178-1
Online ISBN: 978-3-030-30179-8
eBook Packages: Computer ScienceComputer Science (R0)