A note on extending generalization bounds for binary large-margin classifiers to multiple classes

Ürün Dogan, Tobias Glasmachers, Christian Igel

2 Citations (Scopus)

Abstract

A generic way to extend generalization bounds for binary large-margin classifiers to large-margin multi-category classifiers is presented. The simple proceeding leads to surprisingly tight bounds showing the same Õ(d 2) scaling in the number d of classes as state-of-the-art results. The approach is exemplified by extending a textbook bound based on Rademacher complexity, which leads to a multi-class bound depending on the sum of the margin violations of the classifier.

Original languageEnglish
Title of host publicationMachine learning and knowledge discovery in databases : European Conference, ECML PKDD 2012, Bristol, UK, September 24-28, 2012. Proceedings, Part I
EditorsPeter A. Flach, Tijl De Bie, Nello Cristianini
Number of pages8
PublisherSpringer
Publication date2012
Pages122-129
ISBN (Print)978-3-642-33459-7
ISBN (Electronic)978-3-642-33460-3
DOIs
Publication statusPublished - 2012
SeriesLecture notes in computer science
Volume7523
ISSN0302-9743

Fingerprint

Dive into the research topics of 'A note on extending generalization bounds for binary large-margin classifiers to multiple classes'. Together they form a unique fingerprint.

Cite this