mlsanityData to 7 Oct 2026

Understanding Sinusoidal Neural Networks

arXiv 2212.01833 ↗First posted 4 Dec 2022cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

In this work, we investigate the structure and representation capacity of sinusoidal MLPs - multilayer perceptron networks that use sine as the activation function. These neural networks (known as neural fields) have become fundamental in representing common signals in computer graphics, such as images, signed distance functions, and radiance fields. This success can be primarily attributed to two key properties of sinusoidal MLPs: smoothness and compactness. These functions are smooth because they arise from the composition of affine maps with the sine function. This work provides theoretical results to justify the compactness property of sinusoidal MLPs and provides control mechanisms in the definition and training of these networks. We propose to study a sinusoidal MLP by expanding it as a harmonic sum. First, we observe that its first layer can be seen as a harmonic dictionary, which we call the input sinusoidal neurons. Then, a hidden layer combines this dictionary using an affine map and modulates the outputs using the sine, this results in a special dictionary of sinusoidal neurons. We prove that each of these sinusoidal neurons expands as a harmonic sum producing a large number of new frequencies expressed as integer linear combinations of the input frequencies. Thus, each hidden neuron produces the same frequencies, and the corresponding amplitudes are completely determined by the hidden affine map. We also provide an upper bound and a way of sorting these amplitudes that can control the resulting approximation, allowing us to truncate the corresponding series. Finally, we present applications for training and initialization of sinusoidal MLPs. Additionally, we show that if the input neurons are periodic, then the entire network will be periodic with the same period. We relate these periodic networks with the Fourier series representation.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 11 of its 19 references that are in the map. First posted on arXiv 4 Dec 2022.

Builds on

11 of 19 references.

References · 11

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
  3. 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
  4. 2018On the Spectral Bias of Neural Networkscited by 1,321
  5. 2021A Structured Dictionary Perspective on Implicit Neural Representationscited by 100
  6. 2021Seeing Implicit Neural Representations as Fourier Seriescited by 50
  7. 2022A Level Set Theory for Neural Implicit Evolution under Explicit Flowscited by 42
  8. 2022Exploring Differential Geometry in Neural Implicitscited by 26
  9. 2022Neural Implicit Surface Evolutioncited by 18
  10. 2022Multiresolution Neural Networks for Imagingcited by 5
  11. 2022Neural Implicit Mapping via Nested Neighborhoodscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 1.

4 papers.