Proceedings

Speeding Up Inference in Markov Logic Networks by Preprocessing to Reduce the Size of the Resulting Grounded Network

Download BibTeX Cite

Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 1951-1955.

© 2009 International Joint Conferences on Artificial Intelligence

Abstract

Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in partially observable settings shared by other agents. Algorithms for solving I-DIDs face the challenge of an exponentially growing space of candidate models ascribed to other agents, over time. Previous approach for exactly solving I-DIDs groups together models having similar solutions into behaviorally equivalent classes and updates these classes. We present a new method that, in addition to aggregating behaviorally equivalent models, further groups models that prescribe identical actions at a single time step. We show how to update these augmented classes and prove that our method is exact. The new approach enables us to bound the aggregated model space by the cardinality of other agents' actions. We evaluate its performance and provide empirical results in support.Yifeng Zeng, Prashant Doshi

  1. [Bilenko and Mooney, 2003] M. Bilenko and R. Mooney. Adaptive duplicate detection using learnable string similarity measures. In KDD, 2003.
  2. [Braz et al., 2005] R. De Salvo Braz, E. Amir, and D. Roth. Lifted first-order probabilistic inference. In IJCAI, 2005. IJCAI
  3. [Chavira et al., 2004] M. Chavira, A. Darwiche, and M. Jaeger. Compiling Relational Bayesian networks for exact inference. In- ternational Journal of Approximate Reasoning, 42:49-56, 2004.
  4. [Domingos and Lowd, 2009] P. Domingos and D. Lowd. Markov Logic: An Interface Layer for AI. Morgan and Claypool, 2009.
  5. [Getoor and Taskar, 2007] L. Getoor and B. Taskar. Introduction to Statistical Relational Learning. MIT Press, 2007.
  6. [Lawrence et al., 1999] S. Lawrence, C. Giles, and K. Bollacker. Autonomous citation matching. In ICAA, 1999.
  7. [Milch and Russell, 2006] B. Milch and S. Russell. General- purpose MCMC inference over relational structures. In UAI, 2006.
  8. [Milch et al., 2008] B. Milch, L. Zettlemoyer, K. Kersting, M. Haimes, and L. Kaelbling. Lifted probabilistic inference with counting formulas. In AAAI, 2008.
  9. [Poon and Domingos, 2007] H. Poon and P. Domingos. Joint infer- ence in information extraction. In AAAI, 2007.
  10. [Poon et al., 2008] H. Poon, P. Domingos, and M.Sumner. A gen- eral method for reducing the complexity of relational inference and its application to MCMC. In AAAI, 2008.
  11. [Russell and Norvig, 2003] S. Russell and P. Norvig. Artificial In- telligence -A Modern Approach. Prentice Hall, 2003.
  12. [Sen et al., 2008] P. Sen, A. Deshpande, and L. Getoor. Exploiting shared correlations in probabilistic databases. In VLDB, 2008.
  13. [Singla and Domingos, 2008] P. Singla and P. Domingos. Lifted first-order belief propagation. In AAAI, 2008.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards