summaries: This paper proposed "F pooling" for Frequency Pooling, which is a pooling operation satisfying shift equivalence and anti-aliasing properties. The method is very simple: first, transform the input 1D/2D signal into the spectrum domain based on discrete Fourier transform (DFT), then cut the high-frequencies, then transform back to the time domain using the inverse DFT. The method can be implemented using FFT and auto differentiation frameworks. The method is tested on Resnet/Desnet on CIFAR-100 and subsets of ImageNet, showing better performance than the original models. This paper researches the pooling operation, which is an important component in convolutional neural networks (CNN) for image classification. Taking the perspective from signal processing, this paper proposes a pooling operation called frequency pooling (F-pooling). The key motivation is to make the pooling operation shift-equivalent and anti-aliasing. This paper gives an improved definition on shift-equivalent functions and shows that the proposed F-pooling is optimal in the sense of reconstructing the orignal signal. The F-pooling is then implemented with matrix multiplications and tested with recent convolutional neural networks for image classifiation on CIFAR-100 and a subset of ImageNet dataset. 
abstractText: Convolutional layer utilizes the shift-equivalent prior of images which makes it a great success for image processing. However, commonly used down sampling methods in convolutional neural networks (CNNs), such as max-pooling, averagepooling, and stride convolution, are not shift-equivalent. This destroys the shiftequivalent property of CNNs and degrades their performance. In this paper, we provide a formal definition of shift-equivalent when down sampling involved. We propose a strict shift equivalent and anti-aliasing pooling method. This is achieved by (inverse) Discrete Fourier Transform and we call our method frequency pooling. Experiments on image classifications show that frequency pooling improves accuracy and robustness w.r.t shifts of CNNs.
references.authors: Md Faijul Amin Kazuyuki Murase
references.title: Single-layered complex-valued neural network for realvalued classification
references.venue: problems. Neurocomputing,
references.authors: Aharon Azulay Yair Weiss
references.title: Why do deep convolutional networks generalize so poorly to small image transformations
references.venue: arXiv preprint arXiv:1805.12177,
references.authors: Taco S. Cohen Mario Geiger Jonas Khler Max Welling
references.title: Spherical CNNs
references.venue: In International Conference on Learning Representations,
references.authors: Logan Engstrom Brandon Tran Dimitris Tsipras Ludwig Schmidt Aleksander Madry
references.title: A rotation and a translation suffice: Fooling cnns with simple transformations
references.venue: arXiv preprint arXiv:1712.02779,
references.authors: Benjamin Graham
references.title: Fractional max-pooling
references.venue: arXiv preprint arXiv:1412.6071,
references.authors: Kaiming He Xiangyu Zhang Shaoqing Ren Jian Sun
references.title: Spatial pyramid pooling in deep convolutional networks for visual recognition
references.venue: IEEE Transactions on Pattern Analysis and Machine Intelligence,
references.authors: Kaiming He Xiangyu Zhang Shaoqing Ren Jian Sun
references.title: Deep residual learning for image recognition
references.venue: In Proceedings of the IEEE conference on computer vision and pattern recognition,
references.authors: Gao Huang Zhuang Liu Laurens Van Der Maaten Kilian Q Weinberger
references.title: Densely connected convolutional networks
references.venue: In Proceedings of the IEEE conference on computer vision and pattern recognition,
references.authors: Yann Lecun Bernhard E Boser John S Denker D Henderson R E Howard W Hubbard L D Jackel
references.title: Handwritten digit recognition with a back-propagation network
references.authors: Chenyu Lee Patrick W Gallagher Zhuowen Tu
references.title: Generalizing pooling functions in convolutional neural networks: Mixed
references.venue: gated, and tree
references.authors: Jonathan Long Evan Shelhamer Trevor Darrell
references.title: Fully convolutional networks for semantic segmentation
references.authors: Volodymyr Mnih Koray Kavukcuoglu David Silver Alex Graves Ioannis Antonoglou Daan Wierstra Martin Riedmiller
references.title: Playing atari with deep reinforcement learning
references.venue: Computer Science,
references.authors: Harry Nyquist
references.title: Certain topics in telegraph transmission theory
references.venue: Transactions of The American Institute of Electrical Engineers,
references.authors: Adam Paszke Sam Gross Soumith Chintala Gregory Chanan Edward Yang Zachary DeVito Zeming Lin Alban Desmaison Luca Antiga Adam Lerer
references.title: Automatic differentiation in pytorch
references.authors: Antti Rasmus Harri Valpola Mikko Honkala Mathias Berglund Tapani Raiko
references.title: Semisupervised learning with ladder networks
references.authors: Jongbin Ryu Minghsuan Yang Jongwoo Lim
references.title: Dft-based transformation invariant pooling layer for visual classification
references.authors: Mark Sandler Andrew Howard Menglong Zhu Andrey Zhmoginov Liang-Chieh Chen
references.title: Mobilenetv2: Inverted residuals and linear bottlenecks
references.venue: In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition,
references.authors: Dominik Scherer Andreas Muller Sven Behnke
references.title: Evaluation of pooling operations in convolutional architectures for object recognition
references.authors: Chiheb Trabelsi Olexa Bilaniuk Ying Zhang Dmitriy Serdyuk Sandeep Subramanian Joao Felipe Santos Soroush Mehri Negar Rostamzadeh Yoshua Bengio Christopher J Pal
references.title: Deep complex networks
references.venue: In International Conference on Learning Representations,
references.authors: Travis Williams Robert Li
references.title: Wavelet pooling for convolutional neural networks
references.venue: In International Conference on Learning Representations,
references.authors: Wenpeng Yin Katharina Kann Mo Yu Hinrich Schutze
references.title: Comparative study of cnn and rnn for natural language processing
references.venue: arXiv: Computation and Language,
references.authors: Richard Zhang
references.title: Making convolutional networks shift-invariant again
references.venue: arXiv preprint arXiv:1904.11486,
sections.heading: 1 INTRODUCTION
sections.text: Convolutional neural networks (CNNs) have achieved great success on image processing Goodfellow et al. (2016), natural language processing Yin et al. (2017), game playing Mnih et al. (2013) and so on. One of the reasons is that convolutions utilize the shift-equivalent prior of signals. Modern CNNs include not only convolutional layers but also down sampling or pooling layers. As an important part of CNNs, pooling layers are used to reduce spatial resolution of feature maps, aggregate spatial information, and reduce computational and memory cost.
  Based on classical Nyquist sampling theorem Nyquist (1928), the sampling rate must be at least as twice as the highest frequency of a signal. Otherwise, frequency aliasing will appear, i.e. highfrequencies of the signal alias into low-frequencies. This leads sub-optimal when reconstruction the signals and misleads the following processing because orthogonal components are mixed again. To anti-alias, a traditional solution is that applying low-pass filter to the signal before down sampling it. Following the spirit of blurred down sampling, early CNNs use average pooling to achieve down sampling Lecun et al. (1989). Later, empirical evidence suggests max-pooling Scherer et al. (2010) and stride convolutions Long et al. (2015) provide better performance. They are widely used in CNNs but they don’t consider about anti-aliasing.
  Shift-equivalent is another expected property of pooling. Otherwise it will destroy the shiftequivalent of CNNs and thus the shift-equivalent prior of signals is not fully utilized. Unfortunately, most commonly used poolings are not shift-equivalent. Worse, small shifts in the input can drastically change the output when stacking multiple max-pooling or stride convolutions Engstrom et al. (2017); Azulay & Weiss (2018); Zhang (2019).
  Shift-equivalent is believed to be a fundamental property of CNNs. However, the fact that CNNs with poolings are not shift-equivalent has been ignored by the community. Until recently, Zhang (2019) propose anti-aliasing pooling (AA-pooling) by low-pass filtering before down sampling. They observe increased accuracy and better generalization on image classification when low-pass filtering is integrated correctly. Specifically, they decompose a pooling operator with down sampling factor s into two parts: a pooling operator with factor 1 and a blur filter with factor s. Although AApooling reduces the aliasing effects and makes the outputs more stable w.r.t input shifts, it is neither strict shift-equivalent nor anti-aliasing in theory.
  In this paper, we propose a strict shift equivalent and anti-aliasing pooling in theory. We first transform a signal or image into frequency domain via Discrete Fourier Transform (DFT). Then we only retain its low frequencies, i.e. the frequencies which are smaller than Nyquist sampling
  rate. Finally, we transform the low frequencies back into time domain via inverse DFT. We call our method frequency pooling (F-pooling). Note that a similar method is proposed in Ryu et al. (2018). However, they only focus on classification accuracy. Shift equivalent of their method is not evaluated in both theory and practice. Compared with previous works, the novelties and contributions of Fpooling are summarized as follows:
  • We formally define shift-equivalent of functions which contain down sampling operations. A suitable up sampling operation U must be involved in the definition. Without it, the definition for discrete signal is ill-posed. We believe a formal mathematical treatment has great value for further research.
  • We prove that F-pooling is the optimal anti-aliasing down sampling operation from the perspective of reconstruction. We also prove that F-pooling is shift equivalent. The up sampling operation U plays an important rule in our proofs. To best of our knowledge, F-pooling is the first pooling method which has those properties.
  • Experiments on CIFAR-100 and a subset of ImageNet demonstrate that F-pooling remarkably increases accuracy and robustness w.r.t shifts of commonly-used network architectures. Moreover, the shift consistency of F-pooling is improved more when we replace zero padding of convolutions with circular padding.
sections.heading: 2 METHOD
sections.text: In this section, we first define shift-equivalent for CNNs formally. Then we describe F-pooling in detail and prove its properties. Finally we discuss our implementation and some practical issues.
sections.heading: 2.1 DEFINITION OF SHIFT-EQUIVALENT
sections.text: Denote X as an h0 × w0 × c tensor where h0, w0, and c are the height, width, and number of channels of X respectively. Denote Y as an h1×w1× c tensor. We suppose h0 > h1 and w0 > w1. M : X → Y is a pooling operation and U : Y → X is a up sampling operation. We say M is shift-equivalent if and only if
  Shift4h,4w(UMX) =UMShift4h,4w(X) (1) ∀(4h,4w), ∃U
  That is, if there is a suitable up sampling operation U which makes UM and Shift4h,4w commutable, thenM is shift-equivalent. The shift operation is required to be circular or periodic. When a shifted element hits the edge, it rolls to other side.
  Shift4h,4w(Xa,b) = X(a+4h)%h0,(b+4w)%w0 (2)
  where % is the modulus function. Our definition of shift-equivalent is similar with the one in Zhang (2019). The difference is that we introduce an up sampling U to make this definition strict. Without
  introducing U , the definition of shift-equivalent for pooling is ill-posed. SupposeM down samples signals by a factor s. Without introducing U , one may define shift-equivalent as follows:
  Shift4h/s,4w/s · M(X) =M · Shift4h,4w(X), ∀(4h,4w) (3) However, Shift4h/s,4w/s is not operable for discrete signals when 4h%s 6= 0 or 4h%s 6= 0. To make the shifted element which is not on lattice operable, one must interpolate or up sample the down sampled signals. This leads to the definition in equation 1.
  As in equation 1, to makeM shift-equivalent, one must find the corresponding up sampling operation U . For a givenM, the first line in equation 1 may hold for some up sampling operations. But it may not hold for other up sampling operations.
sections.heading: 2.2 F-POOLING
sections.text: The basic idea of F-pooling is removing the high frequencies of signals and reconstructing the signals only using the low frequencies. In this paper, high frequencies mean the frequencies which are beyond Nyquist frequency, i.e. half of signal resolution. And low frequencies mean the frequencies which are not higher than Nyquist frequency. To remove high frequencies, we first transform signals into frequency domain via DFT. Then only the low frequencies are retained. Finally, we transform the low frequencies back to time domain via inverse DFT (IDFT). Figure 2 gives an illustration of the forward process of F-pooling.
  Since 2D (inverse) DFT can be decomposed into two 1D (inverse) DFT, we provide the formal representation of F-pooling in 1D case. Denote x ∈ RN as time domain signal and y ∈ CM as frequency domain signal. Without loss of generality, we suppose M is even. FN ∈ CN×N is the so-called DFT-matrix:
  FN =  ω0·0N ω 0·1 N . . . ω 0·(N−1) N ω1·0N ω 1·1 N . . . ω 1·(N−1) N ... ... . . . ...
  ω (N−1)·0 N ω (N−1)·1 N . . . ω (N−1)·(N−1) N  (4) where ωN = e−2πi/N . F∗N is the inverse DFT-matrix. By definition, 1 NFNF ∗ N = I where I is identity matrix. We denote Tµ as a operation which selects the first µ rows and the last µ rows of a matrix. Tµ(x) = [x1:µ;xN−µ+1:N ] (5) That is we select the basis of frequencies ranged in [−µ, µ), due to periodicity of DFT. When applying Tµ to a signal, we obtain its lowest µ frequencies. Then the function of F-pooling for 1D signals is represented as:
  y = 1
  N F∗MTM 2 FNx def = Px (6)
  where P ∈ CM×N is the transform matrix of F-pooling. Now we formalize F-pooling for CNNs. Recall that X is an h0×w0×c tensor and Y is an h1×w1×c tensor. We apply F-pooling to each channel of X.
  Y:,:,i = PhX:,:,iP ∗ w, i ∈ [1, c] (7)
  where Ph ∈ Ch1×h0 and Pw ∈ Cw1×w0 are the transform matrices of F-pooling along vertical direction and horizontal direction respectively. Since F-pooling can be represented as two times matrix-matrix multiplications, its back propagation rule is easily derived.
  As mentioned in section 2.1, the choice of up sampling operation U is important. In this paper, U is set to the inverse process of F-pooling. Specifically, we transform a signal into frequency domain. Then we zero pad the transformed signal to match the resolution of output. Finally, we transform it back to time domain. This process can also be represented by matrix multiplications. For 1D signals, we have:
  x = 1
  M F∗NZM 2 FMy (8)
  where is Z is the zero padding operation.
  Zµ = [x1:µ;0;xM−µ+1:M ] (9)
  The formulations of F-pooling and U are easily extended to 2D case.
sections.heading: 2.3 OPTIMAL ANTI-ALIASING DOWN SAMPLING
sections.text: In this section, we prove that F-pooling is the optimal anti-aliasing down sampling operation from the perspective of reconstruction given U . We focus on 1D case here. Given U , the optimal antialiasing down sampling is obtained by solving the following problem:
  min M ||UMx− x||22, s.t. M∈ A (10)
  where A is a set of all possible anti-aliasing down sampling operations. That is, we hope to find an anti-aliasing down sampling which minimizes the reconstruction error. Based on Nyquist sampling theory,M must remove high frequencies of signals and this holds for F-pooling. We focus on the optimality of F-pooling. We decompose x into low frequencies part xl and high frequencies part xh, i.e. xl = 1NF ∗ NDM2
  FNx and xh = x − xl. Dµ is a diagonal matrix whose the first µ and the last µ diagonal elements equal to 1 while others equal to 0.
  ||UMx− x||22 = ||UMx− xl − xh||22 (11) = ||UMx− xl||22 + ||xh||22 + 〈UMx,xh〉 − 〈xl,xh〉 (12) = ||UMx− xl||22 + ||xh||22 (13)
  equation 13 holds because the third term and the forth term of equation 12 equal to 0. M removes high frequencies and U doesn’t introduce new frequencies. Thus UMx only contains low frequencies. Due to the orthogonality of frequency spectrum, 〈UMx,xh〉 = 0. Similarly, 〈xl,xh〉 = 0. WhenM is F-pooling, we have
  UMx = 1 MN F∗NZM 2 FMF ∗ MTM 2 FNx (14)
  = 1
  N F∗N
  ( ZM
  2 TM 2
  ) FNx (15)
  = 1
  N F∗NDM 2 FNx def = xl (16)
  equation 16 holds due to the definition of operations T, Z, and D. See appendix A for proof. Since the fist term of equation 13 equals to 0, equation 10 is minimized. Thus, we have proved that Fpooling is the optimal anti-aliasing down sampling operation from the perspective of reconstruction.
  We choose reconstruction optimality because: 1) we believe reconstruction optimality relates to the final performance, e.g. classification optimality for image classification. If we accept that the feature extracted by previous convolution layers is useful, then it is best to keep it as much as possible for the current pooling layer. Prior works have shown that using self reconstruction loss as an auxiliary is helpful for classification Rasmus et al. (2015); 2) It is difficult to directly define classification optimality for an intermediate layer.
sections.heading: 2.4 SHIFT-EQUIVALENT
sections.text: Based on shift theorem of Fourier transform, we have
  FNShift4h(x) =FNx S4h (17) Shift4h(F ∗ Nx) =F ∗ Nx S4h (18)
  where S4h ∈ CN whose kth element is e− 2πk N 4h and is element-wise multiplication. Combining with equation 16, we have
  UMShift4h(x) = 1
  N F∗NDM 2 FNShift4h(x) (19)
  = 1
  N F∗N
  ( DM
  2 FNx
  ) S4h (20)
  = Shift4h
  ( 1
  N F∗NDM 2 FNx
  ) (21)
  = Shift4h(UMx) (22)
  We have proved that F-pooling is shift-equivalent. Note that equation 22 is not hold if other up sampling operations are used, such as linear interpolation.
  The proofs in section 2.3 and 2.4 can be easily extended for 2D signals.
sections.heading: 2.5 TRANSITIVITY OF SHIFT-EQUIVALENT
sections.text: We study the transitivity of shift-equivalent for F-pooling. Denote f as a shift-equivalent function without down sampling or up sampling. It is straightforward to shown
  UMShift4h(f(x)) = Shift4h(UMf(x)) (23)
  That is shift-equivalent of F-pooling is transitive for any shift-equivalent function f without down sampling or up sampling. And it is transitive for F-pooling itself. For example, a stack of two F-pooling layers is still a shift-equivalent function.
  Unfortunately, this transitivity of F-pooling is not hold for a shift-equivalent function with down sampling. For example, a function of Fpooling → conv → relu → Fpooling is not shiftequivalent. This prevents us to obtain strict shift-equivalent deep CNNs.
sections.heading: 2.6 PRACTICAL ISSUES
sections.text: Dealing with imaginary part: generally, the output of F-pooling, i.e. Mx contains both real part and imaginary part. However, for commonly used CNNs, the feature maps must be real. Thus one must ignore the imaginary part of F-pooling. On the other hand,Mx is treated as complex in the proofs in section 2.3 and 2.4. If we ignore the imaginary part, F-pooling is no longer the optimal anti-aliasing down sampling (but still anti-aliasing) and F-pooling is no longer strict shift-equivalent.
  Fortunately, this issue is easy to overcome. When the resolution of down sampled signals is odd, the imaginary part ofMx is zero. Suppose the resolution is 2µ+ 1.
  x̂−µ, . . . , x̂−1, x̂0, x̂1 . . . , x̂µ (24)
  Due to its symmetry, it only contains real part when transforms back into time domain. If the resolution is µ+ 2
  x̂−µ, . . . , x̂−1, x̂0, x̂1 . . . , x̂µ, x̂µ+1 (25)
  In this case, it contains imaginary part. But we can recover the symmetry and eliminate the imaginary part by setting x̂µ+1 to zero. We call this trick odd padding. We show the effects of odd padding in appendix B. A drawback of odd padding is that more information is lost during down sampling which may reduces accuracy. We don’t use it in this paper.
  Compared with equation 24 and equation 25, the imaginary part is introduced by x̂µ+1. Thus, the error of ignoring the imaginary part is smaller than ||x̂µ+1||22. In practice, we find this effect is small. Dealing with zero padding: F-pooling is designed to be circular shift equivalence. However, zero padding is commonly used in convolution layers. Convolutional layers with zero padding destroy circular shift-equivalence. Thus, one should expect that using circular padding in convolutional layers will greatly increase the shift consistency of F-pooling. In this paper, we evaluate the performance of F-pooling with both zero-padding and circular padding. We suggest one replaces zero padding with circular padding for better shift-equivalence.
sections.heading: 2.7 IMPLEMENTATION
sections.text: We implement F-pooling in PyTorch Paszke et al. (2017). Theoretically, it is best to implement F-pooling with fast Fourier transform (FFT) and inverse FFT. Suppose F-pooling down samples an h0 × w0 × c tensor to a h1 × w1 × c tensor. Then its time complexity is ch0w0 log(w0h0)). Unfortunately, we find such a implementation in PyTorch is comparatively slow.
  Instead, we implement F-pooling via 1 × 1 convolutions. As in equation 7, 2D F-pooling can be represented as two times matrix-matrix multiplications along vertical direction and horizontal direction respectively. This is equivalent to 1× 1 convolutions along vertical direction and direction horizontal. Its time complexity is O(h0w0(h1 + w1)) which is higher than the optimal complexity. F-pooling requires much more computational costs than average pooling or max-pooling. F-pooling is faster than a convolutional layer when the resolution of feature maps is smaller than the number of channels, as the situations of image classifications. Moreover, the number of pooling layers is limited compared with the number of convolutional layers. Thus, introducing F-pooling will not introduce too many computational costs into CNNs.
  Zhang (2019) claims that it is important to integrate anti-aliasing pooling into CNNs in a correct way. In this paper, we follow their settings. Specifically, a max-pooling with stride s is replaced with a max-pooling with stride 1 and an F-pooling with stride s. A convolution with stride s is replaced with a convolution with stride 1 and an F-pooling with stride s. An average pooling with stride s is replaced with an F-pooling with stride s. See the illustration in figure 3.
sections.heading: 3 EXPERIMENTS
sections.heading: 3.1 1D SIGNALS
sections.text: We test the shift-equivalent of F-pooling on 1D signals. In figure 1, the original signal is a randomly selected row of a 512 × 512 image. We apply max-pooling, average pooling, and F-pooling with stride 4 to those signals. As shown in figure 1, F-pooling is perfectly shift-equivalent. And average pooling is better than max-pooling from shift-equivalent perspective. odd padding is used here.
sections.heading: 3.2 IMAGE CLASSIFICATION
sections.text: CIFAR-1001: we test classification of low-resolution 32 × 32 color images. This dataset contains 50k images for training and 10k images for test. Images are classified into one of 100 categories.
  sub-ImageNet: we then test classification of high-resolution color images. Original ImageNet dataset Russakovsky et al. (2015) contains 1.28M training and 50k validation images, classified into one of 1,000 categories. To reduce the computational resources for training, we use a subset of ImageNet (sub-ImageNet) in this work. We randomly select 200 categories from 1,000 categories. For each category, we randomly select 500 images. Thus, we collect 100k images for training. And we select corresponding 10k validation images. All models are trained on a single GPU with batchsize 64 and 100 epochs. We decrease the initial learning rate by a factor 10 every 40 epochs. For other hyper-parameters, we follow PyTorch’s official training script.2
  We train CIFAR-100 using resnet He et al. (2016) and densenet Huang et al. (2017). We train subImageNet using resnet, densenet, and mobilenet-v2 Sandler et al. (2018). Those models are widely used as benchmarks. Max-pooling, average pooling, and stride convolution are covered in those models. We also compare F-pooling with AA-pooling Zhang (2019). For a model trained on subImageNet, its first down sampling operation is kept to reduce computational costs. This setting is also used in Zhang (2019). The results on CIFAR-100 are averaged by 3 runs.
  We study not only accuracy but also consistency. We follow the metric of consistency used in Zhang (2019): we check how often the network outputs the same classification, given the same image with two different shifts.
  Eh0,h1,w0,w11 {argmax p(Shifth0,w0) = argmax p(Shifth1,w1)} (26) We only evaluate diagonal shifts in this paper. For CIFAR-100, the number of shifted pixels ranges from -7 to 7. For sub-ImageNet, it ranges from -63 to 63.
  Zero padding: we keep the padding method of convolutions as zero padding. We measure accuracy and consistency of different pooling methods. Results on sub-ImageNet is shown in table 1 and results on CIFAR-100 are shown in table 2 respectively.
  Circular padding: as mentioned earlier, circular padding may improve the consistency of Fpooling. Thus we replace the zero padding of convolutions with circular padding. To further evaluate the robustness w.r.t shifts, we use standard deviation (std) of probabilities of the correct label. Std and consistency on sub-ImageNet an CIFAR-100 are shown in table 3 and table 4 respectively.
  Based on those results, we conclude that
  • F-pooling is significantly and consistently better than original pooling methods in terms of accuracy and shift consistency.
  • F-pooling is comparable with AA-pooling in term of accuracy and shift consistency with zero padding. With circular padding, F-pooling is significantly better than AA-pooling.
  • Shift consistency of F-pooling is improved more when replacing zero padding with circular padding, especially on CIFAR-100.
  1https://www.cs.toronto.edu/ kriz/cifar.html 2https://github.com/pytorch/examples/tree/master/imagenet
sections.heading: 4 RELATED WORKS
sections.text: Pooling which reduces the resolution of feature maps is an important part of CNNs. Early CNNs Lecun et al. (1989) use average pooling which is good for anti-aliasing. Later empirical evidence suggests max-pooling Scherer et al. (2010) and strided-convolutions Long et al. (2015) provide better performance. However, small shifts in the input can drastically change the output when stacking multiple max-pooling or strided-convolutions Engstrom et al. (2017); Azulay & Weiss (2018). Other variants such as Graham (2014); He et al. (2015); Lee et al. (2016) (we just list a few of them), focus on extending the functionality of pooling Lee et al. (2016) or making pooling adjusted to variable input size Graham (2014); He et al. (2015).
  Recently, Zhang (2019) shows that CNNs will have better shift-equivalent and anti-aliasing properties when low-pass filtering is integrated correctly. However, their method is not strict shiftequivalent and anti-aliasing in theory. Williams & Li (2018) propose Wavelet-pooling. They decompose a signal via wavelet transform and retain the lowest sub-band. This process is repeated until the designed down sampling factor is met. The spirit of Wavelet-pooling is similar to F-pooling. However, they claim that Wavelet-pooling is better than others because it is a global transform instead of a local transform. They neither focus on shift-equivalent nor prove Wavelet-pooling is shift-equivalent or not.
  F-pooling is a complex transformation because DFT and IDFT are involved in it. Many works integrate complex transformations or complex values into neural networks. Amin & Murase (2009) study single-layered complex-valued neural networks for real-valued classification problems. Complex numbers represented in polar coordinates are more suitable to deal with rotations. Based on this, Cohen et al. (2018) propose spherical CNNs which are rotation-equivalent to deal with signals projected from spherical surface. Trabelsi et al. (2018) propose general deep complex CNNs. They adjust batch normalization and non-linear activations for complex CNNs. F-pooling can used in their method without worry about the imaginary part. F-pooling utilizes shift theorem of DFT and achieves shift-equivalent. This is a new success for the combination of complex transformations and neural networks.
sections.heading: 5 CONCLUSIONS
sections.text: In this paper, we have proposed frequency pooling (F-pooling) for CNNs. F-pooling reduces the dimension of signals in frequency domain. We have defined shift-equivalent of functions which contain down sampling operations by introducing an up sampling operation. Under this definition, we have proved that F-pooling is the optimal anti-aliasing down sampling operation and F-pooling is shift-equivalent. We have integrated F-pooling into modern CNNs. We have verified that Fpooling remarkably increases accuracy and robustness w.r.t shifts of modern CNNs. We believe that F-pooling plays a more important role in applications where shift-equivalent is more serious, such as object detection and semantic segmentation.
sections.heading: A PROOF OF OPERATION
sections.text: We prove DM 2 = ZM 2 TM 2 . By definition, T can be represented as an M ×N matrix and Z can be represented as a N ×M matrix.
  TM 2 =
  [ IM
  2 0M 2 0N 2 −M 0N 2 −M 0M 2 0M 2
  0M 2 0M 2 0N 2 −M 0N 2 −M 0M 2 IM 2
  ] (27)
  where IM is an M ×M identity matrix and 0M is an M ×M zero matrix. ZM 2 is equal to the transpose of TM
  2 by definition. Then
  ZM 2 TM 2 = IM2 · ·· 0N−M · · · IM
  2  (28) which is the same as DM
  2 by definition.
  B EFFECT OF odd padding
  C LOSS CURVES ON SUB-IMAGENET