

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
A problem set from the university of illinois, urbana-champaign's department of electrical and computer engineering, for the course ece 313: probability with engineering applications, in the fall semester of 2003. The problem set focuses on decision theory and includes various problems related to jensen's inequality, conditional probabilities, and likelihood matrices. Students are expected to solve problems involving bounds on expectations, probabilities of events, and decision making based on given data.
Typology: Assignments
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Department of Electrical and Computer Engineering
ECE 313: Probability with Engineering Applications-Fall 2003
Problem Set 5: An Introduction to Decision Theory
Issued: September 26, 2003 Due: October 3, 2003
Note: Class is cancelled on Friday, October 3. Homework should be deposited at Sung-Hoon Kim’s mailbox at EL 159 by 5:00 p.m. on Friday.
Reading Assignments: Ross, Chapter 3 and Notes on Decision Making (excerpted from notes of Prof. D.V. Sarwate).
Problems NOT to be turned in:
Problems Theoretical Exercises Chapter 3 14, 29, 55 1, 6, 14
Problems to be turned in:
(a) Show that this is true when the function is affine: f (x) = a + bx, x ∈ R, for some constants a and b. (b) Show that this is true when f (x) = x^2 , x ∈ R. Hint: consider the representation of the variance of X in terms of first and second moments. (c) You will now establish Jensen’s inequality for f (x) = (^) x^1 , x > 0. First, note that for any a > 0,
x−^1 = f (x) ≥ fa(x) = a−^1 − a−^2 (x − a).
Sketch f and fa on a single graph for one fixed value of a > 0 to verify this. Argue that for any a, with this f, fa, E[f (X)] ≥ E[fa(X)]. Now, choose the best value of a in this bound: this yields Jensen’s inequality!
P (A | B) = P (B | A) = 2 − P (A)−^1. (^1) A twice-differentiable real-valued function f (x) is called convex if f ′′(x) ≥ 0 for all x.
(a) The probability of answering the question correctly is unity if the student knows the answer. It is equal to 1/6 otherwise. Compute the probability that an examinee knew the answer to a question, given that he or she has correctly answered it. (b) A student knows the answer to K of the N problems, and marks the answer sheet accordingly. The examiner determines W , the number of incorrect answers on the examiner’s sheet. Assume that the value of p is identical in each problem, and that K has a binomial (N, p) distribution. Argue that W is also binomial (N, q), where q is the probability that the first answer is incorrect. (c) What is the conditional probability that K = k, given W = w, for given k and w? Hint: It is far easier to first compute P (W = w | K = k).
For example, P [Y = 2 | H 1 ] = 0.8. Suppose that, given one of the hypotheses is true, the sensors provide conditionally independent readings, so that P [X = i, Y = j | Hk] = P [X = i | Hk]P [Y = j | Hk] for 0 ≤ i, j ≤ 2 and 0 ≤ k ≤ 1. Since both X and Y are observed, there are nine possible values for the observation (X, Y ).
(a) Find the likelihood matrix for the observation given the hypothesis. This matrix specifies P [X = i, Y = j | Hk] for each hypothesis Hk and for each possible observation value (i, j). (The matrix has two rows, the first row corresponding to H 0 and the second row corresponding to H 1. The matrix has nine columns of numbers, each corresponding to the nine possible values of the observation (X, Y ) : 00, 01 , 02 , 10 , 11 , 12 , 20 , 21 , 22. The sum of the entries in each row is one.) Also, indicate for each of the nine possible observation values, the maximum likelihood (ML) decision of which hypothesis is true. This is done by simply circling the larger number in each column. Break ties in favor of H 1. (b) For the ML decision rule, compute the false alarm (conditional) probability and miss (condi- tional) probability defined by
pfalse alarm = P [decide H 1 is true | H 0 ] pmiss = P [decide H 0 is true | H 1 ].
For example, pfalse alarm is the sum of all the entries in the first row of the likelihood matrix that were not circled in part (a). (c) Suppose it is decided on the basis of observations of occupancy patterns that π 0 = P [H 0 ] = 0. 7 and π 1 = P [H 1 ] = 0.3. These probabilities π 0 and π 1 are prior probabilities: they are assumed