Elite-Driven Support Vector Machines for Classification

• URL: http://arxiv.org/abs/2604.25158v1
• Date: Tue, 28 Apr 2026 02:58:55 GMT
• Title: Elite-Driven Support Vector Machines for Classification
• Abstract summary: Support vector machines (SVMs) are a standard tool for binary classification, but their classical formulations are purely data-driven.<n>We propose a framework that augments regularized empirical risk minimization by guiding the slack variables for a curated set of elite observations.<n>We show that EDSVMs closely track the behaviour induced by reference SVMs while achieving predictive performance that is competitive with, and sometimes better than, C-SVM, LINEX-SVM, and LS-SVM.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Support vector machines (SVMs) are a standard tool for binary classification, but their classical formulations are purely data-driven and offer no direct way to encode trusted benchmark models or structured preferences on selected subsets of the data. We propose Elite-Driven Support Vector Machines (EDSVM), a general framework that augments regularized empirical risk minimization by guiding the slack variables for a curated set of elite observations (typically the union of support vectors from one or more reference SVMs). EDSVM combines the usual slack loss with a deviation penalty that shrinks new slacks toward benchmark slack values, defining a localized, margin-aligned notion of proximity to reference models, unlike global function penalties in knowledge distillation or teacher-student methods, and without requiring privileged features as in SVM+/LUPI. Within this framework we develop two concrete models, C-EDSVM and LS-EDSVM, based respectively on hinge-type and squared-slack losses. For both variants we derive dual quadratic programs that can be implemented with modest modifications of standard SVM solvers, and we give simple sufficient conditions under which the induced margin losses are classification calibrated. Simulation studies and experiments on several UCI benchmarks show that EDSVMs closely track the behaviour induced by reference SVMs while achieving predictive performance that is competitive with, and sometimes better than, C-SVM, LINEX-SVM, and LS-SVM.

Related papers

• Multiclass Linear Perceptrons with Multiplicative Margins [6.287122221944358]
  We introduce a family of multiclass linear Perceptron classifiers with a multiplicative margin mechanism (MMPerc)<n>MMPerc enforces classification confidence by requiring the true class score to exceed that of competing classes by a specified fraction of itself.<n>Experiments on synthetic and real datasets show that MMPerc classifiers typically outperform the standard Perceptron.
  arXiv  Detail & Related papers  (2026-08-30T20:32:04Z)
• Calibratable Disambiguation Loss for Multi-Instance Partial-Label Learning [53.9713678229744]
  Multi-instance partial-label learning (MIPL) is a weakly supervised framework that addresses the challenges of inexact supervision in both instance and label spaces.<n>Existing MIPL approaches often suffer from poor calibration, undermining reliability.<n>We propose a plug-and-play calibratable disambiguation loss (CDL) that simultaneously improves classification accuracy and calibration performance.
  arXiv  Detail & Related papers  (2025-12-19T16:58:31Z)
• SoliReward: Mitigating Susceptibility to Reward Hacking and Annotation Noise in Video Generation Reward Models [53.19726629537694]
  Post-training alignment of video generation models with human preferences is a critical goal.<n>Current data collection paradigms, reliant on in-prompt pairwise annotations, suffer from labeling noise.<n>We propose SoliReward, a systematic framework for video RM training.
  arXiv  Detail & Related papers  (2025-12-17T14:28:23Z)
• Multi-Class Support Vector Machine with Differential Privacy [12.305474267080966]
  differential privacy is one of the major frameworks to build privacy-preserving machine learning models.<n>Applying DP to multi-class SVMs is inadequate, as the standard one-versus-rest (OvR) and one-versus-one (OvO) approaches repeatedly query each data sample.<n>We propose a novel differentially Private Multi-class SVM (PMSVM) with weight and gradient perturbation methods to ensure DP in all-in-one SVMs.
  arXiv  Detail & Related papers  (2025-10-05T04:25:16Z)
• Dual-Stage Reweighted MoE for Long-Tailed Egocentric Mistake Detection [85.0189917888094]
  We propose a Dual-Stage Reweighted Mixture-of-Experts (DR-MoE) framework to handle the challenges posed by subtle and infrequent mistakes.<n>The proposed method achieves strong performance, particularly in identifying rare and ambiguous mistake instances.
  arXiv  Detail & Related papers  (2025-09-16T12:00:42Z)
• Robust Support Vector Machines for Imbalanced and Noisy Data via Benders Decomposition [0.0]
  This study introduces a novel formulation to enhance Support Vector Machines (SVMs) in handling class imbalance and noise.<n>Unlike the conventional Soft Margin SVM, which penalizes the magnitude of constraint violations, the proposed model quantifies the number of violations and aims to minimize their frequency.
  arXiv  Detail & Related papers  (2025-03-19T04:03:39Z)
• Enhancing Imbalance Learning: A Novel Slack-Factor Fuzzy SVM Approach [0.0]
  Support vector machines (FSVMs) address class imbalance by assigning varying fuzzy memberships to samples. The recently developed slack-factor-based FSVM (SFFSVM) improves traditional FSVMs by using slack factors to adjust fuzzy memberships based on misclassification likelihood. We propose an improved slack-factor-based FSVM (ISFFSVM) that introduces a novel location parameter.
  arXiv  Detail & Related papers  (2024-11-26T05:47:01Z)
• A Safe Screening Rule with Bi-level Optimization of $\ u$ Support Vector Machine [15.096652880354199]
  We propose a safe screening rule with bi-level optimization for $nu$-SVM. Our SRBO-$nu$-SVM is strictly deduced by integrating the Karush-Kuhn-Tucker conditions. We also develop an efficient dual coordinate descent method (DCDM) to further improve computational speed.
  arXiv  Detail & Related papers  (2024-03-04T06:55:57Z)
• A Robust Twin Parametric Margin Support Vector Machine for Multiclass Classification [0.0]
  We introduce novel Twin Parametric Margin Support Vector Machine (TPMSVM) models designed to address multiclass classification tasks under feature uncertainty.<n>To handle data perturbations, we construct bounded-by-norm uncertainty set around each training observation and derive the robust counterparts of the deterministic models.<n>We validate the effectiveness of the proposed robust multiclass TPMSVM methodology on real-world datasets.
  arXiv  Detail & Related papers  (2023-06-09T19:27:24Z)
• Handling Imbalanced Classification Problems With Support Vector Machines via Evolutionary Bilevel Optimization [73.17488635491262]
  Support vector machines (SVMs) are popular learning algorithms to deal with binary classification problems. This article introduces EBCS-SVM: evolutionary bilevel cost-sensitive SVMs.
  arXiv  Detail & Related papers  (2022-04-21T16:08:44Z)
• Self-Supervised Class Incremental Learning [51.62542103481908]
  Existing Class Incremental Learning (CIL) methods are based on a supervised classification framework sensitive to data labels. When updating them based on the new class data, they suffer from catastrophic forgetting: the model cannot discern old class data clearly from the new. In this paper, we explore the performance of Self-Supervised representation learning in Class Incremental Learning (SSCIL) for the first time.
  arXiv  Detail & Related papers  (2021-11-18T06:58:19Z)
• Chance constrained conic-segmentation support vector machine with uncertain data [0.0]
  Support vector machines (SVM) is one of the well known supervised classes of learning algorithms. This paper studies CS-SVM when the data points are uncertain or mislabelled.
  arXiv  Detail & Related papers  (2021-07-28T12:29:47Z)
• Estimating Average Treatment Effects with Support Vector Machines [77.34726150561087]
  Support vector machine (SVM) is one of the most popular classification algorithms in the machine learning literature. We adapt SVM as a kernel-based weighting procedure that minimizes the maximum mean discrepancy between the treatment and control groups. We characterize the bias of causal effect estimation arising from this trade-off, connecting the proposed SVM procedure to the existing kernel balancing methods.
  arXiv  Detail & Related papers  (2021-02-23T20:22:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.