Probabilities of the Third Type: Statistical Relational Learning and Reasoning with Relative Frequencies (2202.10367v4)
Abstract: Dependencies on the relative frequency of a state in the domain are common when modelling probabilistic dependencies on relational data. For instance, the likelihood of a school closure during an epidemic might depend on the proportion of infected pupils exceeding a threshold. Often, rather than depending on discrete thresholds, dependencies are continuous: for instance, the likelihood of any one mosquito bite transmitting an illness depends on the proportion of carrier mosquitoes. Current approaches usually only consider probabilities over possible worlds rather than over domain elements themselves. An exception are the recently introduced lifted Bayesian networks for conditional probability logic, which express discrete dependencies on probabilistic data. We introduce functional lifted Bayesian networks, a formalism that explicitly incorporates continuous dependencies on relative frequencies into statistical relational artificial intelligence, and compare and contrast them with lifted Bayesian networks for conditional probability logic. Incorporating relative frequencies is not only beneficial to modelling; it also provides a more rigorous approach to learning problems where training and test or application domains have different sizes. To this end, we provide a representation of the asymptotic probability distributions induced by functional lifted Bayesian networks on domains of increasing sizes. Since that representation has well-understood scaling behaviour across domain sizes, it can be used to estimate parameters for a large domain consistently from randomly sampled subpopulations. Furthermore, we show that in parametric families of FLBN, convergence is uniform in the parameters, which ensures a meaningful dependence of the asymptotic probabilities on the parameters of the model.
- Structure learning of probabilistic logic programs by searching the clause space. Theory Pract. Log. Program., 15(2), 169–212.
- Indemics: An interactive high-performance computing framework for data-intensive epidemic modeling. ACM Trans. Model. Comput. Simul., 24(1), 4:1–4:32.
- Carnap, R. (1950). Logical Foundations of Probability. University of Chicago Press.
- Compiling relational bayesian networks for exact inference. International Journal of Approximate Reasoning, 42(1), 4–20. PGM’04.
- The dichotomy of probabilistic inference for unions of conjunctive queries. J. ACM, 59(6), 30:1–30:87.
- Deitmar, A. (2021). Analysis. Springer.
- User manual of Tuffy 0.3. Stanford University.
- Mathematical logic (2. ed.). Undergraduate texts in mathematics. Springer.
- Halpern, J. Y. (1990). An analysis of first-order logics of probability. Artif. Intell., 46(3), 311–350.
- Jaeger, M. (1997). Relational Bayesian networks. In Geiger, D., and Shenoy, P. P. (Eds.), UAI ’97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, Brown University, Providence, Rhode Island, USA, August 1-3, 1997, pp. 266–273. Morgan Kaufmann.
- Jaeger, M. (1998). Convergence results for relational Bayesian networks. In Thirteenth Annual IEEE Symposium on Logic in Computer Science, Indianapolis, Indiana, USA, June 21-24, 1998, pp. 44–55. IEEE Computer Society.
- Jaeger, M. (2002). Relational Bayesian networks: A survey. Electron. Trans. Artif. Intell., 6, 1–21.
- Jaeger, M. (2006). Importance Sampling on Relational Bayesian Networks. In Raedt, L. D., Dietterich, T., Getoor, L., and Muggleton, S. H. (Eds.), Probabilistic, Logical and Relational Learning - Towards a Synthesis, Vol. 5051 of Dagstuhl Seminar Proceedings (DagSemProc), pp. 1–16, Dagstuhl, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
- Jaeger, M. (2007). Parameter learning for relational Bayesian networks. In Ghahramani, Z. (Ed.), Machine Learning, Proceedings of the Twenty-Fourth International Conference (ICML 2007), Corvallis, Oregon, USA, June 20-24, 2007, Vol. 227 of ACM International Conference Proceeding Series, pp. 369–376. ACM.
- Inference, learning, and population size: Projectivity for SRL models. In Eighth International Workshop on Statistical Relational AI (StarAI).
- 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.
- Relational logistic regression. In Baral, C., Giacomo, G. D., and Eiter, T. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014. AAAI Press.
- Keisler, H. J. (1985). Probability quantifiers. In Model-theoretic logics, Perspect. Math. Logic, pp. 509–556. Springer, New York.
- Almost everywhere elimination of probability quantifiers. J. Symb. Log., 74(4), 1121–1142.
- Novel semantical approaches to relational probabilistic conditionals. In Lin, F., Sattler, U., and Truszczynski, M. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010. AAAI Press.
- Infinitary logics and 0–1 laws. Information and Computation, 98(2), 258–294.
- Koponen, V. (2020). Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination. Theor. Comput. Sci., 848, 1–27.
- Lifted probabilistic inference with counting formulas. In Fox, D., and Gomes, C. P. (Eds.), Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008, pp. 1062–1068. AAAI Press.
- A behavioral comparison of some probabilistic logic models. In Raedt, L. D., Frasconi, P., Kersting, K., and Muggleton, S. (Eds.), Probabilistic Inductive Logic Programming - Theory and Applications, Vol. 4911 of Lecture Notes in Computer Science, pp. 305–324. Springer.
- Generalized linear models. Journal of the Royal Statistical Society Series A: Statistics in Society, 135(3), 370–384.
- Poole, D. (1993). Probabilistic horn abduction and bayesian networks. Artificial Intelligence, 64(1), 81–129.
- Population size extrapolation in relational probabilistic modelling. In Straccia, U., and Calì, A. (Eds.), Scalable Uncertainty Management - 8th International Conference, SUM 2014, Oxford, UK, September 15-17, 2014. Proceedings, Vol. 8720 of Lecture Notes in Computer Science, pp. 292–305. Springer.
- Raedt, L. D. (2008). Logical and relational learning. Cognitive Technologies. Springer.
- Structure learning for relational logistic regression: An ensemble approach. In Thielscher, M., Toni, F., and Wolter, F. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October - 2 November 2018, pp. 661–662. AAAI Press.
- Markov logic networks. Mach. Learn., 62(1-2), 107–136.
- Riguzzi, F. Foundations of Probabilistic Logic Programming.
- A survey of probabilistic logic programming. In Kifer, M., and Liu, Y. A. (Eds.), Declarative Logic Programming: Theory, Systems, and Applications, pp. 185–228. ACM / Morgan & Claypool.
- Sato, T. (1995). A statistical learning method for logic programs with distribution semantics. In Sterling, L. (Ed.), Logic Programming, Proceedings of the Twelfth International Conference on Logic Programming, Tokyo, Japan, June 13-16, 1995, pp. 715–729. MIT Press.
- Schulte, O. (2012). Challenge Paper: Marginal Probabilities for Instances and Classes. Presented at the ICML-SRL Workshop on Statistical Relational Learning.
- Modelling relational statistics with bayes nets. Mach. Learn., 94(1), 105–125.
- Zero-one laws for sparse random graphs. Journal of the American Mathematical Society, 1(1), 97–115.
- Spencer, J. (2001). The strange logic of random graphs, Vol. 22 of Algorithms and Combinatorics. Springer-Verlag, Berlin.
- Weitkämper, F. (2021a). An asymptotic analysis of probabilistic logic programming, with implications for expressing projective families of distributions. Theory Pract. Log. Program., 21(6), 802–817.
- Weitkämper, F. (2021b). Scaling the weight parameters in markov logic networks and relational logistic regression models. CoRR, abs/2103.15140.
- Felix Weitkämper (14 papers)