paper-with-me

홈 › Papers

RBF-Softmax: Learning Deep Representative Prototypes with Radial Basis Function Softmax

2020-08-01 · ECCV 2020 8 · Xiao Zhang, Rui Zhao, Yu Qiao, Hongsheng Li

Deep neural networks have achieved remarkable successes in learning feature representations for visual classification. However, deep features learned by the softmax cross-entropy loss generally show excessive intra-class variations. We argue that, because the traditional softmax losses aim to optimize only the relative differences between intra-class and inter-class distances (logits), it cannot obtain representative class prototypes (class weights/centers) to regularize intra-class distances, even when the training is converged. Previous efforts mitigate this problem by introducing auxiliary regularization losses. But these modified losses mainly focus on optimizing intra-class compactness, while ignoring keeping reasonable relations between different class prototypes. These lead to weak models and eventually limit their performance. To address this problem, this paper introduces a novel Radial Basis Function (RBF) distances to replace the commonly used inner products in the softmax loss function, such that it can adaptively assign losses to regularize the intra-class and inter-class distances by reshaping the relative differences, and thus creating more representative prototypes of classes to improve optimization. The proposed RBF-Softmax loss function not only effectively reduces intra-class distances, stabilizes the training behavior, and reserves ideal relations between prototypes, but also significantly improves the testing performance. Experiments on visual recognition benchmarks including MNIST, CIFAR-10/100, and ImageNet demonstrate that the proposed RBF-Softmax achieves better results than cross-entropy and other state-of-the-art classification losses. The code is at https://github.com/2han9x1a0release/RBF-Softmax.

📄 PDF Abstract BibTeX

Code (1)

2han9x1a0release/RBF-Softmax 공식 구현 pytorch

Similar Papers 제목 키워드 기반

An Exact Reformulation of Feature-Vector-based Radial-Basis-Function Networks for Graph-based Observations

2019-01-22 · Isaac J. Sledge, Jose C. Principe

Radial-basis-function networks are traditionally defined for sets of vector-based observations. In this short paper, we reformulate such networks so that they can be applied to adjacency-matrix representations of weighte…

Nearest Neighbour Radial Basis Function Solvers for Deep Neural Networks

2018-01-01 · ICLR 2018 1 · Benjamin J. Meyer, Ben Harwood, Tom Drummond

We present a radial basis function solver for convolutional neural networks that can be directly applied to both distance metric learning and classification problems. Our method treats all training features from a deep n…

ClassificationGeneral ClassificationMetric Learning

Kolmogorov-Arnold Networks are Radial Basis Function Networks

2024-05-10 · Ziyao Li

This short paper is a fast proof-of-concept that the 3-order B-splines used in Kolmogorov-Arnold Networks (KANs) can be well approximated by Gaussian radial basis functions. Doing so leads to FastKAN, a much faster imple…

Kolmogorov-Arnold Networks

Region-Based Classification of PolSAR Data Using Radial Basis Kernel Functions With Stochastic Distances

2018-05-07 · R. G. Negri, A. C. Frery, W. B. Silva, T. S. G. Mendes 외

Region-based classification of PolSAR data can be effectively performed by seeking for the assignment that minimizes a distance between prototypes and segments. Silva et al (2013) used stochastic distances between comple…

General Classification

K-Means as a Radial Basis function Network: a Variational and Gradient-based Equivalence

2026-03-04 · Felipe de Jesus Felix Arredondo, Alejandro Ucan-Puc, Carlos Astengo Noguez arxiv

This work establishes a rigorous variational and gradient-based equivalence between the classical K-Means algorithm and differentiable Radial Basis Function (RBF) neural networks with smooth responsibilities. By reparame…