An empirical demonstration of the no free lunch theorem
Loading...
Date
2019
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky
Altmetrics
Abstract
In this paper, we provide a substantial empirical demonstration of thestatistical machine learning result known as the No Free Lunch Theorem (NFLT).We specifically compare the predictive performances of a wide variety of machinelearning algorithms/methods on a wide variety of qualitatively and quantitativelydifferent datasets. Our research work conclusively demonstrates a great evidence infavor of the NFLT by using an overall ranking of methods and their correspondinglearning machines, revealing in effect thatnone of the learning machines consideredpredictively outperforms all the other machines on all the widely different datasetsanalyzed. It is noteworthy however that while evidence from various datasets andmethods support the NFLT somewhat emphatically, some learning machines likeRandom Forest, Adaptive Boosting, and Support Vector Machines (SVM) appearto emerge as methods with the overall tendency to yield predictive performancesalmost always among the best.
Description
Keywords
Citation
Mathematics for Applications. 2019 vol. 8, č. 2, s. 173-188. ISSN 1805-3629
http://ma.fme.vutbr.cz/archiv/8_2/ma_8_2_5_ogundepo_fokoue_final.pdf
http://ma.fme.vutbr.cz/archiv/8_2/ma_8_2_5_ogundepo_fokoue_final.pdf
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en
Study field
Comittee
Date of acceptance
Defence
Result of defence
Document licence
© Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky