More theorems about scale-sensitive dimensions and learning

A general upper bound on the expected absolute error of this algorithm is proved in terms of a scale-sensitive generalization of the Vapnik dimension proposed by Alon, Ben-David, Cesa-Bianchi and Haussler.