Learning methods with linear computational complexity O(nd) in number of samples and their dimension often give results that are better or at least not worse that more sophisticated and slower algorithms. This is ...