---
title: Neural Eikonal Solver (NES)
url: https://www.emergentmind.com/topics/neural-eikonal-solver-nes
type: topic
---

# Neural Eikonal Solver (NES)

A Neural Eikonal Solver (NES) is a class of algorithms employing neural networks—most often multilayer perceptrons (MLPs), physics-informed neural networks (PINNs), or equivariant neural fields—to compute, represent, or accelerate numerical solutions to the Eikonal equation, which governs first-arrival wavefront propagation in inhomogeneous media. NESs unify machine learning and numerical PDE techniques, yielding mesh-free, scalable, and often highly accurate solvers that address limitations of classical finite-difference approaches, particularly in high-dimensional, geometrically complex, or data-intensive settings.

## 1. The Eikonal Equation and Its Significance

The Eikonal equation describes the evolution of a propagating front in a scalar speed field on a domain Ω or a Riemannian manifold 𝓜:

- *Flat (Euclidean) domain*:  
  $$
  |\nabla T(x)| = F(x), \quad x \in \Omega \setminus \Gamma, \qquad T(x)=0, \ x \in \Gamma
  $$
  where $T(x)$ is the earliest arrival time from a boundary or source set $\Gamma$, $F(x)$ is the slowness ($=1/v(x)$), and $\nabla$ denotes the Euclidean gradient.

- *Riemannian geometry*:  
  $$
  |\nabla_{\mathcal{G}} T(x)| = F(x), \quad x \in \mathcal{M} \setminus \Gamma
  $$
  where $\nabla_{\mathcal{G}}$ is the gradient with respect to the manifold metric $\mathcal{G}$.

The geometric interpretation is that $T(x)$ encodes the geodesic (shortest-path) distance or minimum travel time, for spatially varying speed $v(x)$, from $\Gamma$ to $x$ [1903.07973, 2004.00361, 2505.16035].

## 2. Core Architectures and Methodological Paradigms

NES methodologies span several neural architectures and algorithmic frameworks:

### 2.1 Neural "Local Solvers" Integrated in Upwind Schemes

“Deep Eikonal Solvers” replace the classical finite-difference update of fast marching methods (FMM) with a trained neural network that predicts the local update given a patch of nearby values [1903.07973]:

- On Cartesian grids: An MLP operates on a vector of normalized neighbor differences.
- On triangulated surfaces: A PointNet-style architecture encodes mesh geometry and arrival times.

This approach preserves the upwind/Dijkstra-style global ordering and attains higher empirical accuracy and order of convergence by learning data-driven local stencils.

### 2.2 Physics-Informed Neural Networks (PINNs)

PINN-based NESs treat the Eikonal equation as a soft constraint within the loss function, optimizing all network weights so that the output traveltimes satisfy the PDE at randomly sampled spatial points [2007.08330, 2101.11840, 2407.16439, 2205.07989]:

- For single-source traveltimes, PINNs output a scalar $T(x)$ or a factored form $T_0(x)\tau(x)$ with $T_0$ a reference solution.
- For source-receiver (two-point) traveltimes, networks take both source and receiver locations as input.
- Key advances include source singularity regularization via "factoring" (multiplying out a known singularity), adaptive loss weighting, surrogate modeling (handling many sources), and transfer learning for velocity inversion.

### 2.3 Continuous, Mesh-Free Neural Representations

Approaches such as EikoNet [2004.00361] and PINN-based methods [2101.11840, 2205.07989, 2407.16439, 2505.16035] represent the traveltime (or correction factor to a proxy solution) as a continuous function of spatial (and/or source) coordinates. Network gradients are computed analytically via automatic differentiation, enabling precise evaluation at arbitrary points.

### 2.4 Equivariant Neural Fields and Meta-Learning

Equivariant Eikonal Neural Networks [2505.16035] build NESs whose solution fields are equivariant under the action of Lie groups (e.g., $SE(n)$ for translations and rotations), using cross-attention and invariant representations of latent velocity models. Meta-learning enables rapid adaptation to new speed fields or geometric domains, while group-equivariant conditioning yields direct generalization to Euclidean, spherical, or hyperbolic manifolds.

## 3. Loss Functions, Factorization, and Physics Constraints

### 3.1 Factored Formulations

- **Classical**: Direct PINN loss on $|\nabla T|^2 - 1/v^2 = 0$ is ill-conditioned near point sources due to the singularity at $x_s$.
- **Factored**: Solutions are written $T(x) = T_0(x) \tau(x)$ or $T(x) = R(x)\gamma(x)$, where $T_0$ or $R(x) = \|x - x_s\|$ captures the geometric singularity at the source, and $\tau$, $\gamma$ are smooth factors learned by the network [2007.08330, 2101.11840, 2407.16439, 2205.07989].
- **New factorizations**: PINNPStomo proposes replacing background traveltime $T_0$ by pure distance $R$ to eliminate velocity model dependence, confining the unknown factor’s range and improving convergence and robustness [2407.16439, 2205.07989].

### 3.2 Physics-Informed Loss

- **Supervised loss**: When ground truth or high-accuracy reference solvers are available, mean squared error between predicted and reference traveltimes is used [1903.07973].
- **Physics loss**: The main loss is typically the squared residual or $L_1$-norm of the Eikonal PDE (possibly in factored form), with adaptive weighting of PDE, positivity, and boundary terms [2007.08330, 2101.11840, 2205.07989].
- **Hamiltonian loss**: In regimes with caustics, a non-symmetric, $L_1$-based loss on the Hamiltonian supports robust training and better handles fronts with singularities [2205.07989].
- **Meta-learning/autodecoding**: For family-generalization, losses are defined over latent-parameterized model ensembles and optimized jointly [2505.16035].

## 4. Performance, Accuracy, and Generalization

### 4.1 Quantitative Accuracy

NESs match or surpass the accuracy of classical fast marching methods:

| Approach                                  | RMAE (Marmousi)     | Training Time     | Reference |
|--------------------------------------------|---------------------|-------------------|-----------|
| NES-OP (one-point) [2205.07989]           | 0.2–0.6%            | 40 min            | [2205.07989] |
| PINNeik (one-point) [2007.08330]          | 12.4%               | 330 s             | [2205.07989] |
| NES-TP (two-point) [2205.07989]           | 0.4–0.9%            | 16 min            | [2205.07989] |
| EikoNet (two-point) [2004.00361]          | 5.4%                | 9600 s            | [2205.07989] |

EikoNet achieves grid-free, continuous solutions, avoiding interpolation artifacts and matching FMM for various 3D velocity models [2004.00361]. NESs exhibit higher order of accuracy (empirical $r\sim2$ or higher) compared to classical $O(h)$ or $O(h^2)$ finite-difference schemes [1903.07973].

### 4.2 Scalability and Computational Efficiency

- NESs are highly parallelizable on GPUs, allowing real-time inference for millions of source-receiver pairs.
- Training cost exceeds a single FMM/PDE solve but is amortized over many evaluations, particularly in inversion or surrogate settings [2101.11840].
- Two-point NESs compress traveltime lookup tables by orders of magnitude, with similar or better inference speed than FMM.

### 4.3 Generalization

- NESs generalize across different shapes (e.g., trained on TOSCA, tested on SHREC [1903.07973]), source locations, and mesh resolutions.
- Equivariant NESs provide direct generalization under group actions and across geometric spaces [2505.16035].

## 5. Applications and Extensions

NESs have been applied to a wide range of domains:

- **Seismic imaging and tomography**: Multi-parameter inversion for P- and S-wave velocities, hypocenter localization, distributed acoustic sensing, and Kirchhoff migration [2004.00361, 2407.16439, 2205.07989].
- **Geodesic distance and geometry processing**: On both flat and curved manifolds, including surfaces of arbitrary genus [1903.07973, 2505.16035].
- **Ray modeling and multipathing**: NESs enable direct gradient-based detection of secondary arrivals [2004.00361].
- **Arbitrary physical domains and anisotropic media**: Simple modifications to the PINN residual allow solving with anisotropy, attenuation, and topographic boundaries [2101.11840, 2007.08330, 2407.16439].
- **Neural surrogate modeling and real-time updates**: Surrogate DNNs enable single-pass traveltime evaluation for new sources, and transfer learning accelerates iterative inversion cycles [2101.11840, 2007.08330].

## 6. Limitations and Future Directions

Despite their advantages, NESs face specific limitations:

- **Convergence in high-heterogeneity or sharp-contrast regimes**: PINN-based NESs require careful factoring and may need multi-stage adaptive optimization schemes [2101.11840, 2007.08330, 2407.16439].
- **Hyperparameter and architecture tuning**: Network capacity, collocation sampling, and learning rates must be selected for each problem class [2205.07989, 2101.11840].
- **Theoretical guarantees**: Rigorous error bounds and stability results for neural PDE solvers remain an active research area.
- **Optimal data sampling**: Adaptive refinement and meta-learning protocols are under development to maximize sample efficiency [2505.16035].
- **Extension to viscosity solutions and non-Euclidean metrics**: Current NESs focus on first-arrival (shortest) solutions, with research ongoing in distinguishing physically relevant solutions in the presence of multipaths and viscosity effects [2205.07989, 2505.16035].

Ongoing work explores scalable, meta-learned NESs for extremely high-dimensional, multi-geometric, and hybrid inverse problems; integration of explicit PDE residuals as auxiliary loss (PINN-style); and robust solvers for anisotropic, attenuating, or topographic domains [2407.16439, 2505.16035].

## 7. Comparative Summary of Methods and Empirical Performance

| NES Variant and Reference                        | Key Features               | Scalability        | Typical Relative Error       | Special Capabilities                        |
|--------------------------------------------------|----------------------------|--------------------|-----------------------------|---------------------------------------------|
| Deep Eikonal Solver [1903.07973]                 | Neural local solver in FMM | O(N log N)         | 2–3× lower than FMM         | Surfaces, complex geometries                |
| EikoNet [2004.00361]                             | Grid-free, two-point PINN  | $>10^6$ queries/s  | RMS error ≈ FMM (0.03–0.04) | Continuous, multipathing, 3D, GPU           |
| PINNeik [2007.08330]                             | PINN w/ factored form      | Mesh-free          | <1% in 2D smooth models     | Anisotropy, topography, transfer, surrogate |
| Neural Eikonal Solver [2205.07989]               | Bounded factorizations,    | 2D/3D, minutes     | 0.1–0.9% (Marmousi)         | Handles caustics, compact two-point DFN     |
| PINNPStomo [2407.16439]                          | New factorization, twin NN | 2D/3D, tomography  | ≤5% in Overthrust, Marmousi | Joint P/S-wave inversion, no v₀ dependence  |
| Equivariant NES [2505.16035]                     | Equivariance, meta-learn   | Homogeneous spaces | RE 1–3% (OpenFWI 2D classes)| Arbitrary manifolds, steerable, meta-adapt  |

NESs thus represent a unification and extension of numerical geometry, PINNs, operator learning, and geometric deep learning techniques for the Eikonal equation, offering mesh-independence, scalability, adaptability, and, with suitable architecture and loss engineering, state-of-the-art accuracy for a broad range of scientific and engineering applications.

Source: https://www.emergentmind.com/topics/neural-eikonal-solver-nes