Scholarlink

In supervised classification models, such as Support Vector Machine, the main purpose is to predict the class membership of the incoming samples. In some real applications malicious inputs are inserted to mislead a vulnerable classifier, leading to a wrong prediction. In our work we focus first on the problem of introducing the smallest perturbation of a sample to induce incorrect classification and then on how to produce a significant downgrading of the classifier acting on a subset of the input samples. The novelty of the proposed approach is in the attempt of calculating sparse perturbations by minimizing the relative \(\ell _0\) -pseudo-norm, which gives rise to a Difference of Convex (DC) optimization model. We present the results of some preliminary experiments.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

DC Optimization in Adversarial Sparse Support Vector Machine

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Annabella Astorino,
  • Massimo Di Francesco,
  • Manlio Gaudioso,
  • Enrico Gorgone,
  • Benedetto Manca

摘要

In supervised classification models, such as Support Vector Machine, the main purpose is to predict the class membership of the incoming samples. In some real applications malicious inputs are inserted to mislead a vulnerable classifier, leading to a wrong prediction. In our work we focus first on the problem of introducing the smallest perturbation of a sample to induce incorrect classification and then on how to produce a significant downgrading of the classifier acting on a subset of the input samples. The novelty of the proposed approach is in the attempt of calculating sparse perturbations by minimizing the relative \(\ell _0\) -pseudo-norm, which gives rise to a Difference of Convex (DC) optimization model. We present the results of some preliminary experiments.