Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

(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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-342027

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.