PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Readings in model-based diagnosis
Readings in model-based diagnosis
Decision-theoretic troubleshooting
Communications of the ACM
Machine Learning - Special issue on learning with probabilistic representations
Sensitive Analysis for Threshold Decision Making with Bayesian Belief Networks
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Approximability and completeness in the polynomial hierarchy
Approximability and completeness in the polynomial hierarchy
Modeling and Reasoning with Bayesian Networks
Modeling and Reasoning with Bayesian Networks
Sensitivity Analysis of Probabilistic Graphical Models: Theoretical Results and Their Applications on Bayesian Network Modeling and Inference
Complexity results and approximation strategies for MAP explanations
Journal of Artificial Intelligence Research
Exploiting causal independence in Bayesian network inference
Journal of Artificial Intelligence Research
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
Optimal value of information in graphical models
Journal of Artificial Intelligence Research
Causality: Models, Reasoning and Inference
Causality: Models, Reasoning and Inference
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Causality in Bayesian belief networks
UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
Energy distribution view for monotonic dual decomposition
International Journal of Approximate Reasoning
An exact algorithm for computing the same-decision probability
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We consider in this paper the robustness of decisions based on probabilistic thresholds. To this effect, we propose the same-decision probability as a query that can be used as a confidence measure for threshold-based decisions. More specifically, the same-decision probability is the probability that we would have made the same threshold-based decision, had we known the state of some hidden variables pertaining to our decision. We study a number of properties about the same-decision probability. First, we analyze its computational complexity. We then derive a bound on its value, which we can compute using a variable elimination algorithm that we propose. Finally, we consider decisions based on noisy sensors in particular, showing through examples that the same-decision probability can be used to reason about threshold-based decisions in a more refined way.