Learning Complexity vs. Communication Complexity


This paper has two main focal points. We first consider an important class of machine learning algorithms - large margin classifiers, such as support vector machines. The notion of margin complexity quantifies the extent to which a given class of functions can be learned by large margin classifiers. We prove that up to a small multiplicative constant… (More)
DOI: 10.1017/S0963548308009656



Citations per Year

Citation Velocity: 8

Averaging 8 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Linial2008LearningCV, title={Learning Complexity vs. Communication Complexity}, author={Nathan Linial and Adi Shraibman}, journal={2008 23rd Annual IEEE Conference on Computational Complexity}, year={2008}, pages={53-63} }