@inbook{e956789096fe40b985314c152f8ce8e1,

title = "On the complexity of samples for learning",

abstract = "In machine-learning, maximizing the sample margin can reduce the learning generalization-error. Thus samples on which the target function has a large margin (γ) convey more information so we expect fewer such samples. In this paper, we estimate the complexity of a class of sets of large-margin samples for a general learning problem over a finite domain. We obtain an explicit dependence of this complexity on γ and the sample size.",

author = "Joel Ratsaby",

year = "2004",

month = jan,

day = "1",

doi = "10.1007/978-3-540-27798-9_23",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "198--209",

editor = "Kyung-Yong Chwa and {Ian Munro}, J.",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}