k-Optimal: A Novel Approximate Inference Algorithm for ProbLog
- 779 Downloads
ProbLog is a probabilistic extension of Prolog. Given the complexity of exact inference under ProbLog’s semantics, in many applications in machine learning approximate inference is necessary. Current approximate inference algorithms for ProbLog however require either dealing with large numbers of proofs or do not guarantee a low approximation error. In this paper we introduce a new approximate inference algorithm which addresses these shortcomings. Given a user-specified parameter k, this algorithm approximates the success probability of a query based on at most k proofs and ensures that the calculated probability p is (1 − 1/e)p * ≤ p ≤ p *, where p * is the highest probability that can be calculated based on any set of k proofs.
Unable to display preview. Download preview PDF.
- 1.Van den Broeck, G., Thon, I., van Otterlo, M., De Raedt, L.: DTProbLog: A Decision-Theoretic Probabilistic Prolog. AAAI (2010)Google Scholar
- 3.Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Management Science (1977)Google Scholar
- 6.De Raedt, L., Kimmig, A., Toivonen, H.: Problog: A probabilistic prolog and its application in link discovery. In: IJCAI, pp. 2462–2467 (2007)Google Scholar
- 7.De Raedt, L., Kimmig, A., Gutmann, B., Kersting, K., Santos Costa, V., Toivonen, H.: Probabilistic inductive querying using ProbLog. In: Inductive Databases and Constraint-Based Data Mining, pp. 229–262 (2010)Google Scholar