paper-with-me

Papers

Tight Risk Bounds for Multi-Class Margin Classifiers

2015-07-10 · Yury Maximov, Daria Reshetova

We consider a problem of risk estimation for large-margin multi-class classifiers. We propose a novel risk bound for the multi-class classification problem. The bound involves the marginal distribution of the classifier and the Rademacher complexity of the hypothesis class. We prove that our bound is tight in the number of classes. Finally, we compare our bound with the related ones and provide a simplified version of the bound for the multi-class classification with kernel based hypotheses.

📄 PDF Abstract BibTeX arXiv:1507.03040

Code (0)

등록된 구현이 없습니다.

Tasks

ClassificationGeneral ClassificationMulti-class Classification

Similar Papers 제목 키워드 기반

On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization

2008-12-01 · NeurIPS 2008 12 · Sham M. Kakade, Karthik Sridharan, Ambuj Tewari

We provide sharp bounds for Rademacher and Gaussian complexities of (constrained) linear classes. These bounds make short work of providing a number of corollaries including: risk bounds for linear prediction (including …

Improving Generalization Bounds for VC Classes Using the Hypergeometric Tail Inversion

2021-10-29 · Jean-Samuel Leboeuf, Frédéric LeBlanc, Mario Marchand

We significantly improve the generalization bounds for VC classes by using two main ideas. First, we consider the hypergeometric tail inversion to obtain a very tight non-uniform distribution-independent risk upper bound…

Generalization Bounds

Tight Risk Bounds for Gradient Descent on Separable Data

2023-03-02 · NeurIPS 2023 11

We study the generalization properties of unregularized gradient methods applied to separable linear classification -- a setting that has received considerable attention since the pioneering work of Soudry et al. (2018).…

Risk Bounds for Over-parameterized Maximum Margin Classification on Sub-Gaussian Mixtures

2021-04-28 · NeurIPS 2021 12 · Yuan Cao, Quanquan Gu, Mikhail Belkin

Modern machine learning systems such as deep neural networks are often highly over-parameterized so that they can fit the noisy training data exactly, yet they can still achieve small test errors in practice. In this pap…

ClassificationGeneral Classificationregression

Tight Sample Complexity of Large-Margin Learning

2010-12-01 · NeurIPS 2010 12 · Sivan Sabato, Nathan Srebro, Naftali Tishby

We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the gamma-adapted-dimension, which is a simple function of the spectru…

ClassificationGeneral ClassificationL2 Regularization