## Abstract

In a recent paper [M. Anthony, J. Ratsaby, Maximal width learning of binary functions, Theoretical Computer Science 411 (2010) 138-147] the notion of sample width for binary classifiers mapping from the real line was introduced, and it was shown that the performance of such classifiers could be quantified in terms of this quantity. This paper considers how to generalize the notion of sample width so that we can apply it where the classifiers map from some finite metric space. By relating the learning problem to one involving the domination numbers of certain graphs, we obtain generalization error bounds that depend on the sample width and on certain measures of 'density' of the underlying metric space. We also discuss how to employ a greedy set-covering heuristic to bound generalization error.

Original language | English |
---|---|

Pages (from-to) | 2-10 |

Number of pages | 9 |

Journal | Theoretical Computer Science |

Volume | 529 |

DOIs | |

State | Published - 1 Jan 2014 |

Externally published | Yes |

## Keywords

- Generalization error
- Learning algorithms
- Machine learning

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science (all)