1. |
- Ambroladze, Amiran, et al.
(författare)
-
When is small beautiful?
- 2003
-
Ingår i: Lecture Notes in Computer Science (Learning Theory and Kernel Machines). - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783540407201 ; 2777, s. 729-730
-
Konferensbidrag (refereegranskat)abstract
- The basic bound on the generalisation error of a PAC learner makes the assumption that a consistent hypothesis exists. This makes it appropriate to apply the method only in the case where we have a guarantee that a consistent hypothesis can be found, something that is rarely possible in real applications. The same problem arises if we decide not to use a hypothesis unless its error is below a prespecified number.
|
|