Prove that A is on-average-replace-one-stable with rate 2ρ2 λm .

1. Strong Convexity with Respect to General Norms: Throughout the section we used the            2 norm. In this exercise we generalize some of the results to general norms. Let       ·               be some arbitrary norm, and let be a strongly convex function with respect to this norm (see Definition 13.4).

2. Show that items 2–3 of Lemma 13.5 hold for every norm.

3. (*) Give an example of a norm for which item 1 of Lemma 13.5 does not hold.

4. Let R(w) be a function that is (2λ)-strongly convex with respect to some nor. Let be an RLM rule with respect to R, namely, A(S)= argmin W _ LS(w)+ R(w) _ .

Assume that for every z, the loss function            z) is ρ-Lipschitz with respect to the same norm, namely, ∀z∀wv,     (wz)−          (vz) ≤ ρ               w−v       .

Prove that is on-average-replace-one-stable with rate 2ρλ.

find the cost of your paper

Suggest a modification of the binary search algorithm that emulates this strategy for a list of names.

1. Suppose that a list contains the values 20 44 48 55 62 66 74 88 93 99 at index positions 0 through 9. Trace the values of the variables….

Explain why insertion sort works well on partially sorted lists.

1. Which configuration of data in a list causes the smallest number of exchanges in a selection sort? Which configuration of data causes the largest number of exchanges? 2. Explain….

Draw a class diagram that shows the relationships among the classes in this new version of the system

Jack decides to rework the banking system, which already includes the classes BankView, Bank, SavingsAccount, and RestrictedSavingsAccount. He wants to add another class for checking accounts. He sees that savings….