Please use this identifier to cite or link to this item:
|Title:||Complexity of learning according to two models of a drifting environment|
|Citation:||Long, P.M. (1999). Complexity of learning according to two models of a drifting environment. Machine Learning 37 (3) : 337-354. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1007666507971|
|Abstract:||We show that a cε3/VC dim(F) bound on the rate of drift of the distribution generating the examples is sufficient for agnostic learning to relative accuracy ε, where c>0 is a constant; this matches a known necessary condition to within a constant factor. We establish a cε2/VC dim (F) sufficient condition for the realizable case, also matching a known necessary condition to within a constant factor . We provide a relatively simple proof of a bound of O(1/ε2(VC dim (F)+log 1/δ)) on the sample complexity of agnostic learning in a fixed environment.|
|Source Title:||Machine Learning|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 24, 2018
WEB OF SCIENCETM
checked on May 16, 2018
checked on Apr 21, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.