Related Experiment Video
Updated: Apr 13, 2026

03:31
Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
Published on: December 15, 2023
1.0K
Fourier feature-enhanced multi-layer residual stacking network: A novel multiscale modeling approach for
Bo-Ya Hou1, Yu-Long Bai1, Xia-Ting Jing1
1College of Physics and Electronic Engineering, Northwest Normal University, Lanzhou, Gansu 730070, China.
Summary
Physics-Informed Neural Networks (PINNs) struggle with complex equations. A new Fourier Feature-Enhanced Multi-layer Residual Stacking Network (FRES) improves accuracy and stability for multi-scale and high-frequency problems.
Area of Science:
- Computational physics
- Machine learning for differential equations
Background:
- Physics-Informed Neural Networks (PINNs) show promise for solving partial differential equations (PDEs).
- PINNs face limitations with multi-scale structures and high-frequency components due to spectral bias and training instability.
- Existing methods often lack robustness and accuracy for complex physical phenomena.
Purpose of the Study:
- Introduce a novel framework, Fourier Feature-Enhanced Multi-layer Residual Stacking Network (FRES), to overcome PINN limitations.
- Enhance the representation of complex multi-scale features and high-frequency solution components.
- Improve accuracy, extrapolation capability, and noise robustness in solving PDEs.
Main Methods:
- FRES utilizes residual information to guide frequency-domain modeling.
- A dynamic Fourier embedding mechanism adaptively generates high-frequency features.
- A multi-layer residual correction scheme and frequency-enhanced residual fusion module progressively reduce errors and integrate features.
- A trainable frequency matrix enhances adaptability.
Main Results:
- FRES demonstrates superior performance on benchmark PDEs (Burgers, Schrödinger, KdV equations).
- Significantly outperforms traditional PINNs and multi-scale Fourier feature methods (MFF).
- Exhibits enhanced accuracy, extrapolation capabilities, and noise robustness.
Conclusions:
- FRES offers a robust and efficient solution for modeling complex physical fields governed by PDEs.
- The proposed framework effectively addresses spectral bias and training instability in PINNs.
- FRES shows significant potential for advancing scientific machine learning applications.
Related Concept Videos
Residuals and Least-Squares Property
9.9K
The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
9.9K
Properties of Fourier Transform II
943
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
943
Fast Fourier Transform
1.2K
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
1.2K