Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Abstract—We consider two desired properties of learning algorithms: sparsity and algorithmic stability. Both properties are believed to lead to good generalization ability. We sh...
There has been considerable discussion of the pros/cons of recombination and mutation operators in the context of Holland's schema theory. In this paper we de ne a common fra...