paper-with-me

홈 › Papers

Primal Estimated Subgradient Solver for SVM for Imbalanced Classification

2022-06-19 · John Sun

We aim to demonstrate in experiments that our cost sensitive PEGASOS SVM achieves good performance on imbalanced data sets with a Majority to Minority Ratio ranging from 8.6:1 to 130:1 and to ascertain whether the including intercept (bias), regularization and parameters affects performance on our selection of datasets. Although many resort to SMOTE methods, we aim for a less computationally intensive method. We evaluate the performance by examining the learning curves. These curves diagnose whether we overfit or underfit or whether the random sample of data chosen during the process was not random enough or diverse enough in dependent variable class for the algorithm to generalized to unseen examples. We will also see the background of the hyperparameters versus the test and train error in validation curves. We benchmark our PEGASOS Cost-Sensitive SVM's results of Ding's LINEAR SVM DECIDL method. He obtained an ROC-AUC of .5 in one dataset. Our work will extend the work of Ding by incorporating kernels into SVM. We will use Python rather than MATLAB as python has dictionaries for storing mixed data types during multi-parameter cross-validation.

📄 PDF Abstract BibTeX arXiv:2206.09311

Code (0)

등록된 구현이 없습니다.

Tasks

Classificationimbalanced classification

Methods 이 논문이 사용한 방법론

Test 설명 없음
SMOTE Perhaps the most widely used approach to synthesizing new examples is called the Synthetic Minority Oversampling Technique, or SMOTE for short. This technique was described by…
SVM A Support Vector Machine, or SVM, is a non-parametric supervised learning model. For non-linear classification and regression, they utilise the kernel trick to map inputs…

Similar Papers 제목 키워드 기반

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization

2023-05-27 · Benjamin Grimmer, Danlin Li

We consider (stochastic) subgradient methods for strongly convex but potentially nonsmooth non-Lipschitz optimization. We provide new equivalent dual descriptions (in the style of dual averaging) for the classic subgradi…

Training Generative Adversarial Networks via Primal-Dual Subgradient Methods: A Lagrangian Perspective on GAN

2018-02-06 · ICLR 2018 1 · Xu Chen, Jiang Wang, Hao Ge

We relate the minimax game of generative adversarial networks (GANs) to finding the saddle points of the Lagrangian function for a convex optimization problem, where the discriminator outputs and the distribution of gene…

A Primal-Dual Subgradient Approachfor Fair Meta Learning

2020-09-26 · Chen Zhao, Feng Chen, Zhuoyi Wang, Latifur Khan

The problem of learning to generalize to unseen classes during training, known as few-shot classification, has attracted considerable attention. Initialization based methods, such as the gradient-based model agnostic met…

FairnessFew-Shot LearningMeta-Learning

Duality between subgradient and conditional gradient methods

2012-11-27 · Francis Bach

Given a convex optimization problem and its dual, there are many possible first-order algorithms. In this paper, we show the equivalence between mirror descent algorithms and algorithms generalizing the conditional gradi…

BIG-bench Machine Learning

Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization

2024-04-15 · Nachuan Xiao, Kuangyu Ding, Xiaoyin Hu, Kim-Chuan Toh

In this paper, we consider the minimization of a nonsmooth nonconvex objective function $f(x)$ over a closed convex subset $\mathcal{X}$ of $\mathbb{R}^n$, with additional nonsmooth nonconvex constraints $c(x) = 0$. We d…