Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

How Gruesome are the No-free-lunch Theorems for Machine Learning? (CROSBI ID 259967)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Lauc, Davor How Gruesome are the No-free-lunch Theorems for Machine Learning? // Croatian journal of philosophy, XVIII (2018), 54; 479-489

Podaci o odgovornosti

Lauc, Davor

engleski

How Gruesome are the No-free-lunch Theorems for Machine Learning?

No-free-lunch theorems are important theoretical result in the fi elds of machine learning and artifi cial intelligence. Researchers in this fi elds often claim that the theorems are based on Hume’s argument about induction and represent a formalisation of the argument. This paper argues that this is erroneous but that the theorems correspond to and formalise Goodman’s new riddle of induction. To demonstrate the correspondence among the theorems and Goodman’s argument, a formalisation of the latter in the spirit of the former is sketched.

Induction ; the problem of ; No-free-lunch theorems ; The new riddle of induction

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

XVIII (54)

2018.

479-489

objavljeno

1333-1108

1847-6139

Povezanost rada

Filozofija, Računarstvo

Poveznice
Indeksiranost