## What steps would you need to take if you were to do that?

You are a career counselor in a large public high school. You are asked to conduct a week-long unit on career decision making for students in the AP English classes. Your plan is to have two classes on selfexploration, giving students an interest inventory and an ability checklist. Two classes will focus on worldof-work information and college exploration, and the final class will be on decision making. Two African American students refuse to take the interest inventory because they will base their future choices on how to be a credit to their race, not on their interests.

1. What would you do in this situation?

2. On which ethical codes and professional standards would you base your decision?

3. Would interacting with the father violate your client’s confidentiality?

4. Would you consider inviting the father into the career counseling with his daughter? What steps would you need to take if you were to do that?

5. Your client feels a very strong obligation to family. Do you have an obligation to include her father in career counseling?

### Prove that the hypothesis class of all conjunctions over d variables is PAC learnable and bound its sample complexity.

1.  In this question, we study the hypothesis class of Boolean conjunctions defined as follows. The instance space is X ={0,1}d and the label set is Y ={0,1}. A literal over the variables x1, . . ., xd is a….

### Show that for every probability distribution D, the Bayes optimal predictor fD is optimal, in the sense that for every classifier g from X to {0,1}, LD( fD) ≤ LD(g).

1. Let H be a hypothesis class of binary classifiers. Show that if H is agnostic PAC learnable, then His PAC learnable as well. Furthermore, if A is a successful agnostic PAC learner for H, then A is also a….

### . Show that the algorithm just described satisfies the requirements for being a RP solver for ERMH.

1. On the basis of the preceding, prove that for any k ≥ 3, the ERMHnk problem is NP-hard. 2 In this exercise we show that hardness of solving the ERM problem is equivalent….