Abstract
Markov Logic Networks (MLNs) define a probability distribution on relational structures over varying domain sizes. Like most relational models, MLNs do not admit consistent marginal inference over varying domain sizes i.e. marginal probabilities depend on the domain size. Furthermore, MLNs learned on a fixed domain do not generalize to domains of different sizes. In recent works, connections have emerged between domain size dependence, lifted inference, and learning from a sub-sampled domain. The central idea of these works is the notion of projectivity. The probability distributions ascribed by projective models render the marginal probabilities of sub-structures independent of the domain cardinality. Hence, projective models admit efficient marginal inference. Furthermore, projective models potentially allow efficient and consistent parameter learning from sub-sampled domains. In this paper, we characterize the necessary and sufficient conditions for a two-variable MLN to be projective. We then isolate a special class of models, namely Relational Block Models (RBMs). In terms of data likelihood, RBMs allow us to learn the best possible projective MLN in the two-variable fragment. Furthermore, RBMs also admit consistent parameter learning over sub-sampled domains.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beame, P., den Broeck, G.V., Gribkoff, E., Suciu, D.: Symmetric weighted first-order model counting. In: Milo, T., Calvanese, D. (eds.) Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, 31 May–4 June 2015, pp. 313–328. ACM (2015). https://doi.org/10.1145/2745754.2745760
Getoor, L., Taskar, B.: Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning). MIT Press, Cambridge (2007)
Handcock, M.S., Gile, K.J.: Modeling social networks from sampled data. Ann. Appl. Stat. 4(1), 5–25 (2010)
Jaeger, M., Schulte, O.: Inference, learning, and population size: projectivity for SRL models. CoRR abs/1807.00564 (2018). https://arxiv.org/abs/1807.00564
Jaeger, M., Schulte, O.: A complete characterization of projectivity for statistical relational models. In: Bessiere, C. (ed.) Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 4283–4290. ijcai.org (2020). https://doi.org/10.24963/ijcai.2020/591
Jain, D., Barthels, A., Beetz, M.: Adaptive Markov logic networks: learning statistical relational models with dynamic parameters. In: Coelho, H., Studer, R., Wooldridge, M.J. (eds.) ECAI 2010–19th European Conference on Artificial Intelligence, Lisbon, Portugal, 16–20 August 2010, Proceedings. Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 937–942. IOS Press (2010). https://doi.org/10.3233/978-1-60750-606-5-937
Kossinets, G.: Effects of missing data in social networks. Soc. Netw. 28(3), 247–268 (2006)
Kuusisto, A., Lutz, C.: Weighted model counting beyond two-variable logic. In: Dawar, A., Grädel, E. (eds.) Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, 09–12 July 2018, pp. 619–628. ACM (2018). https://doi.org/10.1145/3209108.3209168
Kuzelka, O., Kungurtsev, V., Wang, Y.: Lifted weight learning of Markov logic networks (revisited one more time). In: Jaeger, M., Nielsen, T.D. (eds.) International Conference on Probabilistic Graphical Models, PGM 2020, 23–25 September 2020, Aalborg, Hotel Comwell Rebild Bakker, Skørping, Denmark. Proceedings of Machine Learning Research, vol. 138, pp. 269–280. PMLR (2020). https://proceedings.mlr.press/v138/kuzelka20a.html
Malhotra, S., Serafini, L.: Weighted model counting in FO2 with cardinality constraints and counting quantifiers: a closed form formula. In: Proceedings of AAAI 2022 (2022). https://arxiv.org/abs/2110.05992
Mittal, H., Bhardwaj, A., Gogate, V., Singla, P.: Domain-size aware Markov logic networks. In: Chaudhuri, K., Sugiyama, M. (eds.) The 22nd International Conference on Artificial Intelligence and Statistics, AISTATS 2019, 16–18 April 2019, Naha, Okinawa, Japan. Proceedings of Machine Learning Research, vol. 89, pp. 3216–3224. PMLR (2019). https://proceedings.mlr.press/v89/mittal19a.html
Poole, D., Buchman, D., Kazemi, S.M., Kersting, K., Natarajan, S.: Population size extrapolation in relational probabilistic modelling. In: Straccia, U., Calì, A. (eds.) SUM 2014. LNCS (LNAI), vol. 8720, pp. 292–305. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11508-5_25
Raedt, L.D., Kersting, K., Natarajan, S., Poole, D.: Statistical Relational Artificial Intelligence: Logic, Probability, and Computation. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, San Rafael (2016). https://doi.org/10.2200/S00692ED1V01Y201601AIM032
Richardson, M., Domingos, P.: Markov logic networks. Mach. Learn. 62(1–2), 107–136 (2006)
Shalizi, C.R., Rinaldo, A.: Consistency under sampling of exponential random graph models. Ann. Stat. 41(2), 508–535 (2013)
Singla, P., Domingos, P.M.: Markov logic in infinite domains, pp. 368–375 (2007). https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1 &smnu=2 &article_id=1711 &proceeding_id=23
Snijders, T.A.B.: Conditional marginalization for exponential random graph models. J. Math. Sociol. 34(4), 239–252 (2010). https://doi.org/10.1080/0022250X.2010.485707
Srinivasavaradhan, S.R., Nikolopoulos, P., Fragouli, C., Diggavi, S.: Dynamic group testing to control and monitor disease progression in a population (2021)
Weitkämper, F.Q.: An asymptotic analysis of probabilistic logic programming, with implications for expressing projective families of distributions. Theory Pract. Log. Program. 21(6), 802–817 (2021)
Xiang, R., Neville, J.: Relational learning with one network: an asymptotic analysis. In: Gordon, G.J., Dunson, D.B., Dudík, M. (eds.) Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2011, Fort Lauderdale, USA, 11–13 April 2011. JMLR Proceedings, vol. 15, pp. 779–788. JMLR.org (2011). https://proceedings.mlr.press/v15/xiang11a/xiang11a.pdf
Acknowledgement
We would like to thank Manfred Jaeger and Felix Weitkämper for their valuable critique and discussion time on the topic.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
1 Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Malhotra, S., Serafini, L. (2023). On Projectivity in Markov Logic Networks. In: Amini, MR., Canu, S., Fischer, A., Guns, T., Kralj Novak, P., Tsoumakas, G. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2022. Lecture Notes in Computer Science(), vol 13717. Springer, Cham. https://doi.org/10.1007/978-3-031-26419-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-031-26419-1_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-26418-4
Online ISBN: 978-3-031-26419-1
eBook Packages: Computer ScienceComputer Science (R0)