Sciweavers

120 search results - page 4 / 24
» Theorems for Free!
Sort
View
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
13 years 8 months ago
Focused no free lunch theorems
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 ...
Darrell Whitley, Jonathan E. Rowe
PAMI
2012
11 years 10 months ago
Sparse Algorithms Are Not Stable: A No-Free-Lunch Theorem
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...
Huan Xu, Constantine Caramanis, Shie Mannor
FOGA
1998
13 years 9 months ago
Dining with GAs: Operator Lunch Theorems
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...
William M. Spears, Kenneth A. De Jong