A unified Fourier slice method to derive ridgelet transform for a variety of depth-2 neural networks
Sho Sonoda, Isao Ishikawa, Masahiro Ikeda
TL;DR
This work addresses the challenge of interpreting neural network parameters by viewing them through ridgelet transforms and parameter distributions. It proposes a Fourier slice method to systematically derive ridgelet transforms for diverse architectures, including finite-field networks, group-convolutional nets on Hilbert spaces, fully-connected nets on noncompact symmetric spaces, and pooling/d-plane setups, accompanied by constructive reconstruction formulas. The core contributions are a three-step Fourier-based procedure to obtain ridgelet coefficients, universal-reconstruction guarantees across cases, and connections to geometric deep learning and Radon/wavelet theory. Together, these developments offer a harmonic-analysis perspective on neural networks with potential implications for parameter-distribution analysis and representer theorems.
Abstract
To investigate neural network parameters, it is easier to study the distribution of parameters than to study the parameters in each neuron. The ridgelet transform is a pseudo-inverse operator that maps a given function $f$ to the parameter distribution $γ$ so that a network $\mathtt{NN}[γ]$ reproduces $f$, i.e. $\mathtt{NN}[γ]=f$. For depth-2 fully-connected networks on a Euclidean space, the ridgelet transform has been discovered up to the closed-form expression, thus we could describe how the parameters are distributed. However, for a variety of modern neural network architectures, the closed-form expression has not been known. In this paper, we explain a systematic method using Fourier expressions to derive ridgelet transforms for a variety of modern networks such as networks on finite fields $\mathbb{F}_p$, group convolutional networks on abstract Hilbert space $\mathcal{H}$, fully-connected networks on noncompact symmetric spaces $G/K$, and pooling layers, or the $d$-plane ridgelet transform.
