Coordinate Encoding on Linear Grids for Physics-Informed Neural Networks
Authors: Tetsuro Tsuchino, Motoki Shiga
Organizations: Graduate School of Engineering, Gifu University, Japan · International Center for Synchrotron Radiation Innovation Smart, Tohoku University, Japan · Unprecedented-scale Data Analytics Center, Tohoku University, Japan · Graduate School of Information Sciences, Tohoku University, Japan · Center for Basic Research on Materials, National Institute for Materials Science, Japan · Center for Advanced Intelligence Project, RIKEN, Japan
In solving partial differential equations (PDEs), machine learning utilizing physical laws has received considerable attention owing to advantages such as mesh-free solutions, unsupervised learning, and feasibility for solving high-dimensional problems. An effective approach is based on physics-informed neural networks (PINNs), which are based on deep neural networks known for their excellent performance in various academic and industrial applications. However, PINNs struggled with model training owing to significantly slow convergence because of a spectral bias problem. In this study, we propose a PINN-based method equipped with a coordinate-encoding layer on linear grid cells. The proposed method improves the training convergence speed by separating the local domains using grid cells. Moreover, it reduces the overall computational cost by using axis-independent linear grid cells. The method also achieves efficient and stable model training by adequately interpolating the encoded coordinates between grid points using natural cubic splines, which guarantees continuous derivative functions of the model computed for the loss functions. The results of numerical experiments demonstrate the effective performance and efficient training convergence speed of the proposed method.
Figures & tables
Figure 1: Schematic of the proposed method, coordinate encoding on linear grid (CELG).
H-Spline
PIXEL
CELG
Space
O(SD⋅RD)
O(M⋅RD)
O(M⋅D⋅R)
Time
O(SD⋅2D)
O(M⋅2D)
O(M⋅D⋅R)
Table 1: Computational complexities
Figure 2: Training results utilizing linear, cosine with/without multigrid (MG), Hermite and natural interpolations for 1D Poisson PDE. (a) Predictions of u(x) , (b) first and (c) second derivatives. (d) Learning curves. In (a)–(c), the analytical solution is shown as a solid gray line.
Figure 3: Analytical solutions of (a) 1D and (b) 2D multi-band Poisson PDEs.
Figure 4: Prediction results for the 1D multi-band Poisson PDE during training at (a) 100, (b) 1,000, (c) 5,000, and (d) 10,000 training epochs. The grid parameter was set to R=16 in PIXEL, H-Spline, and CELG.
Figure 5: Learning curves for the 1D multi-band Poisson PDE. The grid parameters were set to (a) R=4 , (b) 8, (c) 16, and (d) 32.
Figure 6: Predictions for the 2D multi-band Poisson PDE by non-grid-based models (Vanilla and CP-PINN) and CELG, CELG-CP ( R=16 ) after (a) 1,000, (b) 5,000, and (c) 50,000 training epochs.
Figure 8: Learning curves for the 2D multi-band Poisson PDE. (a) Curves of CELG and CELG-CP with R=16 and non-grid methods (Vanilla and CP-PINN), and those of grid-based methods with (b) R=8 , (c) R=16 , and (d) R=32 .
Allen–Cahn
Burgers
Flow-Mixing
Helmholtz
Domain
[0,1]×[−1,1]
[0,1]×[−1,1]
[0,8]×[−4,4]2
[0,1]3
#Colloc.
50 × 128
50 × 128
643
643
#IC
128
128
642
-
#BC
50×2
50×2
4×642
6×642
λ
(0.1, 1, 1)
(1, 1, 0.001)
(100, 1, 1)
(1, -, 1)
#Test
100×256
100×256
1283
1283
Table 2: Training settings for benchmark PDEs.
Method
R
Allen-Cahn/Burgers
Flow-Mixing
Helmholtz
Vanilla
–
12,737
12,801
1,985
CP-PINN
–
25,216
37,824
5,808
PIXEL
8
18,753
101,697
24,433
16
45,377
637,249
158,321
32
147,777
4,608,321
1,151,089
H-Spline
8
576
13,824
13,824
Table 3: Number of parameters for benchmark PDEs.
Method
R
Allen-Cahn
Burgers
Flow-Mixing
Helmholtz
Vanilla
–
1.73 ± 0.03
1.46 ± 0.01
1.85 ± 0.01
24.73 ± 0.02
CP-PINN
–
2.04 ± 0.05
1.71 ± 0.04
1.90 ± 0.02
4.31 ± 0.23
PIXEL
8
1.68 ± 0.07
2.26 ± 0.01
34.83 ± 0.01
24.86 ± 0.01
16
1.60 ± 0.07
2.07 ± 0.01
27.57 ± 0.01
18.77 ± 0.02
32
1.63 ± 0.11
2.01 ± 0.01
30.69 ± 0.01
17.53 ± 0.02
H-Spline
8
0.88 ± 0.13
0.67 ± 0.04
19.54 ± 0.29
21.44 ± 0.20
Table 4: Training time (ms./iter.) for benchmark PDEs.
Figure 9: Learning curves for benchmark PDEs: (a) Allen-Cahn, (b) Burgers, (c) Flow-Mixing, and (d) Helmholtz equations.
Figure 10: Prediction results for (a) Allen-Cahn, (b) Burgers, (c) Flow-Mixing, and (d) Helmholtz equations. The third rows in (a) and (b) show the prediction results and the analytical solutions (gray) at time t=1 . Predictions and residuals at (c) t=8 and (d) x3=0.75 .
Method
R
Allen-Cahn
Burgers
Flow-Mixing
Helmholtz
Vanilla
–
0.46 ± 0.23
0.08 ± 0.05
0.02 ± 0.00
1.08 ± 0.13
CP-PINN
–
0.88 ± 0.11
0.09 ± 0.00
0.05 ± 0.00
0.07 ± 0.01
PIXEL
8
0.04 ± 0.01
0.09 ± 0.05
0.01 ± 0.00
0.27 ± 0.03
16
0.62 ± 0.02
0.47 ± 0.06
0.01 ± 0.00
0.14 ± 0.00
32
0.99 ± 0.04
0.94 ± 0.04
0.05 ± 0.01
0.68 ± 0.00
H-Spline
8
0.62 ± 0.00
0.47 ± 0.02
0.18 ± 0.00
0.54 ± 0.00
Table 5: Relative errors for benchmark PDEs.
Hyperparameter
2D
3D
4D
5D
Domain
[0,1]2
[0,1]3
[0,1]4
[0,1]5
#Colloc.
642
643
164
165
#IC
-
-
-
-
#BC
4×64
6×642
8×163
10×164
#Test
642
643
164
165
Epochs
50,000
80,000
100,000
200,000
Table 6: Training Settings for High-Dimensional Helmholtz equations.
Method
R
2D
3D
4D
5D
Vanilla
–
13.344
43.467
56.801
180.465
CP-PINN
–
14.421
28.907
42.602
63.602
PIXEL
8
14.276
41.424
59.750
OOM
16
14.610
38.370
63.222
OOM
32
14.153
38.310
65.291
OOM
H-Spline
8
11.364
36.530
OOM
OOM
Table 8: Training Time (ms./iter.) for High-Dimensional Helmholtz equations.
Method
R
2D
3D
4D
5D
Vanilla
–
2.03E+00
1.80E+00
4.29E+00
7.36E+00
CP-PINN
–
7.78E-02
1.64E-01
1.33E+00
2.72E+01
PIXEL
8
8.94E-01
4.22E-01
3.99E+00
OOM
16
9.08E-01
9.01E-01
1.16E+00
OOM
32
1.02E+00
1.07E+00
1.01E+00
OOM
H-Spline
8
1.33E+00
2.56E+00
OOM
OOM
Table 9: Relative Errors for High-Dimensional Helmholtz equations.
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
Figure 11: Interpolation kernels and their first and second derivative functions: (a) cosine and (b)–(d) Hermite interpolation kernels.
Physics-informed neural networks (PINNs) have emerged as a promising mesh-free paradigm for solving partial differential equations, yet adoption in science and engineering is limited by slow training and modest accuracy relative to modern numerical solvers. We introduce the Sequential Correction Algorithm for Learning Efficient PINN (Scale-PINN), a learning strategy that bridges modern physics-informed learning with numerical algorithms. Scale-PINN incorporates the iterative residual-correction principle, a cornerstone of numerical solvers, directly into the loss formulation, marking a paradigm shift in how PINN losses can be conceived and constructed. This integration enables Scale-PINN to achieve unprecedented convergence speed across PDE problems from different physics domain, including reducing training time on a challenging fluid-dynamics problem for state-of-the-art PINN from hours to sub-2 minutes while maintaining superior accuracy, and enabling application to representative problems in aerodynamics and urban science. By uniting the rigor of numerical methods with the flexibility of deep learning, Scale-PINN marks a significant leap toward the practical adoption of PINNs in science and engineering through scalable, physics-informed learning. Codes are available at https://github.com/chiuph/SCALE-PINN.
Pao-Hsiung Chiu, Jian Cheng Wong, Chin Chun Ooi +3
Institute of High Performance Computing, A*STAR, Singapore. · Centre for Frontier AI Research, A*STAR, Singapore. · School of Mechanical Engineering, Tianjin University, China. +1
Physics-informed neural networks (PINNs) often fail to accurately resolve partial differential equations (PDEs) with high-frequency or multi-scale solutions, as well as strongly nonlinear problems. Two factors underlie this difficulty: spectral bias, the tendency of neural networks to underfit high-frequency features; and representation-coefficient coupling, the entanglement of representation learning and coefficient fitting within a single nonconvex optimization objective. In this work, we propose the Fourier-enhanced alternating Levenberg--Marquardt PINN (FALM-PINN), an optimization framework that decouples representation learning from coefficient fitting. The upper-level problem learns a Fourier-enhanced basis that enriches the latent space with high-frequency components, while the lower-level problem resolves the coupling by fitting the projection coefficients on this basis, solving a nonlinear least-squares problem with the Levenberg--Marquardt algorithm. The framework applies to general nonlinear and coupled PDE systems, and reduces to a single-step convex optimization problem for linear PDEs. We prove global convergence of the alternating training scheme in both cases. Numerical examples on multiple challenging high-frequency and nonlinear PDEs show that FALM-PINN achieves relative L2 errors up to two orders of magnitude lower than state-of-the-art baselines.
Yulun Wu, Matthieu Barreau, Miguel Aguiar +1
Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, 100 44, Sweden
We propose a linearized Physics-Informed Neural Network (lPINN), a reduced-order neural basis method for forward and inverse differential equations. In an offline stage, lPINN learns operator-compatible continuous neural basis functions from an ensemble of numerical solutions. The basis functions are differentiable through automatic differentiation and are pretrained using solution data together with either derivative information or physics residuals. For each new problem instance, the basis functions are frozen and the solution is obtained by minimizing the governing-equation residual together with applicable initial, boundary, regularization, and observational terms. Unlike surrogate and operator-learning methods, the training data define the trial space offline, while the instance-specific solution is computed online by enforcing the governing physics. Relative to vanilla PINNs, lPINN pretrains the nonlinear hidden-layer representation offline and performs online inference only in the final linear layer. We evaluate lPINN on forward and inverse problems for the advection-diffusion equation, Burgers' equation, and the nonlinear pendulum equation. Compared with vanilla PINNs, lPINN achieves lower solution and parameter errors while reducing online inference times by approximately one to more than three orders of magnitude, with the largest gains generally observed for limited residual or measurement data. Cross-resolution experiments show that the learned continuous representation can be evaluated on finer meshes without retraining and with nearly unchanged accuracy.
Wenhao Chen, Alexandre M. Tartakovsky
Civil and Environmental Engineering Department University of Illinois Urbana-Champaign Urbana, IL 61801, USA · Pacific Northwest National Laboratory Richland, WA 99352, USA