Algorithms for Irrelevance-Based Partial MAPs

03/20/2013
by   Solomon Eyal Shimony, et al.
0

Irrelevance-based partial MAPs are useful constructs for domain-independent explanation using belief networks. We look at two definitions for such partial MAPs, and prove important properties that are useful in designing algorithms for computing them effectively. We make use of these properties in modifying our standard MAP best-first algorithm, so as to handle irrelevance-based partial MAPs.

READ FULL TEXT

page 1

page 5

page 8

research
03/06/2013

Relevant Explanations: Allowing Disjunctive Assignments

Relevance-based explanation is a scheme in which partial assignments to ...
research
02/17/2022

Bilimits in categories of partial maps

The closure of chains of embedding-projection pairs (ep-pairs) under bil...
research
09/15/2022

Computing mixed Schatten norm of completely positive maps

Computing p → q norm for matrices is a classical problem in computationa...
research
01/07/2023

GAN-Based Content Generation of Maps for Strategy Games

Maps are a very important component of strategy games, and a time-consum...
research
07/14/2020

Local Sufficiency for Partial Strategyproofness

In (Mennle and Seuken, 2017), we have introduced partial strategyproofne...
research
05/10/2021

Boomerang uniformity of a class of power maps

We consider the boomerang uniformity of an infinite class of power maps ...
research
03/02/2022

Partial Likelihood Thompson Sampling

We consider the problem of deciding how best to target and prioritize ex...

Please sign up or login with your details

Forgot password? Click here to reset