Maximally Compact and Separated Features with Regular Polytope Networks

Federico Pernici, Matteo Bruni, Claudio Baecchi, Alberto Del Bimbo
1/15/2023
cs.CVcs.LG

No official code found. Best implementation: matteo-bruni/regular-polytope-networks (8 stars, MIT, last commit 2022-02-17).

Abstract

Convolutional Neural Networks (CNNs) trained with the Softmax loss are widely used classification models for several vision tasks. Typically, a learnable transformation (i.e. the classifier) is placed at the end of such models returning class scores that are further normalized into probabilities by Softmax. This learnable transformation has a fundamental role in determining the network internal feature representation. In this work we show how to extract from CNNs features with the properties of \emph{maximum} inter-class separability and \emph{maximum} intra-class compactness by setting the parameters of the classifier transformation as not trainable (i.e. fixed). We obtain features similar to what can be obtained with the well-known ``Center Loss'' \cite{wen2016discriminative} and other similar approaches but with several practical advantages including maximal exploitation of the available feature space representation, reduction in the number of network parameters, no need to use other auxiliary losses besides the Softmax. Our approach unifies and generalizes into a common approach two apparently different classes of methods regarding: discriminative features, pioneered by the Center Loss \cite{wen2016discriminative} and fixed classifiers, firstly evaluated in \cite{hoffer2018fix}. Preliminary qualitative experimental results provide some insight on the potentialities of our combined strategy.

View on arXivView PDF

Code Implementations(1)

MIT

PyTorch code for the paper "Regular Polytope Networks" (TNNLS-2021)

81Shell, PythonNov 30, 20214 years agoMIT

Similar Papers

Cite this paper

@article{pernici2023maximally,
  title  = {Maximally Compact and Separated Features with Regular Polytope Networks},
  author = {Federico Pernici and Matteo Bruni and Claudio Baecchi and Alberto Del Bimbo},
  year   = {2023},
  eprint = {2301.06116},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.06116v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.06116.svg)](https://codeofpaper.com/paper/2301.06116)

Discussion