@inproceedings{2a34eefa37e44c739868c0dc5f639ebd,

title = "When is small beautiful?",

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.",

author = "Amiran Ambroladze and J Shawe-Taylor",

year = "2003",

doi = "10.1007/b12006",

language = "English",

isbn = "978-3-540-40720-1",

volume = "2777",

publisher = "Springer",

pages = "729--730",

editor = "Bernhard Sch{\"o}lkopf and Warmuth, {Manfred K.}",

booktitle = "Lecture Notes in Computer Science (Learning Theory and Kernel Machines)",

address = "Germany",

note = "16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003 ; Conference date: 24-08-2003 Through 27-08-2003",

}