2008
DOI: 10.1007/978-3-540-87536-9_32
|View full text |Cite
|
Sign up to set email alerts
|

A Kernel Method for the Optimization of the Margin Distribution

Abstract: Abstract. Recent results in theoretical machine learning seem to suggest that nice properties of the margin distribution over a training set turns out in a good performance of a classifier. The same principle has been already used in SVM and other kernel based methods as the associated optimization problems try to maximize the minimum of these margins. In this paper, we propose a kernel based method for the direct optimization of the margin distribution (KM-OMD). The method is motivated and analyzed from a gam… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
36
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 38 publications
(38 citation statements)
references
References 5 publications
2
36
0
Order By: Relevance
“…The kernel machines (SVM and KOMD) were validated using the same subset of data to obtain a fair comparison. The performance of SVM and KOMD was similar in most of the cases, thus confirming the findings in [7].…”
Section: Smo Projected Gradient Descent Generalized Mkl (Spg-gmkl)supporting
confidence: 88%
See 1 more Smart Citation
“…The kernel machines (SVM and KOMD) were validated using the same subset of data to obtain a fair comparison. The performance of SVM and KOMD was similar in most of the cases, thus confirming the findings in [7].…”
Section: Smo Projected Gradient Descent Generalized Mkl (Spg-gmkl)supporting
confidence: 88%
“…In [7] a game theoretic interpretation as a two-player zero-sum game has been proposed for the problem of margin maximization in a classification task. Specifically, the classification task has been split into two phases.…”
Section: Playing With Margin and The Komd Algorithmmentioning
confidence: 99%
“…Table 1 shows some experimental results of comparing LDM to SVM, where it can be seen that LDM is significantly better on more than half of the experimental datasets and never worse than SVM. Such a simple implementation of large margin distribution learning also exhibits superior performance to many other related methods [1,6,11] in experiments [21].…”
Section: A Simple Implementation Of Large Margin Distribution Learningmentioning
confidence: 84%
“…Reyzin and Schapire [12] suggested to maximize the average or median margin, and there are also efforts on maximizing the average margin or weighted combination margin [1,6,11]. These arguments, however, are all heuristics without theoretical justification.…”
Section: The Long March Of Margin Theory For Boostingmentioning
confidence: 99%
“…In this work, a custom version of EasyMKL [1] was implemented as it achieves high performance at a low computational cost. EasyMKL is based on the Kernel method for the Optimization of the Margin Distribution (KOMD) [2] and focuses on optimizing a linear combination of kernels:…”
Section: Pathway Induced Multiple Kernel Learningmentioning
confidence: 99%