14.1 Tighter stability bounds

(a) Assuming the conditions of theorem 14.2 hold, can one hope to guarantee a generalization with slack better than O(1=pm) even if the algorithm is very stable, i.e. ! 0?

(b) Can you show an O(1=m) generalization guarantee if L is bounded by C=pm

(a very strong condition)? If so, how stable does the learning algorithm need to be?