A Close Look to Margin Complexity and Related Parameters

Michael Kallweit, Hans Ulrich Simon
; Proceedings of the 24th Annual Conference on Learning Theory, JMLR Workshop and Conference Proceedings 19:437-456, 2011.

Abstract

Concept classes can canonically be represented by sign-matrices,i.e., by matrices with entries 1 and -1. The question whethera sign-matrix (concept class) A can be learned by a machine that performs large margin classification is closely related to the“margin complexity” associated with A. We consider severalvariants of margin complexity, reveal how they are relatedto each other, and we reveal how they are related to other notions of learning-theoretic relevance like SQ-dimension, CSQ-dimension,and the Forster bound.

Cite this Paper


BibTeX
@InProceedings{pmlr-v19-kallweit11a, title = {A Close Look to Margin Complexity and Related Parameters}, author = {Michael Kallweit and Hans Ulrich Simon}, pages = {437--456}, year = {2011}, editor = {Sham M. Kakade and Ulrike von Luxburg}, volume = {19}, series = {Proceedings of Machine Learning Research}, address = {Budapest, Hungary}, month = {09--11 Jun}, publisher = {JMLR Workshop and Conference Proceedings}, pdf = {http://proceedings.mlr.press/v19/kallweit11a/kallweit11a.pdf}, url = {http://proceedings.mlr.press/v19/kallweit11a.html}, abstract = {Concept classes can canonically be represented by sign-matrices,i.e., by matrices with entries 1 and -1. The question whethera sign-matrix (concept class) A can be learned by a machine that performs large margin classification is closely related to the“margin complexity” associated with A. We consider severalvariants of margin complexity, reveal how they are relatedto each other, and we reveal how they are related to other notions of learning-theoretic relevance like SQ-dimension, CSQ-dimension,and the Forster bound.} }
Endnote
%0 Conference Paper %T A Close Look to Margin Complexity and Related Parameters %A Michael Kallweit %A Hans Ulrich Simon %B Proceedings of the 24th Annual Conference on Learning Theory %C Proceedings of Machine Learning Research %D 2011 %E Sham M. Kakade %E Ulrike von Luxburg %F pmlr-v19-kallweit11a %I PMLR %J Proceedings of Machine Learning Research %P 437--456 %U http://proceedings.mlr.press %V 19 %W PMLR %X Concept classes can canonically be represented by sign-matrices,i.e., by matrices with entries 1 and -1. The question whethera sign-matrix (concept class) A can be learned by a machine that performs large margin classification is closely related to the“margin complexity” associated with A. We consider severalvariants of margin complexity, reveal how they are relatedto each other, and we reveal how they are related to other notions of learning-theoretic relevance like SQ-dimension, CSQ-dimension,and the Forster bound.
RIS
TY - CPAPER TI - A Close Look to Margin Complexity and Related Parameters AU - Michael Kallweit AU - Hans Ulrich Simon BT - Proceedings of the 24th Annual Conference on Learning Theory PY - 2011/12/21 DA - 2011/12/21 ED - Sham M. Kakade ED - Ulrike von Luxburg ID - pmlr-v19-kallweit11a PB - PMLR SP - 437 DP - PMLR EP - 456 L1 - http://proceedings.mlr.press/v19/kallweit11a/kallweit11a.pdf UR - http://proceedings.mlr.press/v19/kallweit11a.html AB - Concept classes can canonically be represented by sign-matrices,i.e., by matrices with entries 1 and -1. The question whethera sign-matrix (concept class) A can be learned by a machine that performs large margin classification is closely related to the“margin complexity” associated with A. We consider severalvariants of margin complexity, reveal how they are relatedto each other, and we reveal how they are related to other notions of learning-theoretic relevance like SQ-dimension, CSQ-dimension,and the Forster bound. ER -
APA
Kallweit, M. & Simon, H.U.. (2011). A Close Look to Margin Complexity and Related Parameters. Proceedings of the 24th Annual Conference on Learning Theory, in PMLR 19:437-456

Related Material