mlsanityData to 7 Oct 2026

Kernel function impact on convolutional neural networks

arXiv 2302.10266 ↗First posted 20 Feb 2023cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

This paper investigates the usage of kernel functions at the different layers in a convolutional neural network. We carry out extensive studies of their impact on convolutional, pooling and fully-connected layers. We notice that the linear kernel may not be sufficiently effective to fit the input data distributions, whereas high order kernels prone to over-fitting. This leads to conclude that a trade-off between complexity and performance should be reached. We show how one can effectively leverage kernel functions, by introducing a more distortion aware pooling layers which reduces over-fitting while keeping track of the majority of the information fed into subsequent layers. We further propose Kernelized Dense Layers (KDL), which replace fully-connected layers, and capture higher order feature interactions. The experiments on conventional classification datasets i.e. MNIST, FASHION-MNIST and CIFAR-10, show that the proposed techniques improve the performance of the network compared to classical convolution, pooling and fully connected layers. Moreover, experiments on fine-grained classification i.e. facial expression databases, namely RAF-DB, FER2013 and ExpW demonstrate that the discriminative power of the network is boosted, since the proposed techniques improve the awareness to slight visual details and allows the network reaching state-of-the-art results.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 27 of its 55 references that are in the map. First posted on arXiv 20 Feb 2023.

Builds on

27 of 55 references.

References · 27

  1. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  2. 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
  3. 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,061
  4. 2017Self-Normalizing Neural Networkscited by 591
  5. 2013Challenges in Representation Learning: A report on three machine learning contestscited by 301
  6. 2015Bilinear CNNs for Fine-grained Visual Recognitioncited by 228
  7. 2020Fine-grained Video-Text Retrieval with Hierarchical Graph Reasoningcited by 180
  8. 2020TResNet: High Performance GPU-Dedicated Architecturecited by 119
  9. 2015Compact Bilinear Poolingcited by 97
  10. 2020Learning Attentive Pairwise Interaction for Fine-Grained Classificationcited by 84
  11. 2020Interpretable and Accurate Fine-grained Recognition via Region Groupingcited by 75
  12. 2018Global Second-order Pooling Convolutional Networkscited by 66
15 more
  1. 2016From Facial Expression Recognition to Interpersonal Relation Predictioncited by 53
  2. 2019Attention Convolutional Binary Neural Tree for Fine-Grained Visual Categorizationcited by 51
  3. 2020Channel Interaction Networks for Fine-Grained Image Categorizationcited by 47
  4. 2013Deep Learning using Linear Support Vector Machinescited by 39
  5. 2017Non-linear Convolution Filters for CNN-based Learningcited by 38
  6. 2018Covariance Pooling For Facial Expression Recognitioncited by 37
  7. 2020Revisiting Pose-Normalization for Fine-Grained Few-Shot Recognitioncited by 30
  8. 2017Improved Bilinear Pooling with CNNscited by 29
  9. 2019Kervolutional Neural Networkscited by 20
  10. 2018SchiNet: Automatic Estimation of Symptoms of Schizophrenia from Facial Behaviour Analysiscited by 16
  11. 2019TextCaps : Handwritten Character Recognition with Very Small Datasetscited by 9
  12. 2019Expression Analysis Based on Face Regions in Read-world Conditionscited by 7
  13. 2020Stochastic Optimization of Plain Convolutional Neural Networks with Simple methodscited by 7
  14. 2020Kernelized dense layers for facial expression recognitioncited by 7
  15. 2019Universal Pooling -- A New Pooling Method for Convolutional Neural Networkscited by 5

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.