Deep SimNets
Not on the map. Why?
Abstract (arXiv)
We present a deep layered architecture that generalizes convolutional neural networks (ConvNets). The architecture, called SimNets, is driven by two operators: (i) a similarity function that generalizes inner-product, and (ii) a log-mean-exp function called MEX that generalizes maximum and average. The two operators applied in succession give rise to a standard neuron but in "feature space". The feature spaces realized by SimNets depend on the choice of the similarity operator. The simplest setting, which corresponds to a convolution, realizes the feature space of the Exponential kernel, while other settings realize feature spaces of more powerful kernels (Generalized Gaussian, which includes as special cases RBF and Laplacian), or even dynamically learned feature spaces (Generalized Multiple Kernel Learning). As a result, the SimNet contains a higher abstraction level compared to a traditional ConvNet. We argue that enhanced expressiveness is important when the networks are small due to run-time constraints (such as those imposed by mobile applications). Empirical evaluation validates the superior expressiveness of SimNets, showing a significant gain in accuracy over ConvNets when computational resources at run-time are limited. We also show that in large-scale settings, where computational complexity is less of a concern, the additional capacity of SimNets can be controlled with proper regularization, yielding accuracies comparable to state of the art ConvNets.
Key facts. Cited by 10 papers in the map (data through 13 Oct 2026). First posted on arXiv 9 Jun 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 3; 2023: 1; 2024: 1.
10 papers.
- 2021Implicit Regularization in Tensor Factorizationcited by 44
- 2021On Tilted Losses in Machine Learning: Theory and Applicationscited by 42
- 2022Implicit Regularization in Hierarchical Tensor Factorization and Deep Convolutional Neural Networkscited by 27
- 2022High-Order Pooling for Graph Neural Networks with Tensor Decompositioncited by 24
- 2022On the Ability of Graph Neural Networks to Model Interactions Between Verticescited by 12
- 2021Entangled q-Convolutional Neural Netscited by 4
- 2023What Makes Data Suitable for a Locally Connected Neural Network? A Necessary and Sufficient Condition Based on Quantum Entanglementcited by 4
- 2021LogAvgExp Provides a Principled and Performant Global Pooling Operatorcited by 2
- 2024Lecture Notes on Linear Neural Networks: A Tale of Optimization and Generalization in Deep Learningcited by 1
- 2021PowerLinear Activation Functions with application to the first layer of CNNscited by 0
- 2024Lecture Notes on Linear Neural Networks: A Tale of Optimization and Generalization in Deep Learning25 Aug 2024
- 2023What Makes Data Suitable for a Locally Connected Neural Network? A Necessary and Sufficient Condition Based on Quantum Entanglement20 Mar 2023
- 2022On the Ability of Graph Neural Networks to Model Interactions Between Vertices29 Nov 2022
- 2022High-Order Pooling for Graph Neural Networks with Tensor Decomposition24 May 2022
- 2022Implicit Regularization in Hierarchical Tensor Factorization and Deep Convolutional Neural Networks27 Jan 2022
- 2021LogAvgExp Provides a Principled and Performant Global Pooling Operator2 Nov 2021
- 2021On Tilted Losses in Machine Learning: Theory and Applications13 Sep 2021
- 2021PowerLinear Activation Functions with application to the first layer of CNNs20 Aug 2021
- 2021Entangled q-Convolutional Neural Nets6 Mar 2021
- 2021Implicit Regularization in Tensor Factorization19 Feb 2021