Abstract
Markov Logic (ML) combines Markov networks (MNs) and first-order logic by attaching weights to first-order formulas and using these as templates for features of MNs. However, MAP and conditional inference in ML are hard computational tasks. This paper presents two algorithms for these tasks based on the Iterated Robust Tabu Search (IRoTS) metaheuristic. The first algorithm performs MAP inference by performing a biased sampling of the set of local optima. Extensive experiments show that it improves over the state-of-the-art algorithm in terms of solution quality and inference times. The second algorithm combines IRoTS with simulated annealing for conditional inference and we show through experiments that it is faster than the current state-of-the-art algorithm maintaining the same inference quality.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Damien, P., Wakefield, J., Walker, S.: Gibbs sampling for bayesian non-conjugate and hierarchical models by auxiliary variables. Journal of the Royal Statistical Society B 61, 2 (1999)
Della Pietra, S., Pietra, V.D., Laferty, J.: Inducing features of random fields. IEEE TPAMI 19, 380–392 (1997)
Getoor, L., Taskar, B.: Introduction to Statistical Relational Learning. MIT, Cambridge (2007)
Gilks, W.R., Richardson, S., Spiegelhalter, D.J.: Markov Chain Monte Carlo in Practice. Chapman and Hall, Boca Raton (1996)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Kok, S., Singla, P., Richardson, M., Domingos, P.: The alchemy system for statistical relational ai. Tech. rep., CSE-UW, Seattle, WA (2005)
Loureno, H.R., Martin, O., Stutzle, T.: Iterated local search. In: Handbook of Metaheuristics, pp. 321–353. Kluwer Academic Publishers, USA (2002)
Lowd, D., Domingos, P.: Efficient weight learning for markov logic networks. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 200–211. Springer, Heidelberg (2007)
Park, J.D.: Using weighted max-sat engines to solve mpe. In: AAAI, pp. 682–687 (2005)
Poon, H., Domingos, P.: Sound and efficient inference with probabilistic and deterministic dependencies. In: Proc. 21st AAAI, pp. 458–463 (2006)
Richardson, M., Domingos, P.: Markov logic networks. Machine Learning 62, 107–236 (2006)
Roth, D.: On the hardness of approximate reasoning. Artificial Intelligence 82, 273–302 (1996)
Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Cliques, Coloring, and Satisfiability: 2nd DIMACS, pp. 521–532 (1996)
Singla, P., Domingos, P.: Discriminative training of markov logic networks. In: Proc. 20th AAAI, pp. 868–873. AAAI Press, Menlo Park (2005)
Smyth, K., Hoos, H., Sttzle, T.: Iterated robust tabu search for max-sat. In: Canadian Conference on AI, pp. 129–144 (2003)
Taillard, E.D.: Robust taboo search for the quadratic assignment problem. Parallel Computing 17, 443–455 (1991)
Wei, W., Erenrich, J., Selman, B.: Towards efficient sampling: Exploiting random walk strategies. In: Proc. 19th Nat’l Conf. on AI ( AAAI) (2004)
Yagiura, M., Ibaraki, T.: Efficient 2 and 3-flip neighborhood search algorithms for the max sat:experimental evaluation. Journal of Heuristics 7(5), 423–442 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biba, M., Ferilli, S., Esposito, F. (2009). High Performing Algorithms for MAP and Conditional Inference in Markov Logic. In: Serra, R., Cucchiara, R. (eds) AI*IA 2009: Emergent Perspectives in Artificial Intelligence. AI*IA 2009. Lecture Notes in Computer Science(), vol 5883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10291-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-10291-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10290-5
Online ISBN: 978-3-642-10291-2
eBook Packages: Computer ScienceComputer Science (R0)