paper-with-me

홈 › Papers

HASeparator: Hyperplane-Assisted Softmax

2020-08-08 · Ioannis Kansizoglou, Nicholas Santavas, Loukas Bampis, Antonios Gasteratos

Efficient feature learning with Convolutional Neural Networks (CNNs) constitutes an increasingly imperative property since several challenging tasks of computer vision tend to require cascade schemes and modalities fusion. Feature learning aims at CNN models capable of extracting embeddings, exhibiting high discrimination among the different classes, as well as intra-class compactness. In this paper, a novel approach is introduced that has separator, which focuses on an effective hyperplane-based segregation of the classes instead of the common class centers separation scheme. Accordingly, an innovatory separator, namely the Hyperplane-Assisted Softmax separator (HASeparator), is proposed that demonstrates superior discrimination capabilities, as evaluated on popular image classification benchmarks.

📄 PDF Abstract BibTeX arXiv:2008.03539

Code (0)

등록된 구현이 없습니다.

Tasks

image-classificationImage Classification

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…

Similar Papers 제목 키워드 기반

Softmax Tree: An Accurate, Fast Classifier When the Number of Classes Is Large

2021-11-01 · EMNLP 2021 11 · Arman Zharmagambetov, Magzhan Gabidolla, Miguel A. Carreira-Perpinan

Classification problems having thousands or more classes naturally occur in NLP, for example language models or document classification. A softmax or one-vs-all classifier naturally handles many classes, but it is very s…

Document Classification

Geometric Mixture Classifier (GMC): A Discriminative Per-Class Mixture of Hyperplanes

2025-09-20 · Prasanth K K, Shubham Sharma arxiv

Many real world categories are multimodal, with single classes occupying disjoint regions in feature space. Classical linear models (logistic regression, linear SVM) use a single global hyperplane and perform poorly on s…

Hyperplane Clustering Via Dual Principal Component Pursuit

2017-06-06 · ICML 2017 8 · Manolis C. Tsakiris, Rene Vidal

We extend the theoretical analysis of a recently proposed single subspace learning algorithm, called Dual Principal Component Pursuit (DPCP), to the case where the data are drawn from of a union of hyperplanes. To gain i…

Clustering

Switchable K-Class Hyperplanes for Noise-Robust Representation Learning

2021-01-01 · ICCV 2021 10 · Boxiao Liu, Guanglu Song, Manyuan Zhang, Haihang You 외

Optimizing the K-class hyperplanes in the latent space has become the standard paradigm for efficient representation learning. However, it's almost impossible to find an optimal K-class hyperplane to accurately descr…

Model OptimizationRepresentation Learningvalid

Least Restrictive Hyperplane Control Barrier Functions

2025-10-21 · Mattias Trende, Petter Ögren arxiv

Control Barrier Functions (CBFs) can provide provable safety guarantees for dynamic systems. However, finding a valid CBF for a system of interest is often non-trivial, especially for systems having low computational res…