Proceedings

Sampling Combinatorial Spaces Using Biased Random Walks

Download BibTeX Cite

Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1376-1379.

© 2003 International Joint Conferences on Artificial Intelligence

Abstract

For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can state-of-the-art search procedures for SAT be used to sample effectively from the space of all solutions? And, if so, how uniformly do they sample? Our initial results find that on the positive side, one can find all solutions to a given instance. Nevertheless, sampling can be highly biased. This research provides a starting point for the development of more balanced procedures.

  1. [Bayardo and Pehoushek, 2000] R.J. Bayardo and J.D. Pehoushek. Counting models using connected components. In Proc. AAA/-00. 1378 [McAIIesteret a/., 1997]
  2. D. McAIIester, B. Selman, and H. Kautz. Evidence for invariants in local search. In Proc. of AAAI-97, pp 321 - 326, 1997.
  3. [Roth, 1996] D. Roth, On the Hardness of Approximate Reason- ing, In Artificial intelligence Journal, Vol. 82, 1-2, pp 273-302, 1996. IJCAI
  4. [Selman et at., 1994] B. Selman, H. Kautz, and B. Cohen. Noise Strategies for Local Search. In Proc. AAAI-94, pp 337-343, 1994.

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

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