vix.ing · top · new · best · stats · spec

Comparison theorems on large-margin learning

2019/08/13 by Jun Fan, Fan, Jun, Dao-Hong Xiang +1
Computer Science · #FOS: Computer and information sciences #Face and Expression Recognition #Imbalanced Data Classification Techniques #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Machine Learning and Algorithms

paper · pdf · doi:10.48550/arxiv.1908.04470

openalex publication_date 2019/08/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper studies binary classification problem associated with a family of loss functions called large-margin unified machines (LUM), which offers a natural bridge between distribution-based likelihood approaches and margin-based approaches. It also can overcome the so-called data piling issue of support vector machine in the high-dimension and low-sample size setting. In this paper we establish some new comparison theorems for all LUM loss functions which play a key role in the further error analysis of large-margin learning algorithms.

Related