Analysis of Regularized Linear Functions for Classification Problems


Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In this paper, we extend some theoretical results in this area by providing convergence analysis for regularized linear functions with an emphasis on classi cation problems. The class of methods we study in this… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.