Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes

Details Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes

2009-07-09

arxiv.org/abs/0907.1597v3

Computer Science

Information Theory

(V3 fixed some other typos and improved some results)

Scientific paper

We show how the necessary and sufficient conditions for the NFL to apply can be reduced to the single requirement of the set of objective functions under consideration being closed under permutation, and quantify the extent to which a set of objectives not closed under permutation can give rise to a performance difference between two algorithms. Then we provide a more refined definition of performance under which we show that revisiting algorithms are always trumped by enumerative ones.

Affiliated with

Also associated with

No associations

Rating

Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-342027