返回
Learning with smooth Hinge losses
DOI:10.1016/j.neucom.2021.08.060.png)
摘要
En 中文
Due to the non-smoothness of the Hinge loss in SVM, it is difficult to obtain a faster convergence rate with modern optimization algorithms. In this paper, we introduce two smooth Hinge losses psi(G)(alpha, sigma) and psi(M)(alpha; sigma) which are infinitely differentiable and converge to the Hinge loss uniformly in alpha as sigma tends to 0. By replacing the Hinge loss with these two smooth Hinge losses, we obtain two smooth support vector machines (SSVMs), respectively. Solving the SSVMs with the Trust Region Newton method (TRON) leads to two quadratically convergent algorithms. Experiments in text classification tasks show that the proposed SSVMs are effective in real-world applications. We also introduce a general smooth convex loss function to unify several commonly-used convex loss functions in machine learning. The general framework provides smooth approximation functions to non-smooth convex loss functions, which can be used to obtain smooth models that can be solved with faster convergent optimization algorithms. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Smooth Hinge loss
Convex surrogate loss
Support vector machine
Trust region Newton method
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Improvements on least squares twin multi-class classification support vector machine最小二乘孪生多类分类支持向量机的改进
NEUROCOMPUTING
IF6.5
Effect of Chemical Treatments on the Physical Properties of Non-woven Jute/PLA Biocomposites化学处理对非织造黄麻/PLA生物复合材料物理性能的影响
BioResources
IF0

