arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.08932cs.LG
收藏

$\ell_p$松弛范数支持向量数据描述

$\ell_p$ Slack Norm Support Vector Data Description

Shervin R. Arashloo

摘要:

支持向量数据描述(SVDD)方法作为一类分类的事实标准,其中学习任务需要推断最小的超球体来包围目标对象,同时通过$\ell_1$范数惩罚项线性惩罚任何错误/松弛。在这项研究中,我们将这种建模形式主义一般$\ell_p$-范数($p\geq1$)松弛惩罚函数。借助于$\ell_p$松弛范数,所提出的方法使得能够制定关于松弛的非线性成本函数。从对偶问题的角度来看,所提出的方法引入了一个稀疏诱导的对偶范数的目标函数,因此,具有更高的能力来调整到固有的稀疏性的问题,增强描述能力。基于Rademacher复杂性的理论分析表征了所提出的方法在参数$p$方面的泛化性能,而在几个数据集上的实验结果证实了所提出的方法相比于其他替代方案的优点。

英文摘要:

The support vector data description (SVDD) approach serves as a de facto standard for one-class classification where the learning task entails inferring the smallest hyper-sphere to enclose target objects while linearly penalising any errors/slacks via an $\ell_1$-norm penalty term. In this study, we generalise this modelling formalism to a general $\ell_p$-norm ($p\geq1$) slack penalty function. By virtue of an $\ell_p$ slack norm, the proposed approach enables formulating a non-linear cost function with respect to slacks. From a dual problem perspective, the proposed method introduces a sparsity-inducing dual norm into the objective function, and thus, possesses a higher capacity to tune into the inherent sparsity of the problem for enhanced descriptive capability. A theoretical analysis based on Rademacher complexities characterises the generalisation performance of the proposed approach in terms of parameter $p$ while the experimental results on several datasets confirm the merits of the proposed method compared to other alternatives.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑