A Close Look to Margin Complexity and Related Parameters
published: Aug. 2, 2011, recorded: July 2011, views: 3059
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Concept classes can canonically be represented by sign-matrices, i.e., by matrices with entries 1 and −1. The question whether a 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 several variants of margin complexity, reveal how they are related to 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.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !