Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS 416 Artificial Intelligence Lecture 14 Uncertainty Chapters 13 and 14 Lecture 14 Uncertainty Chapters 13 and 14.

Similar presentations


Presentation on theme: "CS 416 Artificial Intelligence Lecture 14 Uncertainty Chapters 13 and 14 Lecture 14 Uncertainty Chapters 13 and 14."— Presentation transcript:

1 CS 416 Artificial Intelligence Lecture 14 Uncertainty Chapters 13 and 14 Lecture 14 Uncertainty Chapters 13 and 14

2 TA Office Hours Chris cannot attend today’s office hours He will be available Wed, 3:30 – 4:30 Chris cannot attend today’s office hours He will be available Wed, 3:30 – 4:30

3 Conditional probability The probability of a given all we know is b P (a | b)P (a | b) Written as an unconditional probability The probability of a given all we know is b P (a | b)P (a | b) Written as an unconditional probability

4 Conditioning A distribution over Y can be obtained by summing out all the other variables from any joint distribution containing Y P(Y) = SUM P(Y|z) P(z) A distribution over Y can be obtained by summing out all the other variables from any joint distribution containing Y P(Y) = SUM P(Y|z) P(z)

5 Independence Independence of variables in a domain can dramatically reduce the amount of information necessary to specify the full joint distribution

6 Bayes’ Rule

7 Conditional independence In general, when a single cause influences multiple effects, all of which are conditionally independent (given the cause) 2 n+1 2*n*(2 2 ) = 8n Assuming binary variables

8 Wumpus Are there pits in (1,3) (2,2) (3,1) given breezes in (1,2) and (2,1)? One way to solve… Find the full joint distributionFind the full joint distribution –P (P 1,1, …, P 4,4, B 1,1, B 1,2, B 2,1 ) Are there pits in (1,3) (2,2) (3,1) given breezes in (1,2) and (2,1)? One way to solve… Find the full joint distributionFind the full joint distribution –P (P 1,1, …, P 4,4, B 1,1, B 1,2, B 2,1 )

9 Find the full joint distribution Remember the product ruleRemember the product rule P (P 1,1, …, P 4,4, B 1,1, B 1,2, B 2,1 )P (P 1,1, …, P 4,4, B 1,1, B 1,2, B 2,1 ) P(B 1,1, B 1,2, B 2,1 | P 1,1, …, P 4,4 ) P(P 1,1, …, P 4,4 )P(B 1,1, B 1,2, B 2,1 | P 1,1, …, P 4,4 ) P(P 1,1, …, P 4,4 ) –Solve this for all P and B values Remember the product ruleRemember the product rule P (P 1,1, …, P 4,4, B 1,1, B 1,2, B 2,1 )P (P 1,1, …, P 4,4, B 1,1, B 1,2, B 2,1 ) P(B 1,1, B 1,2, B 2,1 | P 1,1, …, P 4,4 ) P(P 1,1, …, P 4,4 )P(B 1,1, B 1,2, B 2,1 | P 1,1, …, P 4,4 ) P(P 1,1, …, P 4,4 ) –Solve this for all P and B values

10 Find the full joint distribution P(B 1,1, B 1,2, B 2,1 | P 1,1, …, P 4,4 ) P(P 1,1, …, P 4,4 )P(B 1,1, B 1,2, B 2,1 | P 1,1, …, P 4,4 ) P(P 1,1, …, P 4,4 ) –Givens:  the rules relating breezes to pits  each square contains a pit with probability = 0.2 –For any given P 1,1, …, P 4,4 setting with n pits  The rules of breezes tells us the value of P (B | P)  0.2 n * 0.8 (16-n) tells us the value of P(P) P(B 1,1, B 1,2, B 2,1 | P 1,1, …, P 4,4 ) P(P 1,1, …, P 4,4 )P(B 1,1, B 1,2, B 2,1 | P 1,1, …, P 4,4 ) P(P 1,1, …, P 4,4 ) –Givens:  the rules relating breezes to pits  each square contains a pit with probability = 0.2 –For any given P 1,1, …, P 4,4 setting with n pits  The rules of breezes tells us the value of P (B | P)  0.2 n * 0.8 (16-n) tells us the value of P(P)

11 Solving an instance We have the following facts: Query: P (P 1,3 | known, b) We have the following facts: Query: P (P 1,3 | known, b) P?

12 Solving an instance Query: P (P 1,3 | known, b)

13 Solving: P (P 1,3 | known, b) We know the full joint probability so we can solve thisWe know the full joint probability so we can solve this –2 12 = 4096 terms must be summed We know the full joint probability so we can solve thisWe know the full joint probability so we can solve this –2 12 = 4096 terms must be summed P?

14 Solving an instance more quickly Independence The contents of [4,4] don’t affect the presence of a pit at [1,3]The contents of [4,4] don’t affect the presence of a pit at [1,3] Create Fringe and OtherCreate Fringe and Other –Fringe = Pitness of cells on fringe –Other = Pitness of cells in other –Breezes are conditionally independent of the Other variables Independence The contents of [4,4] don’t affect the presence of a pit at [1,3]The contents of [4,4] don’t affect the presence of a pit at [1,3] Create Fringe and OtherCreate Fringe and Other –Fringe = Pitness of cells on fringe –Other = Pitness of cells in other –Breezes are conditionally independent of the Other variables Fringe Other Query

15 Independence (by Bayes and summing out) (by independence of fringe and other)

16 Independence (relocate summation) (by independence) (relocate summation) (new alpha & sum  1)

17 Independence 4096 terms dropped to 4 Fringe has two cells, four possible pitness combinationsFringe has two cells, four possible pitness combinations 4096 terms dropped to 4 Fringe has two cells, four possible pitness combinationsFringe has two cells, four possible pitness combinations

18 Chapter 14 Probabilistic Reasoning First, Bayesian NetworksFirst, Bayesian Networks Then, InferenceThen, Inference Probabilistic Reasoning First, Bayesian NetworksFirst, Bayesian Networks Then, InferenceThen, Inference

19 Bayesian Networks Difficult to build a probability table with a large amount of data Independence and conditional independence seek to reduce complications (time) of building full joint distributionIndependence and conditional independence seek to reduce complications (time) of building full joint distribution Bayesian Network captures these dependencies Difficult to build a probability table with a large amount of data Independence and conditional independence seek to reduce complications (time) of building full joint distributionIndependence and conditional independence seek to reduce complications (time) of building full joint distribution Bayesian Network captures these dependencies

20 Bayesian Network Directed Acyclic Graph (DAG) Random variables are the nodesRandom variables are the nodes Arcs indicate conditional independence relationshipsArcs indicate conditional independence relationships Each node labeled with P(X i | Parents (X i ))Each node labeled with P(X i | Parents (X i )) Directed Acyclic Graph (DAG) Random variables are the nodesRandom variables are the nodes Arcs indicate conditional independence relationshipsArcs indicate conditional independence relationships Each node labeled with P(X i | Parents (X i ))Each node labeled with P(X i | Parents (X i ))

21 Another example Burglar Alarm Goes off when intruder (usually)Goes off when intruder (usually) Goes off during earthquake (sometimes)Goes off during earthquake (sometimes) Neighbor John calls when he hears the alarm, but he also calls when he confuses the phone for the alarmNeighbor John calls when he hears the alarm, but he also calls when he confuses the phone for the alarm Neighbor Mary calls when she hears the alarm, but she doesn’t hear it when listening to musicNeighbor Mary calls when she hears the alarm, but she doesn’t hear it when listening to music Burglar Alarm Goes off when intruder (usually)Goes off when intruder (usually) Goes off during earthquake (sometimes)Goes off during earthquake (sometimes) Neighbor John calls when he hears the alarm, but he also calls when he confuses the phone for the alarmNeighbor John calls when he hears the alarm, but he also calls when he confuses the phone for the alarm Neighbor Mary calls when she hears the alarm, but she doesn’t hear it when listening to musicNeighbor Mary calls when she hears the alarm, but she doesn’t hear it when listening to music

22 Another example Burglar Alarm Note the absence of Information about John and Mary’s errors. Note the presence of Conditional Probability Tables (CPTs)

23 Full joint distribution The Bayesian Network describes the full joint distribution P(X 1 = x 1 ^ X 2 = x 2 ^ … ^ X n = x n ) abbreviated as… P (x 1, x 2, …, x n ) = The Bayesian Network describes the full joint distribution P(X 1 = x 1 ^ X 2 = x 2 ^ … ^ X n = x n ) abbreviated as… P (x 1, x 2, …, x n ) = CPT

24 Burglar alarm example P (John calls, Mary calls, alarm goes off, no burglar or earthquake)

25 Constructing a Bayesian Network Top-down is more likely to workTop-down is more likely to work Causal rules are betterCausal rules are better Adding arcs is a judgment callAdding arcs is a judgment call –Consider decision not to add error info about John/Mary  No reference to telephones or music playing in network Top-down is more likely to workTop-down is more likely to work Causal rules are betterCausal rules are better Adding arcs is a judgment callAdding arcs is a judgment call –Consider decision not to add error info about John/Mary  No reference to telephones or music playing in network

26 Conditional distributions It can be time consuming to fill up all the CPTs of discrete random variables Sometimes standard templates can be usedSometimes standard templates can be used –The canonical 20% of the work solves 80% of the problem  Thanks Pareto and Juran Sometimes simple logic summarizes a tableSometimes simple logic summarizes a table –A V B V C => D It can be time consuming to fill up all the CPTs of discrete random variables Sometimes standard templates can be usedSometimes standard templates can be used –The canonical 20% of the work solves 80% of the problem  Thanks Pareto and Juran Sometimes simple logic summarizes a tableSometimes simple logic summarizes a table –A V B V C => D

27 Conditional distributions Continuous random variables DiscretizationDiscretization –Subdivide continuous region into a fixed set of intervals  Where do you put the regions? Standard Probability Density Functions (PDFs)Standard Probability Density Functions (PDFs) –P(X) = Gaussian, where only mean and variance need to be specified Continuous random variables DiscretizationDiscretization –Subdivide continuous region into a fixed set of intervals  Where do you put the regions? Standard Probability Density Functions (PDFs)Standard Probability Density Functions (PDFs) –P(X) = Gaussian, where only mean and variance need to be specified

28 Conditional distributions Mixing discrete and continuous Example: Probability I buy fruit is a function of its costProbability I buy fruit is a function of its cost Its cost is a function of the harvest quality and the presence of government subsidiesIts cost is a function of the harvest quality and the presence of government subsidies How do we mix the items? Mixing discrete and continuous Example: Probability I buy fruit is a function of its costProbability I buy fruit is a function of its cost Its cost is a function of the harvest quality and the presence of government subsidiesIts cost is a function of the harvest quality and the presence of government subsidies How do we mix the items? Continuous Discrete

29 Hybrid Bayesians P(Cost | Harvest, Subsidy) P (Cost | Harvest, subsidy)P (Cost | Harvest, subsidy) P (Cost | Harvest, ~subsidy)P (Cost | Harvest, ~subsidy) P(Cost | Harvest, Subsidy) P (Cost | Harvest, subsidy)P (Cost | Harvest, subsidy) P (Cost | Harvest, ~subsidy)P (Cost | Harvest, ~subsidy) Enumerate the discrete choices

30 Hybrid Bayesians How does Cost change as a function of Harvest? Linear GaussianLinear Gaussian –Cost is a Gaussian distribution with mean that varies linearly with the value of the parent and standard deviation is constant How does Cost change as a function of Harvest? Linear GaussianLinear Gaussian –Cost is a Gaussian distribution with mean that varies linearly with the value of the parent and standard deviation is constant Need two of these… One for each subsidy

31

32 Multivariate Gaussian A network of continuous variables with linear Gaussian distributions has a joint distribution that is a multivariate Gaussian distribution over all the variables A surface in n-dimensional space where there is a peak at the point with coordinates constructed from each dimension’s meansA surface in n-dimensional space where there is a peak at the point with coordinates constructed from each dimension’s means It drops off in all directions from the meanIt drops off in all directions from the mean A network of continuous variables with linear Gaussian distributions has a joint distribution that is a multivariate Gaussian distribution over all the variables A surface in n-dimensional space where there is a peak at the point with coordinates constructed from each dimension’s meansA surface in n-dimensional space where there is a peak at the point with coordinates constructed from each dimension’s means It drops off in all directions from the meanIt drops off in all directions from the mean

33 Conditional Gaussian Adding discrete variables to a multivariate Gaussian results in a conditional Gaussian Given any assignment to the discrete variables, the distribution over the continuous ones is multivariate GaussianGiven any assignment to the discrete variables, the distribution over the continuous ones is multivariate Gaussian Adding discrete variables to a multivariate Gaussian results in a conditional Gaussian Given any assignment to the discrete variables, the distribution over the continuous ones is multivariate GaussianGiven any assignment to the discrete variables, the distribution over the continuous ones is multivariate Gaussian

34 Discrete variables with cont. parents Either you buy or you don’t But there is a soft threshold around your desired costBut there is a soft threshold around your desired cost Either you buy or you don’t But there is a soft threshold around your desired costBut there is a soft threshold around your desired cost

35 Discrete variables with cont. parents Normal Dist.


Download ppt "CS 416 Artificial Intelligence Lecture 14 Uncertainty Chapters 13 and 14 Lecture 14 Uncertainty Chapters 13 and 14."

Similar presentations


Ads by Google