Nonlinear classifiers for ranking problems based on kernelized SVM

• URL: http://arxiv.org/abs/2002.11436v2
• Date: Mon, 27 Mar 2023 18:48:56 GMT
• Title: Nonlinear classifiers for ranking problems based on kernelized SVM
• Authors: V\'aclav M\'acha, Luk\'a\v{s} Adam, V\'aclav \v{S}m\'idl
• Abstract summary: Many classification problems focus on maximizing the performance only on the samples with the highest relevance instead of all samples. In this paper, we derive a general framework including several classes of these linear classification problems. We dualize the problems, add kernels and propose a componentwise dual ascent method.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many classification problems focus on maximizing the performance only on the samples with the highest relevance instead of all samples. As an example, we can mention ranking problems, accuracy at the top or search engines where only the top few queries matter. In our previous work, we derived a general framework including several classes of these linear classification problems. In this paper, we extend the framework to nonlinear classifiers. Utilizing a similarity to SVM, we dualize the problems, add kernels and propose a componentwise dual ascent method.

Related papers

• A Multi-Class SWAP-Test Classifier [0.0]
  This work presents the first multi-class SWAP-Test classifier inspired by its binary predecessor and the use of label states in recent work. In contrast to previous work, the number of qubits required, the measurement strategy, and the topology of the circuits used is invariant to the number of classes. Both analytical results and numerical simulations show that this classifier is not only effective when applied to diverse classification problems but also robust to certain conditions of noise.
  arXiv  Detail & Related papers  (2023-02-06T18:31:43Z)
• Parametric Classification for Generalized Category Discovery: A Baseline Study [70.73212959385387]
  Generalized Category Discovery (GCD) aims to discover novel categories in unlabelled datasets using knowledge learned from labelled samples. We investigate the failure of parametric classifiers, verify the effectiveness of previous design choices when high-quality supervision is available, and identify unreliable pseudo-labels as a key problem. We propose a simple yet effective parametric classification method that benefits from entropy regularisation, achieves state-of-the-art performance on multiple GCD benchmarks and shows strong robustness to unknown class numbers.
  arXiv  Detail & Related papers  (2022-11-21T18:47:11Z)
• Multi-Label Quantification [78.83284164605473]
  Quantification, variously called "labelled prevalence estimation" or "learning to quantify", is the supervised learning task of generating predictors of the relative frequencies of the classes of interest in unsupervised data samples. We propose methods for inferring estimators of class prevalence values that strive to leverage the dependencies among the classes of interest in order to predict their relative frequencies more accurately.
  arXiv  Detail & Related papers  (2022-11-15T11:29:59Z)
• Review of Methods for Handling Class-Imbalanced in Classification Problems [0.0]
  In some cases, one class contains the majority of examples while the other, which is frequently the more important class, is nevertheless represented by a smaller proportion of examples. The article examines the most widely used methods for addressing the problem of learning with a class imbalance, including data-level, algorithm-level, hybrid, cost-sensitive learning, and deep learning.
  arXiv  Detail & Related papers  (2022-11-10T10:07:10Z)
• Generalization for multiclass classification with overparameterized linear models [3.3434274586532515]
  We show that multiclass classification behaves like binary classification in that, as long as there are not too many classes, it is possible to generalize well. Besides various technical challenges, it turns out that the key difference from the binary classification setting is that there are relatively fewer positive training examples of each class in the multiclass setting as the number of classes increases.
  arXiv  Detail & Related papers  (2022-06-03T05:52:43Z)
• 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)
• Theoretical Insights Into Multiclass Classification: A High-dimensional Asymptotic View [82.80085730891126]
  We provide the first modernally precise analysis of linear multiclass classification. Our analysis reveals that the classification accuracy is highly distribution-dependent. The insights gained may pave the way for a precise understanding of other classification algorithms.
  arXiv  Detail & Related papers  (2020-11-16T05:17:29Z)
• Prior Guided Feature Enrichment Network for Few-Shot Segmentation [64.91560451900125]
  State-of-the-art semantic segmentation methods require sufficient labeled data to achieve good results. Few-shot segmentation is proposed to tackle this problem by learning a model that quickly adapts to new classes with a few labeled support samples. Theses frameworks still face the challenge of generalization ability reduction on unseen classes due to inappropriate use of high-level semantic information.
  arXiv  Detail & Related papers  (2020-08-04T10:41:32Z)
• Many-Class Few-Shot Learning on Multi-Granularity Class Hierarchy [57.68486382473194]
  We study many-class few-shot (MCFS) problem in both supervised learning and meta-learning settings. In this paper, we leverage the class hierarchy as a prior knowledge to train a coarse-to-fine classifier. The model, "memory-augmented hierarchical-classification network (MahiNet)", performs coarse-to-fine classification where each coarse class can cover multiple fine classes.
  arXiv  Detail & Related papers  (2020-06-28T01:11:34Z)
• A novel embedded min-max approach for feature selection in nonlinear support vector machine classification [0.0]
  We propose an embedded feature selection method based on a min-max optimization problem. By leveraging duality theory, we equivalently reformulate the min-max problem and solve it without further ado. The efficiency and usefulness of our approach are tested on several benchmark data sets.
  arXiv  Detail & Related papers  (2020-04-21T09:40:38Z)
• A Unified Framework for Multiclass and Multilabel Support Vector Machines [6.425654442936364]
  We propose a straightforward extension to the SVM to cope with multiclass and multilabel classification problems. Our framework deviates from the conventional soft margin SVM framework with its direct oppositional structure. Results demonstrate a competitive classifier for both multiclass and multilabel classification problems.
  arXiv  Detail & Related papers  (2020-03-25T03:08:41Z)

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.