• Home
  • Textbooks
  • Artificial Intelligence. A Modern Approach [Global Edition]
  • Quantifying Uncertainty

Artificial Intelligence. A Modern Approach [Global Edition]

Stuart Russell, Peter Norvig

Chapter 13

Quantifying Uncertainty - all with Video Answers

Educators


Chapter Questions

00:38

Problem 1

Show from first principles that $P(a \mid b \wedge a)=1$.

Hunza Gilgit
Hunza Gilgit
Numerade Educator
05:09

Problem 2

Using the axioms of probability, prove that any probability distribution on a discrete random variable must sum to 1 .

Bryan Lynn
Bryan Lynn
Numerade Educator

Problem 3

For each of the following statements, either prove it is true or give a counterexample.
a. If $P(a \mid b, c)=P(b \mid a, c)$, then $P(a \mid c)=P(b \mid c)$
b. If $P(a \mid b, c)=P(a)$, then $P(b \mid c)=P(b)$
c. If $P(a \mid b)=P(a)$, then $P(a \mid b, c)=P(a \mid c)$

Check back soon!
00:56

Problem 4

Would it be rational for an agent to hold the three beliefs $P(A)=0.4, P(B)=0.3$, and $P(A \vee B)=0.5$ ? If so, what range of probabilities would be rational for the agent to hold for $A \wedge B$ ? Make up a table like the one in Figure 13.2, and show how it supports your argument about rationality. Then draw another version of the table where $P(A \vee B)=0.7$. Explain why it is rational to have this probability, even though the table shows one case that is a loss and three that just break even.

Sherrie Fenner
Sherrie Fenner
Numerade Educator
00:50

Problem 5

This question deals with the properties of possible worlds, defined on page 488 as assignments to all random variables. We will work with propositions that correspond to exactly one possible world because they pin down the assignments of all the variables. In probability theory, such propositions are called atomic events. For example, with Boolean variables $X_1, X_2, X_3$, the proposition $x_1 \wedge \neg x_2 \wedge \neg x_3$ fixes the assignment of the variables; in the language of propositional logic, we would say it has exactly one model.
a. Prove, for the case of $n$ Boolean variables, that any two distinct atomic events are mutually exclusive; that is, their conjunction is equivalent to false.
b. Prove that the disjunction of all possible atomic events is logically equivalent to true.
c. Prove that any proposition is logically equivalent to the disjunction of the atomic events that entail its truth.

Amy Jiang
Amy Jiang
Numerade Educator
04:23

Problem 6

Prove Equation (13.4) from Equations (13.1) and (13.2).

Mayank Tripathi
Mayank Tripathi
Numerade Educator
03:37

Problem 7

Consider the set of all possible five-card poker hands dealt fairly from a standard deck of fifty-two cards.
a. How many atomic events are there in the joint probability distribution (i.e., how many five-card hands are there)?
b. What is the probability of each atomic event?
c. What is the probability of being dealt a royal straight flush? Four of a kind?

Varsha Aggarwal
Varsha Aggarwal
Numerade Educator
00:41

Problem 8

Given the full joint distribution shown in Figure 13.3, calculate the following:
a. $\mathbf{P}$ (toothache).
b. $\mathbf{P}($ Catch $)$.
c. $\mathbf{P}($ Cavity $\mid$ catch $)$.
d. $\mathbf{P}($ Cavity $\mid$ toothache $\vee$ catch $)$.

Mohamed Mohamed
Mohamed Mohamed
Numerade Educator

Problem 9

In his letter of August 24, 1654, Pascal was trying to show how a pot of money should be allocated when a gambling game must end prematurely. Imagine a game where each turn consists of the roll of a die, player $E$ gets a point when the die is even, and player $O$ gets a point when the die is odd. The first player to get 7 points wins the pot. Suppose the game is interrupted with $E$ leading 4-2. How should the money be fairly split in this case? What is the general formula? (Fermat and Pascal made several errors before solving the problem, but you should be able to get it right the first time.)

Check back soon!
03:16

Problem 10

Deciding to put our knowledge of probability to good use, we encounter a slot machine with three independently turning reels, each producing one of the four symbols BAR, BELL, LEMON, or CHERRY with equal probability. The slot machine has the following payout scheme for a bet of 1 coin (where "??" denotes that we don't care what comes up for that wheel):
BAR/BAR/BAR pays 21 coins
BELL/BELL/BELL pays 16 coins
LEMON/LEMON/LEMON pays 5 coins
CHERRY/CHERRY/CHERRY pays 3 coins
CHERRY/CHERRY/? pays 2 coins
CHERRY/? /? pays 1 coin
a. Compute the expected "payback" percentage of the machine. In other words, for each coin played, what is the expected coin return?
b. Compute the probability that playing the slot machine once will result in a win.
c. Estimate the mean and median number of plays you can expect to make until you go broke, if you start with 8 coins. You can run a simulation to estimate this, rather than trying to compute an exact answer.

Carson Merrill
Carson Merrill
Numerade Educator
10:39

Problem 11

We wish to transmit an $n$-bit message to a receiving agent. The bits in the message are independently corrupted (flipped) during transmission with $\epsilon$ probability each. With an extra parity bit sent along with the original information, a message can be corrected by the receiver if at most one bit in the entire message (including the parity bit) has been corrupted. Suppose we want to ensure that the correct message is received with probability at least $1-\delta$. What is the maximum feasible value of $n$ ? Calculate this value for the case $\epsilon=0.002, \delta=0.01$.

Chris Trentman
Chris Trentman
Numerade Educator

Problem 12

Show that the three forms of independence in Equation (13.11) are equivalent.

Check back soon!
05:58

Problem 13

Consider two medical tests, A and B, for a virus. Test A is 95\% effective at recognizing the virus when it is present, but has a $10 \%$ false positive rate (indicating that the virus is present, when it is not). Test B is $90 \%$ effective at recognizing the virus, but has a $5 \%$ false positive rate. The two tests use independent methods of identifying the virus. The virus is carried by $1 \%$ of all people. Say that a person is tested for the virus using only one of the tests, and that test comes back positive for carrying the virus. Which test returning positive is more indicative of someone really carrying the virus? Justify your answer mathematically.

Harsh Gadhiya
Harsh Gadhiya
Numerade Educator
01:04

Problem 14

Suppose you are given a coin that lands heads with probability $x$ and tails with probability $1-x$. Are the outcomes of successive flips of the coin independent of each other given that you know the value of $x$ ? Are the outcomes of successive flips of the coin independent of each other if you do not know the value of $x$ ? Justify your answer.

Sophie Knight
Sophie Knight
Numerade Educator
View

Problem 15

After your yearly checkup, the doctor has bad news and good news. The bad news is that you tested positive for a serious disease and that the test is $99 \%$ accurate (i.e., the probability of testing positive when you do have the disease is 0.99 , as is the probability of testing negative when you don't have the disease). The good news is that this is a rare disease, striking only 1 in 100,000 people of your age. Why is it good news that the disease is rare? What are the chances that you actually have the disease?

Rashmi Sinha
Rashmi Sinha
Numerade Educator

Problem 16

It is quite often useful to consider the effect of some specific propositions in the context of some general background evidence that remains fixed, rather than in the complete absence of information. The following questions ask you to prove more general versions of the product rule and Bayes' rule, with respect to some background evidence e:
a. Prove the conditionalized version of the general product rule:
$$
\mathbf{P}(X, Y \mid \mathbf{e})=\mathbf{P}(X \mid Y, \mathbf{e}) \mathbf{P}(Y \mid \mathbf{e}) .
$$
b. Prove the conditionalized version of Bayes' rule in Equation (13.13).

Check back soon!
04:37

Problem 17

Show that the statement of conditional independence
$$
\mathbf{P}(X, Y \mid Z)=\mathbf{P}(X \mid Z) \mathbf{P}(Y \mid Z)
$$
is equivalent to each of the statements
$$
\mathbf{P}(X \mid Y, Z)=\mathbf{P}(X \mid Z) \text { and } \mathbf{P}(B \mid X, Z)=\mathbf{P}(Y \mid Z) .
$$

Manisha Sarker
Manisha Sarker
Numerade Educator
01:20

Problem 18

In this exercise, you will complete the normalization calculation for the meningitis example. First, make up a suitable value for $P(s \mid \neg m)$, and use it to calculate unnormalized values for $P(m \mid s)$ and $P(\neg m \mid s)$ (i.e., ignoring the $P(s)$ term in the Bayes' rule expression, Equation (13.14)). Now normalize these values so that they add to 1 .

Harsh Gadhiya
Harsh Gadhiya
Numerade Educator
04:37

Problem 19

This exercise investigates the way in which conditional independence relationships affect the amount of information needed for probabilistic calculations.
a. Suppose we wish to calculate $P\left(h \mid e_1, e_2\right)$ and we have no conditional independence information. Which of the following sets of numbers are sufficient for the calculation?
(i) $\mathbf{P}\left(E_1, E_2\right), \mathbf{P}(H), \mathbf{P}\left(E_1 \mid H\right), \mathbf{P}\left(E_2 \mid H\right)$
(ii) $\mathbf{P}\left(E_1, E_2\right), \mathbf{P}(H), \mathbf{P}\left(E_1, E_2 \mid H\right)$
(iii) $\mathbf{P}(H), \mathbf{P}\left(E_1 \mid H\right), \mathbf{P}\left(E_2 \mid H\right)$
b. Suppose we know that $\mathbf{P}\left(E_1 \mid H, E_2\right)=\mathbf{P}\left(E_1 \mid H\right)$ for all values of $H, E_1, E_2$. Now which of the three sets are sufficient?

Manisha Sarker
Manisha Sarker
Numerade Educator

Problem 20

Let $X, Y, Z$ be Boolean random variables. Label the eight entries in the joint distribution $\mathbf{P}(X, Y, Z)$ as $a$ through $h$. Express the statement that $X$ and $Y$ are conditionally independent given $Z$, as a set of equations relating $a$ through $h$. How many nonredundant equations are there?

Check back soon!
01:05

Problem 21

Write out a general algorithm for answering queries of the form $\mathbf{P}($ Cause $\mid \mathbf{e})$, using a naive Bayes distribution. Assume that the evidence e may assign values to any subset of the effect variables.

Lauren Shelton
Lauren Shelton
Numerade Educator

Problem 22

Text categorization is the task of assigning a given document to one of a fixed set of categories on the basis of the text it contains. Naive Bayes models are often used for this task. In these models, the query variable is the document category, and the "effect" variables are the presence or absence of each word in the language; the assumption is that words occur independently in documents, with frequencies determined by the document category.
a. Explain precisely how such a model can be constructed, given as "training data" a set of documents that have been assigned to categories.
b. Explain precisely how to categorize a new document.
c. Is the conditional independence assumption reasonable? Discuss.

Check back soon!
06:47

Problem 23

In our analysis of the wumpus world, we used the fact that each square contains a pit with probability 0.2 , independently of the contents of the other squares. Suppose instead that exactly $N / 5$ pits are scattered at random among the $N$ squares other than [1,1]. Are the variables $P_{i, j}$ and $P_{k, l}$ still independent? What is the joint distribution $\mathbf{P}\left(P_{1,1}, \ldots, P_{4,4}\right)$ now? Redo the calculation for the probabilities of pits in $[1,3]$ and $[2,2]$.

Abhirup Pal
Abhirup Pal
Numerade Educator
View

Problem 24

Redo the probability calculation for pits in $[1,3]$ and $[2,2]$, assuming that each square contains a pit with probability 0.01 , independent of the other squares. What can you say about the relative performance of a logical versus a probabilistic agent in this case?

Rashmi Sinha
Rashmi Sinha
Numerade Educator

Problem 25

Implement a hybrid probabilistic agent for the wumpus world, based on the hybrid agent in Figure 7.20 and the probabilistic inference procedure outlined in this chapter.

Check back soon!