More information about Ace

Papers

Algorithms used in Ace are described in the following papers (papers and bibtex entries can be downloaded here by clicking on "Publications").

Compiling Relational Bayesian Networks for Exact Inference. Mark Chavira, Adnan Darwiche, and Manfred Yaeger. International Journal of Approximate Reasoning (IJAR-2006).
Compiling Bayesian Networks with Local Structure. Mark Chavira and Adnan Darwiche. Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-2005).
Exploiting Evidence in Probabilistic Inference. Mark Chavira, David Allen, and Adnan Darwiche. Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI-2005).
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits. Jinbo Huang, Mark Chavira, and Adnan Darwiche. Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06).
Encoding CNFs to Empower Component Analysis. Mark Chavira and Adnan Darwiche. Proceedings of the Ninth International Conference on Theory and Applications of Satisfiability Testing (SAT-2006).
Probabilistic Inference by Weighted Model Counting. Mark Chavira and Adnan Darwiche. Currently under review.
Compiling Bayesian Networks Using Variable Elimination. Mark Chavira and Adnan Darwiche. Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-2007).

Benchmarks used in published results

Many benchmarks from published results are available from the download page and from the University of Washington. If you are interested in a specific benchmark that is not available from these two sources, send email to ace at cs dot ucla dot edu.

Options used in published results

Running Ace requires specifying certain options. These options have defaults and are described in readme.pdf, which is part of the distribution. We list below the options used for many of the experiments in the publications above. In each case, compilation was performed on a machine with 2GB of RAM. Note that both -dtHypergraph and -dtBnMinfill involve randomization and so may not produce the same results from one run to the next.

All networks from reference [1]:

Edit evaluate.bat to allocate 1200 megabytes of memory
Compile with: compile -noTabular -d02 -dtHypergraph 3 foo.net
Evaluate with: evaluate foo.net foo.inst

Munin1-4 from reference [2]:

Edit evaluate.bat to allocate 1200 megabytes of memory
Compile with: compile -noTabular -cd05 -dtClauseMinfill foo.net
Evaluate with: evaluate foo.net foo.inst

Other networks from reference [2]:

Edit evaluate.bat to allocate 1200 megabytes of memory
Compile with: compile -noTabular -cd05 -dtBnMinfill foo.net
Evalulate with: evaluate foo.net foo.inst

Networks from reference [7]:

Edit evaluate.bat to allocate 1200 megabytes of memory
Compile with: compile -noTabular -cd06 -dtBnMinfill foo.net
Evalulate with: evaluate foo.net foo.inst

Send questions and comments to ace at cs.ucla.edu.