Evolvability need not imply learnability

Computer Science – Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We show that Boolean functions expressible as monotone disjunctive normal forms are PAC-evolvable under a uniform distribution on the Boolean cube if the hypothesis size is allowed to remain fixed. We further show that this result is insufficient to prove the PAC-learnability of monotone Boolean functions, thereby demonstrating a counter-example to a recent claim to the contrary. We further discuss scenarios wherein evolvability and learnability will coincide as well as scenarios under which they differ. The implications of the latter case on the prospects of learning in complex hypothesis spaces is briefly examined.

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

Evolvability need not imply learnability 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 Evolvability need not imply learnability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Evolvability need not imply learnability will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-122804

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