Tight Sample Complexity of Large-Margin Learning
| 
77 | 
68 | 
0
Abstract
We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with 
regularization: We introduce the 
-adapted-dimension, which is a simple function of the spectrum of a distribution’s covariance matrix, and show distribution-specific upper and lower bounds on the sample complexity, both governed by the 
-adapted-dimension of the source distribution. We conclude that this new quantity tightly characterizes the true sample complexity of large-margin classification. The bounds hold for a rich family of sub-Gaussian distributions.
还没有评论，说两句吧！
热门资源
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Learning to Predi...
Much of model-based reinforcement learning invo...
The Variational S...
Unlike traditional images which do not offer in...
Hierarchical Task...
We extend hierarchical task network planning wi...
Shape-based Autom...
We present an algorithm for automatic detection...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
