A Novel Fourier Feature Network for Solving Partial Differential Equations

• URL: http://arxiv.org/abs/2608.14733v1
• Date: Thu, 13 Aug 2026 06:29:30 GMT
• Title: A Novel Fourier Feature Network for Solving Partial Differential Equations
• Abstract summary: Fourier Feature Networks (FENs) are proposed, which incorporate Fourier features using $cos$, $sin$, or a combination of both.<n>Our numerical experiments demonstrate that FENs consistently achieve higher accuracy than Extreme Learning Machines.
• Score: 3.212381039696142
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Building on the foundation of single-hidden-layer neural networks, Fourier Feature Networks (FENs) are proposed, which incorporate Fourier features using $\cos$, $\sin$, or a combination of both. Similar to Extreme Learning Machines (ELMs), FENs employ a single-hidden-layer architecture to generate a set of basis functions. The target function is then approximated as a linear combination of these basis functions, with the coefficients determined using the least squares method. However, unlike ELMs, which often rely on affine transformations to improve representational power, FENs can achieve high-precision solutions without requiring such transformations on the input variables. To evaluate the representational capacity of these networks, we search for an optimal scaling factor within a predefined range for the randomly initialized and fixed weights and biases. By adjusting this scaling factor, we ensure a fair comparison between FENs and ELMs using various activation functions, such as $\text{sigmoid}$, $\tanh$, and $\text{swish}$. Our numerical experiments demonstrate that FENs consistently achieve higher accuracy than ELMs.

Related papers

• Flash EQ-Linear: Accelerating Equivariant Linear Layers via Group-wise Discrete Fourier Transform [65.89510337046077]
  Equivariant networks embed geometric symmetries as structural priors through weight sharing.<n>Existing implementations unroll the structured weights into dense matrices and dispatch them to generic dense kernels.<n>This is the first time equivariant networks strictly dominate their non-equivariant counterparts along all three axes simultaneously.
  arXiv  Detail & Related papers  (2026-07-23T12:45:21Z)
• Multi-Scale Separable Fourier Neural Networks for Solving High-Frequency PDEs [2.7347781746626705]
  We propose a novel neural network architecture, Multi-Scale Separable Neural Networks (MS-SFNN)<n>MS-SFNN achieves unprecedented accuracy across a range of challenging PDEs, significantly outperforming state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-05-29T08:58:39Z)
• Fourier Feature Pyramids for Physics-Informed Neural Networks [47.75068288153803]
  We present an improved neural field architecture for solving partial differential equations (PDEs)<n>We call our model beignet (Bandlimited Embedding with Interpolated Grid Network)<n>We demonstrate that beignet finds significantly more accurate solutions on PDE benchmarks using fewer parameters than state-of-the-art PINN methods.
  arXiv  Detail & Related papers  (2026-05-22T23:12:56Z)
• Fourier Learning Machines: Nonharmonic Fourier-Based Neural Networks for Scientific Machine Learning [0.5097809301149341]
  We introduce the Fourier Learning Machine (FLM), a neural network (NN) architecture designed to represent a multidimensional nonharmonic Fourier series.<n>The FLM uses a simple feedforward structure with cosine activation functions to learn the frequencies, amplitudes, and phase shifts of the series as trainable parameters.<n> Computational experiments show that the performance of FLMs is comparable, and often superior, to that of established architectures like SIREN and vanilla feedforward NNs.
  arXiv  Detail & Related papers  (2025-09-10T16:49:20Z)
• Fourier Fingerprints of Ansatzes in Quantum Machine Learning [0.0]
  We show the existence of correlations between the Fourier modes, which depend on the structure of the circuit.<n>For several popular ansatzes, we compute the Fourier coefficient correlations (FCCs) and construct the Fourier fingerprint.<n>We show how, for the problem of learning random Fourier series, the FCC correctly predicts relative performance of ansatzes whilst the widely-used expressibility metric does not.
  arXiv  Detail & Related papers  (2025-08-28T15:00:37Z)
• RSF-Conv: Rotation-and-Scale Equivariant Fourier Parameterized Convolution for Retinal Vessel Segmentation [58.618797429661754]
  We propose a rotation-and-scale equivariant Fourier parameterized convolution (RSF-Conv) specifically for retinal vessel segmentation. As a general module, RSF-Conv can be integrated into existing networks in a plug-and-play manner. To demonstrate the effectiveness of RSF-Conv, we also apply RSF-Conv+U-Net and RSF-Conv+Iter-Net to retinal artery/vein classification.
  arXiv  Detail & Related papers  (2023-09-27T13:14:57Z)
• Factorized Fourier Neural Operators [77.47313102926017]
  The Factorized Fourier Neural Operator (F-FNO) is a learning-based method for simulating partial differential equations. We show that our model maintains an error rate of 2% while still running an order of magnitude faster than a numerical solver.
  arXiv  Detail & Related papers  (2021-11-27T03:34:13Z)
• Adaptive Fourier Neural Operators: Efficient Token Mixers for Transformers [55.90468016961356]
  We propose an efficient token mixer that learns to mix in the Fourier domain. AFNO is based on a principled foundation of operator learning. It can handle a sequence size of 65k and outperforms other efficient self-attention mechanisms.
  arXiv  Detail & Related papers  (2021-11-24T05:44:31Z)
• Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases [73.53227696624306]
  We present a new family of algorithms for learning Fourier-sparse set functions. In contrast to other work that focused on the Walsh-Hadamard transform, our novel algorithms operate with recently introduced non-orthogonal Fourier transforms. We demonstrate effectiveness on several real-world applications.
  arXiv  Detail & Related papers  (2020-10-01T14:31:59Z)
• Supervised Quantile Normalization for Low-rank Matrix Approximation [50.445371939523305]
  We learn the parameters of quantile normalization operators that can operate row-wise on the values of $X$ and/or of its factorization $UV$ to improve the quality of the low-rank representation of $X$ itself. We demonstrate the applicability of these techniques on synthetic and genomics datasets.
  arXiv  Detail & Related papers  (2020-02-08T21:06:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.