Program Induction, Complexity and Occam''s Razor
John Woodward
Broschiertes Buch

Program Induction, Complexity and Occam''s Razor

The Induction of Computable Functions, Modularity and No Free Lunch Theorems

Versandkostenfrei!
Versandfertig in 6-10 Tagen
38,99 €
inkl. MwSt.
PAYBACK Punkte
19 °P sammeln!
Search is a broad machine learning method where solutions are generated and tested. We focus on evolving computable functions with genetic programming. The literature reveals the complexity of programs is small, indicating a limitation of current methods. No Free Lunch is not valid for machine learning as simpler functions are represented more frequently which is also related to Occam's razor. We argue for Occam's razor, not on grounds of simplicity but probability. The complexity of a function depends on the primitives available. If the representation can build new primitives, then the comple...