LGOct 21, 2021

Fourier Neural Networks for Function Approximation

arXiv:2111.08438v1
Originality Synthesis-oriented
AI Analysis

This work addresses the efficiency of neural network architectures for function approximation, but it appears incremental as it builds on existing Fourier neural network methodologies.

The paper tackled the problem of function approximation by neural networks, proposing a modified Fourier neural network with sinusoidal activation and two hidden layers that performs well on synthetic functions, though specific numerical results are not provided.

The success of Neural networks in providing miraculous results when applied to a wide variety of tasks is astonishing. Insight in the working can be obtained by studying the universal approximation property of neural networks. It is proved extensively that neural networks are universal approximators. Further it is proved that deep Neural networks are better approximators. It is specifically proved that for a narrow neural network to approximate a function which is otherwise implemented by a deep Neural network, the network take exponentially large number of neurons. In this work, we have implemented existing methodologies for a variety of synthetic functions and identified their deficiencies. Further, we examined that Fourier neural network is able to perform fairly good with only two layers in the neural network. A modified Fourier Neural network which has sinusoidal activation and two hidden layer is proposed and the results are tabulated.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes