Hartley Spectral Pooling for Deep Learning

Abstract

In most convolution neural networks (CNNs), downsampling hidden layers is adopted for increasing computation efficiency and the receptive field size. Such operation is commonly called pooling. Maximization and averaging over sliding windows (max/average pooling), and plain downsampling in the form of strided convolu-tion are popular pooling methods. Since the pooling is a lossy procedure, a motivation of our work is to design a new pooling approach for less lossy in the dimensionality reduction. Inspired by the spectral pooling proposed by Rippel et al. [1], we present the Hartley transform based spectral pooling method. The proposed spectral pool-ing avoids the use of complex arithmetic for frequency representation, in comparison with Fourier pooling. The new approach preserves more structure features for net-work’s discriminability than max and average pooling. We empirically show the Hart-ley pooling gives rise to the convergence of training CNNs on MNIST and CIFAR-10 datasets.

Keywords

Hartley transform / spectral pooling / deep learning