Exam on 1026 Lei Tang and Will Cushing to proctor - PowerPoint PPT Presentation

About This Presentation
Title:

Exam on 1026 Lei Tang and Will Cushing to proctor

Description:

10/24. Exam on 10/26 (Lei Tang and Will Cushing to proctor) Overview of BN Inference Algorithms ... Avoids the redundant computations of Enumeration ... – PowerPoint PPT presentation

Number of Views:64
Avg rating:3.0/5.0
Slides: 36
Provided by: subbraoka
Category:
Tags: cushing | exam | lei | proctor | tang

less

Transcript and Presenter's Notes

Title: Exam on 1026 Lei Tang and Will Cushing to proctor


1
10/24
  • ?Exam on 10/26 (Lei Tang and Will Cushing to
    proctor)

2
Overview of BN Inference Algorithms
TONS OF APPROACHES
  • Exact Inference
  • Complexity
  • NP-hard (actually P-Complete since we count
    models)
  • Polynomial for Singly connected networks (one
    path between each pair of nodes)
  • Algorithms
  • Enumeration
  • Variable elimination
  • Avoids the redundant computations of Enumeration
  • Many others such as message passing
    algorithms, Constraint-propagation based
    algorithms etc.
  • Approximate Inference
  • Complexity
  • NP-Hard for both absolute and relative
    approximation
  • Algorithms
  • Based on Stochastic Simulation
  • Sampling from empty networks
  • Rejection sampling
  • Likelihood weighting
  • MCMC And many more

3
Examples of singly connected networks include
Markov Chains and Hidden Markov Models
4
(No Transcript)
5
(No Transcript)
6
(No Transcript)
7
(No Transcript)
8
fA(a,b,e)fj(a)fM(a) fA(a,b,e)fj(a)fM(a)
9
(No Transcript)
10
(No Transcript)
11
Variable Elimination and Irrelevant Variables
  • Suppose we asked the query P(JAt)
  • Which is probability that John calls given that
    Alarm went off
  • We know that this is a simple lookup into the CPT
    in our bayes net.
  • But, variable elimination algorithm is going to
    sum over the three other variables unnecessarily
  • In those cases, the factors will be degenerate
    (will sum to 1 see next slide)
  • This problem can be even more prominent if we had
    many other variables in the network
  • Qn How can we make variable elimination wake-up
    and avoid this unnecessary work?
  • General answer is to
  • (a) identify variables that are irrelevant given
    the query and evidence
  • In the P(JA), we should be able to see that
    e,b,m are irrelevant and remove them
  • (b) remove the irrelevant variables from the
    network
  • A variable v is irrelevant for a query P(XE) if
    X v E (i.e., X is conditionally independent
    of v given E).
  • We can use BayesBall or DSEP notions to figure
    out irrelevant variables v
  • But, Bayesball may miss some irrelevances??
  • There are a couple of easier sufficient
    conditions for irrelevance (both of which are
    special cases of BayesBall/DSep).

Slides may change
12
Irrelevance is a special case of Conditional
independence
Sufficient Condition 1
In general, any leaf node that is not a query
or evidence variable is irrelevant (and can
be removed) (once it is removed, others will be
seen to be irrelevant)
Can drop irrelevant variables from the network
before starting the query off..
Slides may change
13
Slides may change
Sufficient Condition 2
Note that condition 2 doesnt subsume condition
1. In particular, it wont allow us to say that
M is irrelevant for the query P(JB)
14
Notice that sampling methods could in general be
used even when we dont know the bayes net
(and are just observing the world)! ?We
should strive to make the sampling more efficient
given that we know the bayes net
15
(No Transcript)
16
(No Transcript)
17
(No Transcript)
18
(No Transcript)
19
(No Transcript)
20
(No Transcript)
21
(No Transcript)
22
(No Transcript)
23
(No Transcript)
24
That is, the rejection sampling method doesnt
really use the bayes network that much
25
(No Transcript)
26
Notice that to attach the likelihood to the
evidence, we are using the CPTs in the bayes
net. (Model-free empirical observation, in
contrast, either gives you a sample or not we
cant get fractional samples)
27
(No Transcript)
28
(No Transcript)
29
(No Transcript)
30
(No Transcript)
31
(No Transcript)
32
(No Transcript)
33
(No Transcript)
34
(No Transcript)
35
(No Transcript)
36
MCMC not covered on 10/24
37
(No Transcript)
38
(No Transcript)
39
Note that the other parents of zj are part of
the markov blanket
40
(No Transcript)
41
Case Study Pathfinder System
  • Domain Lymph node diseases
  • Deals with 60 diseases and 100 disease findings
  • Versions
  • Pathfinder I A rule-based system with logical
    reasoning
  • Pathfinder II Tried a variety of approaches for
    uncertainity
  • Simple bayes reasoning outperformed
  • Pathfinder III Simple bayes reasoning, but
    reassessed probabilities
  • Parthfinder IV Bayesian network was used to
    handle a variety of conditional dependencies.
  • Deciding vocabulary 8 hours
  • Devising the topology of the network 35 hours
  • Assessing the (14,000) probabilities 40 hours
  • Physician experts liked assessing causal
    probabilites
  • Evaluation 53 referral cases
  • Pathfinder III 7.9/10
  • Pathfinder IV 8.9/10 Saves one additional life
    in every 1000 cases!
  • A more recent comparison shows that Pathfinder
    now outperforms experts who helped design it!!
Write a Comment
User Comments (0)
About PowerShow.com