Gaussian Mixture Convolution Networks
Adam Celarek, Pedro Hermosilla, Bernhard Kerbl, Timo Ropinski, Michael, Wimmer

TL;DR
This paper introduces Gaussian Mixture Convolution Networks, a deep learning architecture that uses Gaussian mixtures for data representation and convolution, avoiding the curse of dimensionality and enabling compact, detail-preserving models.
Contribution
The paper presents a novel convolutional network architecture using Gaussian mixtures for kernels and data, with a new fitting approach for nonlinear activation functions.
Findings
Achieves competitive accuracy on MNIST and ModelNet datasets.
Avoids curse of dimensionality with Gaussian mixture representations.
Provides a compact and detail-preserving data representation.
Abstract
This paper proposes a novel method for deep learning based on the analytical convolution of multidimensional Gaussian mixtures. In contrast to tensors, these do not suffer from the curse of dimensionality and allow for a compact representation, as data is only stored where details exist. Convolution kernels and data are Gaussian mixtures with unconstrained weights, positions, and covariance matrices. Similar to discrete convolutional networks, each convolution step produces several feature channels, represented by independent Gaussian mixtures. Since traditional transfer functions like ReLUs do not produce Gaussian mixtures, we propose using a fitting of these functions instead. This fitting step also acts as a pooling layer if the number of Gaussian components is reduced appropriately. We demonstrate that networks based on this architecture reach competitive accuracy on Gaussian…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Time Series Analysis and Forecasting · Human Pose and Action Recognition
MethodsConvolution
