A randomized approximation algorithm for logic sampling
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|a randomized approximation algorithm for logic sampling }}
- [[]]
bibtex
{{#vardefine:pagename|A randomized approximation algorithm for logic sampling }}{{#vardefine:key| }}
abstract: In recent years, researchers in decision analysis and artificial intelligence (AI) have used Bayesian belief networks to build models of expert opinion. Using standard methods drawn from the theory of computational complexity, workers in the field have shown that the problem of exact probabilistic inference in belief networks almost certainly requires exponential computation in the worst case. We have previously proposed a randomized approximation scheme, called BN-RAS, for computation on belief networks. We gave precise analytic bounds on the convergence of BN-RAS and showed how to trade running time for accuracy in the evaluation of posterior marginal probabilities. We now extend our previous results and demonstrate the generality of our framework by applying similar mathematical techniques to the analysis of convergence for logic sampling, an alternative simulation algorithm for probabilistic inference.
download:
- paper:
- slides:
| Abstract | In recent years, researchers in decision a … In recent years, researchers in decision analysis and artificial intelligence (AI) have used Bayesian belief networks to build models of expert opinion. Using standard methods drawn from the theory of computational complexity, workers in the field have shown that the problem of exact probabilistic inference in belief networks almost certainly requires exponential computation in the worst case. We have previously proposed a randomized approximation scheme, called BN-RAS, for computation on belief networks. We gave precise analytic bounds on the convergence of BN-RAS and showed how to trade running time for accuracy in the evaluation of posterior marginal probabilities. We now extend our previous results and demonstrate the generality of our framework by applying similar mathematical techniques to the analysis of convergence for logic sampling, an alternative simulation algorithm for probabilistic inference. ion algorithm for probabilistic inference. |
| Address | Stanford, CA, USA + |
| Author | R. Martin Chavez +, and Gregory F. Cooper + |
| Bibtype | techreport + |
| Institution | Knowledge Systems, AI Laboratory + |
| Key | KSL-90-36 + |
| Month | May + |
| Number | KSL-90-36 + |
| Tag | Computer science + |
| Title | A Randomized Approximation Algorithm for Logic Sampling + |
| Tr id | KSL-90-36 + |
| Year | 1990 + |
