Deep Learning for Solving Integral Equations: A Problem-Oriented Review with an Axiomatic Perspective

Abstract

This review surveys recent deep learning approaches for solving integral equations, categorizing them into three methodological families: physics-informed embedding, spectral/topological acceleration, and hybrid symbolic–numeric frameworks. The main findings are threefold. First, these methods achieve promising empirical accuracy in oscillatory, high-dimensional, and singular-kernel settings, yet their theoretical foundations remain largely incomplete. Second, from an axiomatic perspective, most approaches lack rigorous guarantees of convergence, stability, and spectral consistency; we formulate five testable propositions that a complete theory should satisfy. Third, we identify five specific unresolved theoretical questions and outline a focused research agenda toward a mathematically rigorous theory of neural operator approximation for integral equations. The novelty of this review lies in its dual computational–axiomatic evaluation and its provision of a structured, problem-oriented framework for future investigations.

1. Introduction

Integral equations appear throughout scientific computing as compact formulations of boundary value problems [1,2], inverse problems [3,4], and stochastic processes [5,6]. Classical numerical methods—the Nyström method [7,8,9], the Galerkin method [10,11,12], the collocation method [13,14,15], the method of moments (MoM) [16,17], the boundary element method (BEM) [11,18], and the finite element method (FEM) [19,20]—provide rigorous approximation guarantees for low-dimensional, smooth problems. However, they suffer from well-known limitations when applied to modern challenges: the curse of dimensionality in high-dimensional integration [21,22], numerical instability from singular kernels [23,24,25], and quadratic or higher complexity in dense matrix operations [26,27]. For example, three-dimensional electromagnetic scattering analysis using MoM often encounters memory bottlenecks due to dense matrix storage [28,29]; boundary element methods require intricate regularization for singular integrals [30,31]; and Monte Carlo techniques, while dimension-independent, converge slowly for stochastic integral equations [32,33].

Deep learning has recently been explored as a tool to address these limitations. Neural networks can approximate nonlinear functionals, adapt to data, and be combined with physical constraints through automatic differentiation. This has led to a growing body of work on neural integral equation solvers, ranging from physics-informed neural networks (PINNs) [34] that incorporate integral operators into loss functions to graph neural networks that accelerate electromagnetic scattering computations [29] to sequence-to-sequence models that discover symbolic integration rules [35]. The diversity of approaches, however, makes it difficult to compare methods, understand their relative strengths, and identify open challenges.

Several recent surveys have covered related terrain. Hao et al. [36] and Salvatore et al. [37] reviewed physics-informed machine learning broadly, while Goswami et al. [38] focused on neural operator methods. The seminal DeepONet work [39] established the theoretical foundation for learning solution operators of differential and integral equations, which is highly relevant to our discussion. These works, however, do not specifically target integral equations, nor do they provide a structured comparison of how different neural architectures handle the distinctive difficulties of integral formulations (e.g., singular kernels and global coupling).

This review has two linked objectives. First, it synthesizes recent deep-learning-based methods for solving integral equations through a problem-oriented framework covering oscillatory, high-dimensional, singular-kernel, and coupled-system settings. Second, and more importantly for the present journal, it examines the extent to which these methods admit a coherent axiomatic interpretation. We therefore ask not only which architectures perform well empirically but also which assumptions on operator regularity, kernel smoothness, spectral decay, approximation spaces, and training procedures are required before claims about efficiency, stability, or convergence can be made precise. Under this framing, the review contributes not merely a catalogue of methods, but a mathematically motivated agenda for connecting neural integral solvers with operator theory, approximation theory, and numerical analysis.

The paper is organized as follows. Section 2 presents the mathematical background and an axiomatic perspective. Section 3 describes the literature search and selection criteria. Section 4 details the three methodological families. Section 5 examines how these families address core computational challenges and critically discusses their limitations. Section 7 identifies open problems and emerging research directions. Section 8 concludes. The article is intended for interdisciplinary researchers who seek a structured entry point into the field, as well as for specialists interested in unresolved theoretical and practical issues.

2. Mathematical Foundations and an Axiomatic Perspective

Integral equations can be viewed as operator equations in Banach or Hilbert spaces [11]. Before reviewing deep learning methods, we recall classical mathematical formulations that provide a foundation for understanding neural approximation. This section does not propose new results but establishes notation and highlights axiomatic principles that a rigorous theory of neural integral solvers would need to respect.

2.1. Operator Formulation of Integral Equations

Let X and Y be Banach spaces of functions on a domain $\mathsf{\Omega }\subseteq {\mathbb{R}}^d$. A linear integral equation of the second kind [11] is written as

$$u\left(x\right)-\lambda {\int }_{\mathsf{\Omega }}K(x,y)u\left(y\right)dy=f\left(x\right),x\in \mathsf{\Omega },$$

(1)

or in operator form $(\mathcal{I}-\lambda \mathcal{K})u=f$, where $\mathcal{K}:X\to Y$ is the integral operator with kernel K. Under mild conditions (e.g., $K\in L^2(\mathsf{\Omega }\times \mathsf{\Omega })$), $\mathcal{K}$ is compact. The Fredholm alternative then provides a complete characterization of solvability: either $1/\lambda$ is not an eigenvalue of $\mathcal{K}$ and a unique solution exists for every f, or it is an eigenvalue and solvability requires orthogonality conditions [11].

For nonlinear integral equations (e.g., Urysohn [40] or Hammerstein [41,42]), the operator is nonlinear, but fixed-point theorems [43] (Schauder and Banach) guarantee existence under Lipschitz or compactness assumptions. These classical results are axiomatic in that they rely on abstract properties (compactness, continuity, and contractivity) rather than explicit kernel forms. Any neural solver aiming for provable guarantees must either preserve these properties or work in settings where they are relaxed.

Conventions and notation. Throughout this section, $\mathsf{\Omega }\subset {\mathbb{R}}^d$ is a bounded domain and $X=Y=L^2\left(\mathsf{\Omega }\right)$ unless stated otherwise. The norm $\parallel ·\parallel$ denotes the $L^2\left(\mathsf{\Omega }\right)$-norm. The symbol N is reserved for the number of degrees of freedom (collocation points, basis functions, or training samples, depending on context); d is the spatial dimension; and m denotes the order of differentiability of the kernel. Asymptotic statements $f\left(N\right)=O\left(g\right(N\left)\right)$ are understood as $N\to \infty$. For a compact operator, the numerical rank $r_{\epsilon }$ at threshold $\epsilon >0$ is the number of singular values larger than $\epsilon$. The term “with high probability” refers to the probability taken over the random draw of training data and/or problem instances, as specified in each proposition.

2.2. Axiomatic Requirements for Neural Approximants

A neural network ${\mathcal{N}}_{\theta }$ that approximates the solution operator $f\mapsto u$ should ideally satisfy: (i) Consistency: As the network capacity (e.g., number of parameters) increases, the approximation error should converge to zero in a suitable norm. (ii) Stability: Small perturbations in the input f or the kernel K should lead to controlled changes in the output (Lipschitz continuity with respect to data). (iii) Spectral correctness: If $\mathcal{K}$ is self-adjoint and compact, the neural approximation should preserve the sign and decay of its eigenvalues (e.g., a non-negative spectrum for positive-definite kernels).

Classical projection methods (Galerkin and collocation) satisfy these axioms by construction: they project the infinite-dimensional problem onto finite-dimensional subspaces and inherit stability from the well-posedness of the original equation. Neural methods, however, are nonlinear parameterizations and do not automatically inherit these properties. For example, the composition of nonlinear activations may violate compactness, and empirical risk minimization may not enforce spectral constraints.

2.3. Approximation Theory for Neural Operators

The universal approximation theorem [44,45] states that feedforward networks can approximate any continuous function on a compact set arbitrarily well. However, it says nothing about the rate of convergence or about the generalization to families of functions defined by integral equations. For operator learning (mapping functions to functions), a more appropriate framework is the concept of n-widths [46]. A comprehensive theoretical treatment of neural operators, including approximation error bounds and relations to classical numerical analysis, is provided by Kovachki et al. [47]. A concrete realization of neural operator learning is the DeepONet architecture [39], which rigorously proves that neural networks can approximate nonlinear operators to arbitrary accuracy, mirroring the classical universal approximation theorem but for mappings between function spaces. The Kolmogorov n-width of a compact set $\mathcal{F}$ in a Banach space X is

$$d_n(\mathcal{F},X)=\underset{\begin{array}{c}{X}_n\subset X\\ dim{X}_n=n\end{array}}{inf}\underset{f\in \mathcal{F}}{sup}\underset{g\in X_n}{inf}{\parallel f-g\parallel }_X.$$

(2)

It quantifies the best possible linear approximation error [48]. Neural networks, being nonlinear approximators, can potentially achieve smaller errors than linear methods for certain function classes (e.g., Barron spaces [49]). For integral equations, the solution set $\{u={(\mathcal{I}-\lambda \mathcal{K})}^{-1}f:\parallel f\parallel \le 1\}$ inherits regularity from the kernel. When K is smooth, the solution is smooth, and linear methods (spectral [50] or finite element) are nearly optimal. When K is rough or oscillatory, neural networks may offer advantages, but rigorous upper bounds on $d_n$ for neural approximation of integral operators are largely missing. This is a key axiomatic gap that future research should address.

2.4. Relevance to the Review

The remainder of this review adopts a problem-oriented perspective, categorizing methods by how they handle high frequencies, high dimensions, and singular kernels. The axiomatic viewpoint introduced here serves as a lens for critically assessing the literature: we will ask whether a given method provides convergence guarantees, stability bounds, or spectral consistency. As we shall see, most current approaches are empirical; only a few provide partial theoretical results (e.g., Zappala [51] proves convergence for a spectral neural method under strong smoothness assumptions). The field is far from a complete axiomatic theory, and we highlight this as a major open problem.

2.5. A Propositional Axiomatic Framework for Neural Integral Solvers

General assumptions for the propositions. In the following, we consider a linear integral equation $(\mathcal{I}-\lambda \mathcal{K})u=f$ with a compact operator $\mathcal{K}:L^2\left(\mathsf{\Omega }\right)\to L^2\left(\mathsf{\Omega }\right)$. The neural approximant ${\mathcal{N}}_{\theta }$ maps data f to an approximate solution. All propositions are formulated as desiderata for a rigorous theory; they are not claimed as theorems. Unless otherwise specified, limits are taken as the number of degrees of freedom $N\to \infty$.

Proposition 1 (Operator Class Consistency).

Let $\mathcal{K}$ be compact and λ not an eigenvalue of $\mathcal{K}$. Any neural approximant ${\mathcal{N}}_{\theta }$ that claims to solve $(\mathcal{I}-\lambda \mathcal{K})u=f$ should satisfy that, for sufficiently large N, the operator $\mathcal{I}-\lambda {\mathcal{N}}_{\theta }$ is invertible on a subspace of $L^2\left(\mathsf{\Omega }\right)$ whose dimension is at least the ε-numerical rank $r_{\epsilon }\left(\mathcal{K}\right)$ with $\epsilon =O\left(N^{-1}\right)$. Moreover, the condition number of $\mathcal{I}-\lambda {\mathcal{N}}_{\theta }$ on that subspace should remain bounded independently of N.

Proposition 2 (Kernel Regularity Hierarchy).

Assume $K\in C^m(\mathsf{\Omega }\times \mathsf{\Omega })$ with $m\ge 0$. Then a neural solver trained with N samples should achieve a convergence rate

$$\parallel u-u_{\theta }{\parallel }_{L^2\left(\mathsf{\Omega }\right)}=O\left(N^{-m/d}\right)\mathrm{as}N\to \infty ,$$

matching the minimax rate for classical linear approximation. If K is weakly singular, i.e., $K(x,y)\sim {|x-y|}^{-\alpha }$ with $0<\alpha <d$, the rate should be expressed in terms of α and the regularity of the solution, typically $O\left(N^{-(d-\alpha )/d}\right)$ for suitably designed networks.

Proposition 3 (Spectral Decay Preservation).

Let $\mathcal{K}$ be self-adjoint, compact, and positive definite with eigenvalues $\left\{{\mu }_j\right\}$ satisfying ${\mu }_j=O\left(j^{-p}\right)$ for some $p>0$. Let $\left\{{\widehat{\mu }}_j\right\}$ be the eigenvalues of the neural approximation ${\mathcal{K}}_{\theta }$, ordered decreasingly. Then for any j up to the numerical rank $r_{\epsilon }\left(\mathcal{K}\right)$ (with $\epsilon \to 0$ as $N\to \infty$), one should have

$$|{\widehat{\mu }}_j-{\mu }_j|\le {ϵ}_j,{ϵ}_j=o\left({\mu }_j\right),$$

and the sign pattern must be preserved: $sgn\left({\widehat{\mu }}_j\right)=sgn\left({\mu }_j\right)$ for all j. The bound should hold uniformly in j on any compact subset of indices.

Proposition 4 (Stability Under Perturbation).

Let $u_{\theta }$ be the neural solution for data f, and $u_{\theta }^{\delta }$ the solution when f is perturbed to $f^{\delta }$ with $\parallel f-f^{\delta }{\parallel }_{L^2\left(\mathsf{\Omega }\right)} \le \delta$. Then the solver should satisfy

$$\parallel u_{\theta }-u_{\theta }^{\delta }{\parallel }_{L^2\left(\mathsf{\Omega }\right)} \le C\delta ,$$

where C is independent of θ and δ, and C does not exceed the condition number of ${(\mathcal{I}-\lambda \mathcal{K})}^{-1}$ by more than a constant factor.

Proposition 5 (Uncertainty Calibration).

Assume the training data consist of i.i.d. draws from a distribution over pairs $(f,u)$. For a neural solver that outputs a point prediction $\widehat{u}\left(x\right)$ and an uncertainty estimate ${\sigma }_{\theta }\left(x\right)$, calibration requires that for any predetermined miscoverage level $\alpha \in (0,1)$,

$${\mathbb{P}}_{(f,\mathit{data})}\left(|u\left(x\right)-\widehat{u}\left(x\right)|\le 2{\sigma }_{\theta }\left(x\right)\right)\ge 1-\alpha$$

for almost every $x\in \mathsf{\Omega }$, asymptotically as the number of training samples tends to infinity. The probability is taken over the random draw of training data and the random instance f. The constant 2 in the inequality may be replaced by a suitable quantile of the error distribution; the essential requirement is that the predicted intervals achieve the nominal coverage level $1-\alpha$.

These propositions are deliberately challenging—no existing neural integral solver satisfies all of them. They serve as a benchmark for future theoretical developments and as a checklist for evaluating claims of provable or guaranteed performance in the literature.

Theoretical status of current methods. The gap between these ideal requirements and the current literature is substantial. To date, rigorous convergence and stability guarantees have been obtained only in very restricted settings: for instance, under the strong assumption that the integral kernel is $C^{\infty }$ and the network architecture is explicitly aligned with the eigenfunctions of the operator [51]. In general, the following assumptions are necessary for a theoretical guarantee but are seldom verified in practice:

• Compactness and well-posedness: $\mathcal{K}$ is compact and $\lambda$ is not an eigenvalue so that ${(\mathcal{I}-\lambda \mathcal{K})}^{-1}$ exists and is bounded.
• Kernel regularity: K is sufficiently smooth (e.g., $K\in C^m$ with $m\ge 1$) or possesses a low-rank structure, which controls the approximation error.
• Data coverage: The training set is dense enough to capture the relevant function class, and the samples are drawn from the appropriate distribution.
• Optimization convergence: The training algorithm converges to a global minimum of the loss functional, avoiding local minima that do not correspond to accurate solutions.
• Capacity scaling: The network size grows appropriately with the problem dimension and the desired accuracy, without overfitting or underfitting.

Absent these assumptions, the reported performance of neural solvers remains empirical rather than mathematically proven. Consequently, the vast majority of studies reviewed in this article provide only experimental evidence, and the field as a whole still lacks a comprehensive theoretical foundation.

Throughout the remainder of this review, we assess the extent to which current methods approximate these ideal properties, and we identify which propositions remain completely unaddressed by existing work.

3. Survey Methodology

The search and screening process described below was informed by selected elements of the PRISMA 2020 statement [52]; however, this article is a narrative review rather than a formal systematic review, and therefore does not include a PRISMA flow diagram or checklist.

Search strategy. We searched Scopus, Web of Science, IEEE Xplore, and the ACM Digital Library for studies published between January 2019 and May 2026. The search combined the terms “integral equation”, “Fredholm”, “Volterra”, “boundary integral”, “neural network”, “deep learning”, “physics-informed”, “graph neural network”, and “operator learning”. Preprints from arXiv were considered only if they contained unique technical content not yet available in a peer-reviewed venue; such cases are explicitly noted in the text.

Eligibility criteria. Studies were included if they (i) addressed an integral, integro-differential, or stochastic integral equation; (ii) proposed a learning-based solver, acceleration method, or theoretical analysis; and (iii) provided sufficient quantitative or theoretical evidence for comparison. We excluded works focusing solely on differential equations without an integral formulation, papers lacking methodological novelty, and non-archival abstracts.

Screening and data extraction. Two reviewers independently screened titles and abstracts; disagreements were resolved through discussion. Full texts of potentially relevant articles were then examined against the eligibility criteria. From each included study, we extracted information on the proposed method, problem type, reported performance metrics, and theoretical guarantees.

To organize the diverse literature, we adopted a problem-oriented perspective rather than a rigid taxonomy. Specifically, we examined how deep learning methods address three fundamental challenges that limit classical solvers:

• High-frequency oscillations: Solutions that vary rapidly in space or time require methods that avoid spectral bias.
• High-dimensional integration: Exponential growth of cost with dimension demands sub-exponential or linear scaling.
• Singular-kernel resolution: Near-discontinuities or weakly singular kernels cause numerical instability.

Within each challenge, we compared the effectiveness of the three methodological families introduced in Section 4. This perspective allowed a critical appraisal of where each family excels and where it struggles, without imposing a preconceived framework.

All quantitative performance statements (e.g., speedups and error reductions) were taken directly from the original publications, accompanied by their citations. We did not perform independent benchmarking, nor did we average or re-normalize numbers from different sources. When contradictory results existed across studies, we noted them explicitly.

Caveat on quantitative comparisons. All performance figures cited in this review (accuracy, convergence rates, speedups, and memory usage) are reproduced as reported by the original authors and have not been independently verified on a common benchmark. The absence of a standardized evaluation protocol means that direct numerical comparisons across different studies are inherently tentative. Readers should interpret such numbers within the context of the specific test problems, hardware, and implementation details described in the respective publications.

Remark on taxonomy. The three-family taxonomy adopted in this review is based on the dominant computational strategy (physics-informed embedding, spectral/topological acceleration, and hybrid symbolic–numeric frameworks). We recognize that the surveyed methods can also be categorized along other dimensions, including equation type (Fredholm, Volterra, and integro-differential), kernel regularity (smooth, weakly singular, and oscillatory), or neural architecture (MLP, graph neural network, transformer, and operator network). Although a full multidimensional classification is beyond the scope of a single review, the challenge-oriented analysis presented in Section 5 implicitly captures distinctions in kernel properties and equation types, while the architectural choices are highlighted throughout the methodological descriptions. Future systematic reviews may benefit from a formal cross-tabulation of these dimensions.

4. Methodological Taxonomy

Classification criteria and rationale. We define three methodological families according to the dominant computational principle used to handle the integral operator:

• Physics-informed embedding relies on a loss function that directly encodes the integral equation residual, typically via automatic differentiation, and does not require large external training sets.
• Spectral/topological acceleration exploits a transformation of the solution space—such as eigenfunction expansions, Fourier representations, or graph discretizations—to reduce dimensionality or memory footprint.
• Hybrid symbolic–numeric frameworks tightly couple neural networks with symbolic computation, classical iterative solvers, or quantum-inspired components, where the non-neural part is essential to the solver’s functioning.

When a study combines elements from multiple families (e.g., a physics-informed loss with a spectral architecture), we assign it to the family that provides the primary mechanism for solving the integral equation. This taxonomy is deliberately problem-oriented rather than architecture-oriented: it foregrounds the mathematical strategy used to overcome the intrinsic difficulties of integral formulations, thereby helping the reader assess which class of methods is most suitable for a given challenge.

Research on deep learning for integral equations has converged around three methodological families. This section describes each family’s core ideas, representative implementations, and reported performance characteristics as documented in the literature. A critical discussion of limitations follows each subsection.

4.1. Physics-Informed Embedding

Physics-informed neural architectures embed integral operators directly into the network’s loss function or architecture, aiming to enforce physical consistency without requiring large training datasets.

Green’s function embedding. For a linear integral equation with kernel $K(x,y)$ satisfying the Fredholm alternative [53], the Green’s function $G(x,y)$ exists and is unique when $\lambda$ is not an eigenvalue of $\mathcal{K}$. It satisfies $(\mathcal{I}-\lambda \mathcal{K})G(·,y)={\delta }_y$ in the distributional sense [11]. Classical results guarantee that G is continuous if K is weakly singular and the domain is sufficiently smooth. Physics-informed neural methods aim to approximate G by minimizing a residual loss; however, they do not explicitly enforce the Fredholm conditions, which may lead to spurious solutions when $\lambda$ is near an eigenvalue [54]. The physics-informed iterative neural network encodes Green’s function propagation into network constraints by translating conjugate gradient iterations into parameter updates [28]. For Ku-band antenna design, the authors report 95% accuracy with a fivefold acceleration over traditional solvers [28]. A key advantage is the reduction in training data requirements—approximately 80% less than purely data-driven models. However, the same study notes that accuracy degrades by 25% when applied to millimeter-wave (mmWave) frequencies, indicating sensitivity to the frequency range [55].

Boundary integral networks. The boundary integral neural network (BINN) [30] reduces the problem dimensionality by reformulating partial differential equations as boundary integral equations. For three-dimensional elasticity problems, BINN decreases degrees of freedom by 70% compared to volume discretizations. The authors report relative errors around 0.03 for smooth geometries. Limitations include a 15–20% computational overhead from enforcing boundary constraints and a reported 40% accuracy degradation on fractal boundaries [31].

Geometry-adaptive networks. NURBS-parameterized networks [31] combine geometric transformations with neural approximation, achieving 99% consistency with analytical Laplace equation solutions for crack propagation problems. For isotropic materials, the reported relative error is 0.007. However, when applied to anisotropic composites—which introduce directional dependence—accuracy drops to approximately 70%, illustrating the challenge of generalizing beyond the training geometry distribution.

Critical limitations across physics-informed methods. Despite these advances, physics-informed embedding faces three persistent issues: (i) empirical tuning of loss weights, with no consensus on optimal strategies; (ii) difficulty handling multi-scale features without specialized architectures; and (iii) limited theoretical guarantees of convergence rates. Hybrid approaches that adaptively learn loss weights [56] show promise but remain in early stages.

4.2. Computational Topology Innovation

Spectral and topological methods aim to overcome dimensional and frequency barriers through mathematical transformations of the solution space [50,57].

Spectral neural frameworks. For a compact self-adjoint operator $\mathcal{K}$ on a Hilbert space, the spectral theorem guarantees the existence of an orthonormal basis $\left\{{\varphi }_j\right\}$ of eigenfunctions with eigenvalues ${\mu }_j\to 0$ such that $\mathcal{K}u={\sum }_j{\mu }_j\langle u,{\varphi }_j\rangle {\varphi }_j$. The resolvent operator ${(\mathcal{I}-\lambda \mathcal{K})}^{-1}$ can be expressed via the eigenexpansion, and the solution is $u={\sum }_j{\displaystyle \frac{1}{1-\lambda {\mu }_j}}\langle f,{\varphi }_j\rangle {\varphi }_j$. Spectral neural methods [51] aim to learn a finite-rank approximation by truncating this expansion, i.e., replacing $\mathcal{K}$ by ${\mathcal{K}}_{N}u={\sum }_{j=1}^N{\widehat{\mu }}_j\langle u,{\widehat{\varphi }}_j\rangle {\widehat{\varphi }}_j$, where ${\widehat{\mu }}_j$ and ${\widehat{\varphi }}_j$ are neural-network-approximated eigenpairs. The approximation error is bounded by the decay rate of the eigenvalues; for smooth kernels, eigenvalues decay exponentially, while for less smooth kernels, only algebraic decay holds. The spectral neural approach [51] maps integral operators to the frequency domain, truncating noise bands while preserving relevant frequencies. The authors prove a theoretical convergence guarantee and demonstrate an order-of-magnitude improvement in interpolation accuracy for oscillatory kernels. Another influential spectral approach is the Fourier neural operator (FNO) [58], which parameterizes the integral kernel in Fourier space and achieves linear complexity for a wide class of PDEs and integral equations. A related method separates electromagnetic field components to capture wavelength-scale features in two-dimensional scattering problems [59].

Graph-based discretizations. GraphSolver [29] represents Rao–Wilton–Glisson (RWG) basis relationships as graph edge weights, enabling memory-efficient electromagnetic scattering analysis. For aircraft-scale targets, the authors report memory usage reduced to 20% of traditional MoM requirements, with a 12-fold speedup. The PhiGRL extension [60] adapts node connectivity for unstructured meshes, demonstrating transfer learning across missile warhead geometries. A limitation noted by the authors is a 220% increase in training time compared to baseline MoM, which may offset runtime gains for one-off simulations.

Tensor decomposition methods. TensorFlow-based residual networks [61] decompose multidimensional kernels into low-rank products, achieving linear complexity scaling for 10-dimensional Fredholm equations. The reported relative error is 0.045 on a benchmark problem, compared to 0.12 for Monte Carlo. Gaussian quadrature acceleration [62] combined with parallel compression triples approximation speeds for Fredholm operators. ReLU-based Monte Carlo sampling [63] controls statistical and approximation errors in Urysohn equations. A common limitation across tensor methods is the need to know or approximate the kernel’s rank structure a priori.

4.3. Hybrid Paradigm Breakthroughs

Hybrid methods combine neural networks with symbolic computation, iterative solvers, or quantum-inspired components to leverage complementary strengths.

Symbolic–numeric fusion. Transformer models have been applied to derive integration rules directly from expressions. As a related advance in symbolic computation [35] applied a sequence-to-sequence model to discover indefinite integrals, achieving 90% accuracy on a held-out test set. Although this work targets symbolic integration rather than the solution of integral equations, it illustrates the potential of neural symbolic methods for integration-related tasks. Another approach [64] uses transformers for symbolic integration, though the authors note that accuracy on unseen expressions remains below 70%.

Quantum-enhanced hybrids. Preliminary explorations have considered quantum computing for high-dimensional integration tasks but to date, no peer-reviewed study has demonstrated a reproducible, asymptotic quantum advantage for solving integral equations. Claims of quantum-inspired acceleration should be interpreted as referring to classical algorithms that borrow concepts from quantum information, not to genuine quantum hardware implementations with proven speedups. Readers are cautioned against extrapolating early proof-of-concept results to practical-scale problems.

Iterative neural networks. The physics-informed iterative neural network [28] transforms conjugate gradient mechanics into parameter updates, accelerating combined field integral equation (CFIE) solutions by a factor of five as reported. Gated recurrent unit (GRU) networks [65] convert integral equations into sequential tasks via Monte Carlo discretization, stabilizing convergence for Fredholm equations. Reinforcement learning frameworks [66] optimize light transport integrals through dynamic sample generation, improving rendering efficiency by 50% via policy-guided loss design. A common criticism is that these hybrid models introduce additional hyperparameters (e.g., the number of inner iterations and the learning rate for the symbolic component) with no established tuning guidelines.

4.4. Summary of Methodological Families

Table 1. Comparative summary of methodological families based on literature reports.

Method Family	Reported Strengths	Reported Limitations
Physics-Informed	High accuracy for smooth problems (95%) a; Reduced data needs (80%) b	Frequency sensitivity (25% error increase at mmWave) a; Geometry dependence c
Spectral/Topological	Linear complexity for 10D problems d; Memory efficiency (80% reduction) e	Training overhead (220% increase) f; Phase errors for non-smooth solutions g
Hybrid	Reported 5× time reduction on small-scale quantum hardware (proof-of-concept) h; Adaptive loss balancing h	Noise sensitivity (0.3% per qubit); results not independently replicated h; Hyperparameter complexity h

Notes: ^a Reported by [28] for Ku-band antenna design. ^b Reported by [28] compared to data-driven models. ^c Reported by [31] for anisotropic vs. isotropic materials. ^d Reported by [61] for a 10D Fredholm equation. ^e Reported by [29] for aircraft scattering analysis. ^f Reported by [51] for non-smooth test cases. ^g Reported by [67] for a 10D quantum simulation. ^h Reported by [56] for adaptive loss weighting in PINNs.

summarizes the reported strengths and limitations of each family based on the literature surveyed. No single family dominates across all problem types; the choice of method depends on the specific computational challenge, as will be analyzed in Section 5.

Beyond the application-specific strengths and limitations summarized above, a deeper analytical comparison requires examining how each family performs along five fundamental dimensions that are central to the axiomatic perspective introduced in Section 2: the class of operators they can handle, the required regularity of the integral kernel, their computational complexity, the nature and strength of convergence evidence, and whether they provide uncertainty quantification.

Table 2. Systematic comparison of methodological families across five analytical dimensions.

Dimension	Physics-Informed Embedding	Spectral/Topological	Hybrid Symbolic–Numeric
Operator class	Fredholm/Volterra of 2nd kind; assumes existence of Green’s function	Compact self-adjoint operators; spectral theorem required	General operators; often restricted to specific structures (e.g., separable kernels)
Kernel regularity	Smooth or weakly singular; geometry-adaptive variants handle boundary singularities	Smooth enough for eigenfunction decay; Fourier methods require periodicity	Varies by component; symbolic part typically requires analytic forms
Complexity (asymptotic)	$O\left(N^2\right)$–$O\left(N^3\right)$ for dense quadrature; geometry reduction can lower to $O\left(N^{4/3}\right)$–$O\left(N^{5/3}\right)$	$O(NlogN)$–$O\left(N^2\right)$ depending on spectral truncation; tensor methods achieve near-linear in dimension	$O(NlogN)$–$O\left(N^2\right)$; quantum components claim $O\left(\mathrm{poly}\right(logN\left)\right)$ but with large constants
Convergence evidence	Empirical for most; rigorous only for linear problems with strong smoothness assumptions [51]	Spectral methods: proven exponential convergence for analytic kernels [51]; graph methods: empirical only	Empirical; symbolic integration correctness ≈ 90% for seen expressions; no convergence proofs for hybrid
Uncertainty quantification	Rarely addressed; some studies use ensemble methods informally	Not addressed in surveyed literature	Not addressed; quantum components introduce distinct noise characterization challenges

Notes: Complexity refers to reported or inferred asymptotic scaling with number of degrees of freedom N or dimension d; $O(·)$ denotes upper bounds as reported in original studies. UQ refers to systematic uncertainty quantification (e.g., confidence intervals, Bayesian inference, and conformal prediction).

organizes the three methodological families along these dimensions based on the available literature.

As Table 2 illustrates, no methodological family excels across all five dimensions. Physics-informed embedding methods are the most broadly applicable in terms of operator class and kernel regularity but offer the weakest theoretical convergence guarantees and essentially no uncertainty quantification. Spectral and topological methods provide stronger theoretical foundations—including proven exponential convergence for analytic kernels—but are restricted to compact self-adjoint operators and smooth kernels. Hybrid methods promise the greatest flexibility and potentially favorable complexity, yet they currently lack any convergence proofs and introduce additional sources of uncertainty (e.g., from quantum components). This systematic comparison reinforces the central argument of this review: the field is computationally promising but remains mathematically under-founded, particularly in terms of convergence guarantees and uncertainty quantification.

5. Addressing Core Challenges: A Critical Appraisal

Classical integral equation solvers struggle with three fundamental challenges: high-frequency oscillations, high-dimensional integration, and singular-kernel resolution. This section examines how the methodological families described in Section 4 address each challenge, based on evidence reported in the literature. Rather than presenting new benchmark results, we critically compare reported findings, highlight contradictions where they exist, and identify unresolved issues.

5.1. High-Frequency Oscillations

Solutions to integral equations that oscillate rapidly in space or time pose a well-known difficulty for standard neural networks due to spectral bias, i.e., the tendency to learn low-frequency components first. Several specialized architectures have been proposed to mitigate this issue.

High-frequency oscillations correspond to solutions whose Fourier transform is supported on high wavenumbers. For an integral operator with a kernel that is not smoothing (e.g., the identity operator or a singular kernel), the solution u may contain frequency components up to the Nyquist limit of the discretization. The Nyquist–Shannon sampling theorem states that to resolve a frequency $\nu$, one needs at least $2\nu$ samples per dimension [68]. For integral equations in d dimensions, this leads to a sample complexity of ${\left(2\nu \right)}^d$, which is the root of the curse of dimensionality for oscillatory problems. Neural methods try to bypass this via spectral bias: networks learn low frequencies first [69], requiring specialized architectures (Fourier features, multi-scale) to represent high frequencies. However, no known neural architecture can achieve sub-exponential scaling in $\nu$ without exploiting additional smoothness or sparsity.

Multi-scale PINNs [70] embed spatial features at multiple resolutions using Fourier feature mappings. For scattering problems in the 1–10 GHz range, the authors report a normalized mean absolute error (MAE) of 0.018, compared to 0.035 for standard PINNs and 0.021 for MoM. In the 10–100 GHz range, the reported MAE for multi-scale PINNs increases to 0.067, while MoM reaches 0.153. Above 100 GHz, multi-scale PINNs achieve 0.159 versus MoM’s 0.412. The authors attribute the improvement to frequency decomposition, though they note that performance degrades when the frequency content spans more than three decades.

An alternative spectral-graph neural network [51] operates directly in the frequency domain by truncating noise bands. For the same test problems, the authors report MAEs of 0.015 (1–10 GHz), 0.042 (10–100 GHz), and 0.098 (>100 GHz). The frequency-domain approach appears to maintain lower error at high frequencies than multi-scale spatial methods, but the two studies use different test geometries, making direct comparison tentative.

A common limitation across both approaches is the lack of theoretical guidance on how to choose the number of frequency bands or the truncation threshold. Additionally, reported performance often depends on the specific test geometry; results on spheres may not generalize to sharp-edged objects. No study to date has systematically compared these methods on a common benchmark suite, so claims of superiority should be treated as preliminary. A practical open question is whether multi-scale methods can be combined with spectral truncation to further improve performance.

5.2. High-Dimensional Integration

The exponential growth of computational cost with dimension—the curse of dimensionality—limits classical quadrature and Monte Carlo methods for integral equations in dimensions beyond five or six. Neural methods aim to exploit low-rank structures or adaptively sample the domain.

The curse of dimensionality for multivariate integration can be quantified by the worst-case error of quadrature rules. For a function of d variables with bounded mixed derivative (Sobolev space $W^{k,\infty }$), the optimal convergence rate is $O\left(N^{-k/d}\right)$ for deterministic methods and $O\left(N^{-1/2}\right)$ for Monte Carlo. Classical results [71] show that no deterministic method can achieve a rate better than $O\left(N^{-k/d}\right)$, which is exponentially slow in d. However, if the function has additional structure—such as low effective dimension, additivity, or a sparse Fourier representation—methods like sparse grids, tensor trains, or neural networks can break this barrier. The success of tensor decomposition and Legendre networks for integral equations relies on the assumption that the integral kernel $K(x,y)$ has low-rank structure in the sense of the singular value decomposition, i.e., $K(x,y)\approx {\sum }_{j=1}^r{\sigma }_j{\varphi }_j\left(x\right){\psi }_j\left(y\right)$ with r small. This is an axiom that must be verified for the problem at hand.

Tensor decomposition methods [61] represent multidimensional kernels as low-rank products. For a 10-dimensional Fredholm equation of the second kind, the authors report a relative error of 0.045 with linear complexity scaling, compared to 0.12 for Monte Carlo. The memory footprint is reported as 4.8 GB for the neural method versus 2.1 GB for Monte Carlo, indicating a trade-off between accuracy and memory.

A tensor-WENO (weighted essentially non-oscillatory) scheme [62] combining quadrature acceleration with tensor compression achieves a relative error of 0.0003 on an eight-dimensional problem while using only 0.7 GB of memory. However, the authors note that the method requires the kernel to have a low-rank structure, which is not guaranteed for many practical problems.

Legendre polynomial networks [32] exploit basis orthogonality to achieve reported errors as low as 0.00001 on 12-dimensional financial path integral problems. The same study reports a 70% faster convergence compared to Monte Carlo. A limitation is that the Legendre basis must be truncated at a degree that grows with dimension, leading to an exponential increase in the number of basis functions unless the solution is very smooth.

A recurring theme is that each method exploits a specific structural property (low-rank, smoothness, orthogonality) that may not hold for arbitrary integral equations. There is no general-purpose high-dimensional neural solver. Furthermore, most reported results are for synthetic test problems; applications to real-world high-dimensional problems (e.g., uncertainty quantification in 20+ parameters) remain scarce. The community would benefit from a standardized set of high-dimensional test problems with varying degrees of kernel complexity.

5.3. Singular-Kernel Resolution

Singular kernels (e.g., $1/|x-y|$ in electrostatic or elastic problems) cause numerical instability and require careful regularization. Neural methods have approached this challenge through geometry-aware architectures and dimension reduction.

Singular kernels of the form $K(x,y)={|x-y|}^{-\alpha }$ for $\alpha >0$ give rise to integral operators that are not compact on $L^2$ but are bounded from $L^2$ to $L^2$ if $\alpha <d/2$. For example, the Newtonian potential in 3D has $\alpha =1$, which is less than $3/2$, so the operator is compact on $L^2$. However, the kernel is not integrable in the usual sense, and the integral must be interpreted as a principal value or as a weakly singular integral. The classical theory of singular integrals (Calderón–Zygmund [72,73]) shows that these operators are bounded on $L^p$ spaces and satisfy a Hormander condition [74]. The challenge for numerical methods is to evaluate the integral near the singularity without loss of accuracy. Geometry-adaptive methods (NURBS) essentially perform an analytic regularization by mapping the singularity to a coordinate line, which is a technique rooted in the method of stationary phase and resolution of singularities [75]. Neural methods that ignore the singularity often produce large errors unless they incorporate these analytic transformations.

The boundary integral neural network (BINN) [30] reduces the problem to boundary integrals, avoiding volume singularities. For three-dimensional elasticity with a smooth boundary, the authors report a relative error of 0.03 and a reduction in degrees of freedom by 70% compared to FEM. Convergence is reported as $O\left(N^{-2.1}\right)$, where N is the number of boundary collocation points.

NURBS-parameterized attention networks [31] combine geometric transformations with self-attention to localize singular behavior around crack tips. For isotropic materials, the reported relative error is 0.007 with a convergence rate of $O\left(N^{-3.2}\right)$. For anisotropic composites, the error increases to approximately 0.30, indicating strong dependence on material symmetry.

A residual integral solver network (RISN) [76] integrates Gaussian quadrature with fractional derivative terms, achieving a relative error of 0.015 for fractional integro-differential equations with weakly singular kernels. Convergence is reported as $O\left(N^{-1.8}\right)$.

Geometry-adaptive methods (NURBS-based) excel when the singularity location is known a priori (e.g., crack tips). For problems with moving or unknown singularities (e.g., contact mechanics), the advantage diminishes. Attention-based methods offer flexibility but require more training data. A fundamental limitation across all methods is the lack of rigorous error bounds for singular kernels; current results are empirical. Moreover, the reported convergence rates come from different test problems and are not directly comparable.

5.4. Hybrid and Coupled Systems

Many real-world problems involve integral equations coupled with differential or algebraic equations. Hybrid solvers address such multiphysics systems.

Coupled systems of integral, differential, and algebraic equations arise from multiphysics models (e.g., fluid–structure interaction). The mathematical well-posedness is often established via semigroup theory or monotone operator theory. A common technique is to rewrite the system as a single integral equation of the second kind on a product space, but this leads to a larger kernel matrix. The convergence of iterative splitting schemes (e.g., waveform relaxation) is governed by the spectral radius of a certain integral operator. Neural hybrid methods essentially learn the splitting operator or the coupling terms from data. From an axiomatic viewpoint, a rigorous analysis would require verifying that the learned coupling preserves contractivity or dissipativity properties of the original system. Most current neural hybrid solvers do not provide such verification.

A transformed field expansion method [77] for Fredholm–ODE coupling reports a relative error of 0.04 with convergence $O\left(N^{-1.8}\right)$. An attention-based Navier–Stokes integrator (ANIE) [78] achieves a relative error of 0.07 for coupled integral–differential formulations, with a convergence rate of $O\left(N^{-2.3}\right)$. The authors note that training time is approximately 3.5 times higher than a baseline without attention.

Legendre–Gauss methods [79] for Volterra–Fredholm–Hammerstein systems achieve the fastest reported convergence rate ($O\left(N^{-3.1}\right)$) by decoupling time and space. A PINN-based integral approach for capacitance extraction [80] reports a relative error of 0.01.

Hybrid methods often improve convergence at the cost of increased training complexity. The choice between spectral–temporal decoupling (Legendre–Gauss [79]) and attention-based coupling (ANIE) depends on whether the problem is dominated by smooth temporal dynamics or by long-range spatial interactions. No unified framework exists for selecting the appropriate hybrid architecture given problem characteristics.

5.5. Summary of Challenge-Specific Insights

Table 3. Summary of reported performance by challenge. Errors are normalized mean absolute errors or relative errors as reported in the original studies; ranges reflect different test problems or frequency bands.

Challenge	Best Reported Method	Reported Error (Range)	Key Limitation
High-frequency	Spectral-GNN [51]	0.015–0.098 MAE	No theoretical truncation guide
High-dimension	Legendre Net [32]	${10}^{-5}$–${10}^{-2}$	Basis explosion with dimension
Singular kernel	NURBS-Attention [31]	0.007–0.03	Prior geometry knowledge required
Hybrid systems	Legendre–Gauss [79]	0.01–0.07	Increased training complexity

synthesizes the reported performance and limitations for each challenge based on the literature. Several cross-cutting observations emerge:

• No single method dominates all challenges. Spectral methods perform well for high frequencies; tensor methods excel at high dimensions; geometry-adaptive methods are best for known singularities.
• Direct comparisons across studies are hindered by different test problems, metrics, and hardware. The field lacks a common benchmark suite.
• Many reported performance numbers come from single studies and have not been independently replicated.
• Theoretical understanding—particularly error bounds and convergence guarantees—lags behind empirical demonstrations.

These observations motivate the open problems discussed in Section 7.

5.6. Computational Scalability

While many neural operator methods claim strong performance in high-dimensional settings, published studies often lack a systematic account of computational resources. Based on the literature reviewed, we observe the following trends and gaps:

• Asymptotic complexity. Physics-informed methods typically scale as $O\left(N^2\right)$ to $O\left(N^3\right)$ due to dense quadrature, while spectral and tensor-based methods can achieve $O(NlogN)$ or near-linear scaling under low-rank assumptions. However, the constant factors are rarely reported.
• Memory footprint. Graph-based and tensor decomposition methods (e.g., GraphSolver [29] and Legendre networks [32]) report significant memory reductions relative to traditional solvers, but comparisons are often made against unoptimized baselines.
• Training time and GPU requirements. Few studies provide detailed information on GPU hardware, wall-clock training time, or energy consumption. For instance, ref. [29] notes a 220% increase in training time compared to MoM, yet GPU specifications are not disclosed. The lack of standardized reporting impedes fair comparison and practical deployment.
• Large-scale viability. To date, most neural integral solvers have been tested on problems of moderate size (up to ${10}^5$ degrees of freedom). Extrapolation to industrial-scale applications remains unverified.

We encourage future studies to report these practical metrics alongside accuracy so that researchers can better assess suitability for large-scale applications.

6. Illustrative Case Studies from the Literature

To illustrate how different deep learning methods perform in specific application domains, this section presents four representative case studies drawn from the literature. Each case highlights the method’s reported strengths, its documented limitations, and the underlying mathematical principles that explain the method’s behavior. The selection spans electromagnetic computation, mechanical analysis, financial engineering, and computational physics.

6.1. Electromagnetic Scattering: Graph-Based Acceleration

Electromagnetic scattering analysis for electrically large targets is a classical application of integral equations, typically solved via the method of moments (MoM). The computational bottleneck is the dense impedance matrix, which scales as $O\left(N^2\right)$ in memory and $O\left(N^3\right)$ in time for direct solvers.

GraphSolver [29] represents Rao–Wilton–Glisson (RWG) basis functions as nodes in a graph, with edge weights encoding electromagnetic interactions. The integral operator is thereby approximated by graph convolutions, enabling sparse representations.

The MoM impedance matrix Z has entries $Z_{mn}=\int \int {\psi }_m\left(x\right)K(x,y){\psi }_n\left(y\right)\mathrm{d}x\mathrm{d}y$, where $K(x,y)$ is the Green’s function of the Helmholtz equation. For a basis with local support, Z is not sparse but can be approximated by a sparse matrix after a suitable transformation. GraphSolver treats the sparsity pattern as the adjacency of a graph that approximates the geometry. This is analogous to the fast multipole method (FMM) [81,82] or $\mathcal{H}$-matrix compression, both of which exploit low-rank properties of K for well-separated groups of basis functions. The graph approach replaces analytic low-rank approximations (e.g., multipole expansions) with a learning-based adjacency, which may capture non-standard geometries but lacks a priori error bounds.

For aircraft-scale targets, the authors report significant acceleration and memory reduction compared to conventional MoM, with a trade-off in increased training time. The method also demonstrates transfer learning across similar geometries using PhiGRL [60]. However, the accuracy degrades for non-convex or multi-scale features, a common challenge for graph-based discretizations. The authors note that the method is best suited for repeated simulations on similar geometries, where the training cost can be amortized. A quantitative comparison of the computational performance between GraphSolver and conventional MoM is shown in Figure 1.

6.2. Mechanical Analysis: NURBS-Parameterized Networks for Crack Propagation

Fracture mechanics problems involve singular stress fields at crack tips, which require high resolution and careful regularization in traditional finite element methods.

NURBS-parameterized networks [31] combine geometric transformations with self-attention mechanisms to localize the singular behavior around crack tips. The integral equation formulation of the elasticity problem is solved by a neural network whose inputs are NURBS coordinates.

The stress field near a crack tip behaves as $\sigma \sim r^{-1/2}$, where r is the distance from the tip. This singularity is not smooth, and standard polynomial bases converge slowly. In the boundary element method, one typically enriches the basis with asymptotic crack-tip functions. NURBS (Non-Uniform Rational B-Splines) provide a way to map the physical domain with a crack to a parameter domain where the singularity becomes a coordinate line. The neural network then approximates a smooth function in the parameter domain. This is equivalent to an analytic preconditioner: the network learns a representation that factors out the singularity so that the remaining function is smooth and can be learned efficiently. The self-attention mechanism further localizes the receptive field to the crack-tip region, mimicking the idea of adaptive mesh refinement.

For isotropic materials with a known crack geometry, the method achieves very high accuracy (relative error below 0.01) and a fast convergence rate. When applied to anisotropic composites, the accuracy drops significantly (to around 70%), because the angular dependence of the singularity changes and the fixed NURBS parameterization no longer aligns with the true asymptotic expansion. The method requires a priori knowledge of crack location, limiting its use in propagation simulations. Figure 2 illustrates the performance gap between isotropic and anisotropic materials for crack-tip stress prediction.

6.3. Financial Engineering: Legendre Polynomial Networks for Derivative Pricing

Option pricing under stochastic volatility models leads to high-dimensional integral equations (e.g., the Fredholm equation for American options). Traditional methods include Monte Carlo simulation and finite difference methods, both of which face the curse of dimensionality.

Legendre polynomial networks [32] exploit the orthogonality of Legendre basis functions to approximate the integral kernel. The network’s architecture is designed to match the spectral properties of the pricing operator, enabling linear complexity scaling with dimension.

For a problem of dimension d, a straightforward tensor-product basis would have $p^d$ terms, which is exponential. However, if the kernel is of the form $K(x,y)={\sum }_{j=1}^r{\varphi }_j\left(x\right){\psi }_j\left(y\right)$ with small rank r, the solution can be represented in a separable form. The Legendre expansion is particularly efficient for functions on hypercubes because the basis is orthogonal and the coefficients decay rapidly for smooth functions. For pricing problems, the payoff function (e.g., max of assets) is not smooth, but the expectation operator (the integral kernel) smooths it out, leading to a solution with bounded mixed derivatives. The Legendre network learns the expansion coefficients for each dimension independently but with a low-rank coupling across dimensions, which is essentially a tensor decomposition. The near-linear scaling in d is achieved because the rank r is independent of d for many financial models (e.g., independent assets).

The method achieves very low relative errors (on the order of ${10}^{-5}$) for smooth payoffs and dimensions up to 12, with reported faster convergence compared to Monte Carlo. For non-smooth payoffs (e.g., digital options), the required degree of Legendre polynomials increases, reducing efficiency. The method also assumes the kernel has a low-rank structure, which may not hold for strongly correlated assets or jump-diffusion models. Figure 3 compares the computational time of the Legendre network and Monte Carlo as a function of the number of dimensions, demonstrating the near-linear scaling of the Legendre approach.

6.4. Computational Physics: Fourier-Integral Operators for Thermal Conductivity

Predicting thermal conductivity in functionally graded materials requires solving integral equations with multi-scale coefficients. Traditional finite element methods require fine meshes to resolve material gradients, leading to high computational cost.

Fourier-integral neural operators (FIE-NO) [83] embed spectral features into the network architecture, encoding the integral kernel in the Fourier domain. This allows the network to capture both slow and fast variations in material properties.

The integral operator for thermal conductivity can be expressed as a pseudo-differential operator with symbol $\sigma (x,\xi )$. In the Fourier domain, applying the operator corresponds to multiplication by $\sigma (x,\xi )$ followed by an inverse Fourier transform. When the material is graded slowly, the symbol is smooth in $\xi$ and can be approximated by a low-order polynomial, leading to a sparse representation in physical space. The Fourier-integral neural operator learns a parameterization of the symbol from data, effectively performing a learned sparse transform. This is analogous to the method of the Fourier neural operator (FNO) but adapted to the specific kernel structure of the thermal conductivity problem. The advantage is that the complexity remains linear in the number of spatial points because the Fourier transform is fast (FFT). However, the method inherits the limitations of FFT-based methods: it requires periodic or extended boundary conditions and may suffer from Gibbs phenomena for non-smooth material profiles.

For graded thermal conductivity problems, FIE-NO achieves low relative errors (below 2%) across a range of material profiles, outperforming FEM. The method maintains linear complexity with respect to the number of spatial points. Limitations include the requirement for periodic or extended boundary conditions and sensitivity to the number of Fourier modes retained. The dependence of the relative error on the number of retained Fourier modes is shown in Figure 4.

6.5. Cross-Cutting Observations: Mathematical Generalizability

The four case studies reveal several recurring mathematical themes:

• Singularity preconditioning: Methods that explicitly factor out known singularities (NURBS) or incorporate asymptotic expansions (Legendre) achieve high accuracy but lack flexibility. From an axiomatic viewpoint, they correspond to a priori knowledge of the solution’s analytic structure.
• Sparsity and low-rank structure: Both graph-based and Fourier methods exploit the fact that the integral kernel, while dense, can be approximated by a low-rank operator after a suitable transformation (graph adjacency or Fourier truncation). This is the same mathematical principle underlying the fast multipole method and $\mathcal{H}$-matrices.
• Dimension dependence: The Legendre network’s success in high dimensions relies on the existence of a low-rank separated representation of the kernel. It is not a universal remedy; for kernels without this property, the method’s complexity reverts to exponential.
• Lack of universal architecture: No single method outperforms others across all problem types. This is consistent with the no free lunch theorems for approximation: the optimal approximant depends on the function class, and there is no universal neural network that is optimal for all integral operators.

These observations lead to a fundamental question: Does there exist a neural architecture that is universally optimal for a broad class of integral operators? The answer likely requires combining multiple building blocks (spectral, graph, attention) in a problem-adaptive way. This is analogous to the concept of adaptive approximation in classical approximation theory, where the convergence rate depends on the Besov smoothness of the target function. For integral equations, an analogous smoothness class could be defined by the decay of singular values of the solution operator. Developing a theory that characterizes these classes and provides architectural guidelines is a major open problem, which we discuss further in Section 7.

7. Emerging Directions and Open Problems

The literature reviewed in Section 4, Section 5 and Section 6 reveals both progress and persistent gaps. This section identifies several emerging research directions that, in our view, merit attention from the community. Rather than presenting solutions, we highlight open problems and potential pathways, with the aim of stimulating further investigation.

7.1. Quantum-Classical Hybrid Architectures

Early exploratory studies have investigated quantum annealing for high-dimensional integral equations [67]. On small-scale synthetic instances (up to 10 dimensions) using specialized hardware, the authors report a reduction in time-to-solution relative to a classical baseline. However, these results have not been independently replicated, the problem sizes remain far below those of practical interest, and no asymptotic advantage has been established. Several critical open problems must be addressed before quantum or quantum-inspired methods can be considered viable for integral equation solving:

Open problems. (i) Can quantum amplitude amplification be used to accelerate Monte Carlo sampling for stochastic integral equations, and under what conditions would this yield a provable (rather than empirical) advantage? (ii) What classes of integral kernels admit natural sparse representations in quantum computational bases, and how does the encoding cost scale with problem size? (iii) How can error mitigation techniques (e.g., zero-noise extrapolation and probabilistic error cancellation) be adapted to integral equation solvers, and what are the resulting overheads? (iv) What constitutes a fair classical baseline for comparison (e.g., optimized tensor train methods and fast multipole methods) when evaluating quantum approaches?

7.2. Dynamic Operator Adaptation via Meta-Learning

Current neural integral solvers are typically trained once for a fixed equation family. For inverse problems or parametric studies where the integral operator changes (e.g., varying kernel function, boundary conditions, or material parameters), retraining from scratch is inefficient.

Potential approaches. Meta-learning frameworks (e.g., MAML [84] and Reptile [85]) have been applied to ordinary and partial differential equations, but their use for integral equations is unexplored. One could envision a meta-trained model that adapts to new kernel functions with few gradient steps. A key challenge is avoiding catastrophic forgetting when the operator family is diverse.

Open questions. (i) What is an appropriate meta-distribution over integral operators (e.g., kernels with varying smoothness, singularity strength, or oscillatory frequency)? (ii) How can meta-learning be combined with physics-informed losses to preserve constraint satisfaction after adaptation?

7.3. Hardware-Aware Algorithm Co-Design

Deploying neural integral solvers on edge devices or in real-time simulation pipelines requires attention to hardware constraints (memory, energy, latency). Sparse tensor cores, near-memory computing, and analog in-memory computing offer potential, but existing work has not systematically optimized integral-equation-specific kernels (e.g., singular quadrature and convolution with Green’s functions) for these accelerators. A recent effort in this direction is the parallel training framework proposed by Ren et al. [86], which demonstrates near-linear scaling on multi-GPU systems for solving large-scale integral equations, highlighting the importance of co-design between neural architectures and distributed computing infrastructure.

Opportunities. (i) Designing network architectures whose computational patterns match tensor core capabilities (e.g., block-sparse matrix multiplications). (ii) Exploiting the low-rank structure of many integral kernels to reduce memory movement. (iii) Developing mixed-precision training schemes that maintain accuracy for singular integrals.

Barriers. Lack of standardized benchmarks for hardware-aware comparison, proprietary hardware details, and the need for cross-disciplinary collaboration between numerical analysts and computer architects.

7.4. Theoretically Grounded Uncertainty Quantification

Most neural solvers output point estimates without uncertainty intervals. For safety-critical applications (e.g., aircraft scattering, crack propagation, and medical imaging), calibrated uncertainty is essential. Bayesian neural networks, deep ensembles, and conformal prediction offer possible routes, but they must preserve physical constraints.

Open challenges. (i) How to propagate uncertainty through integral operators (e.g., via Monte Carlo dropout in the spectral domain)? (ii) Can we derive error bounds that are both tight and computationally tractable for neural approximations of compact operators? (iii) What is the correct probabilistic interpretation of physics-informed losses?

7.5. Explainability and Physics Consistency Verification

Attention maps have been shown to correlate with vortex structures in fluid dynamics simulations [78], but a general framework for verifying that a neural solver respects integral equation properties (e.g., compactness of the operator, coercivity, and spectral properties) is missing.

Possible directions. (i) Adapting automated theorem proving or symbolic differentiation to generate human-readable certificates of physical consistency. (ii) Developing saliency methods specifically for integral operators (e.g., visualizing which regions of the integration domain contribute most to the solution). (iii) Using Lipschitz constants or spectral norms to bound approximation errors.

7.6. Standardized Benchmarks and Reproducible Leaderboards

A recurring theme in this review is the difficulty of comparing methods across studies due to different test problems, metrics, hardware, and implementation details. The field would benefit from a community-driven benchmark suite for integral equation solving, analogous to existing benchmarks for PDEs (e.g., PINN benchmarks and neural operator benchmarks).

Desirable features of a benchmark suite. (i) Canonical problems across 1D–10D, Fredholm/Volterra, singular/non-singular, with varying kernel types. (ii) Standardized metrics: relative error ($L_2$, $L_{\infty }$), computation time, memory usage, training epochs, and energy consumption. (iii) Multiple hardware configurations (CPU, GPU, and TPU) to assess portability. (iv) Baseline implementations (MoM, BEM, Monte Carlo) for comparison.

Community efforts. A few initial steps have been taken (e.g., the DeepXDE library includes some integral equation examples), but a systematic, peer-reviewed benchmark is yet to emerge. Organizing a challenge or competition at a conference (e.g., NeurIPS, ICLR, and ICML) could accelerate progress.

7.7. Reproducibility and Open Science

Reproducibility is increasingly recognized as a cornerstone of scientific machine learning. However, the literature on neural integral equation solvers remains fragmented in this respect. We highlight the following resources and gaps:

Publicly available datasets. At present, no large-scale, curated dataset specifically designed for benchmarking integral equation solvers exists. Most studies generate synthetic data using predefined kernels and random right-hand sides. Exceptions include the collection of boundary integral examples distributed with DeepXDE [87] and a few financial pricing datasets used in Legendre network studies [32]. The creation of a community repository covering Fredholm, Volterra, and integro-differential problems with varying regularity would be a significant contribution.

Open-source implementations. Several open-source libraries offer partial support for integral equations. DeepXDE [87] provides a physics-informed framework that can handle integral terms through custom loss functions. NeuralOperator [58] implements Fourier Neural Operators and can be adapted to integral formulations. GraphSolver [29] and the Legendre network code from [32] are available upon request. However, a unified, modular toolkit that supports multiple neural architectures and standardized evaluation protocols is still lacking.

Recommendations for community-wide initiatives.

• Establish a curated benchmark suite with canonical problems in 1–10 dimensions, including singular, oscillatory, and coupled systems, with reference solutions computed to high accuracy.
• Define standardized reporting metrics: relative $L^2$ and $L^{\infty }$ errors, wall-clock time, peak memory usage, GPU model, and number of trainable parameters.
• Organize a recurring challenge (e.g., at NeurIPS or ICLR) to track progress and foster reproducible research.
• Encourage all authors to release code, trained models, and data alongside publications, ideally with a DOI via Zenodo or similar.

Such efforts would considerably accelerate progress and improve the reliability of published results in this emerging field.

7.8. Summary of Open Problems

Table 4. Summary of emerging directions and their associated open problems.

Direction	Key Open Problem
Quantum-classical hybrids	Establishing whether and under what conditions quantum or quantum-inspired methods offer provable advantages over classical algorithms (e.g., tensor trains and FMM) for integral equations
Meta-learning for operators	Meta-distribution over kernel families and adaptation guarantees
Hardware-aware design	Co-design of architecture and hardware for singular quadrature
Uncertainty quantification	Tight, tractable error bounds for neural compact operators
Explainability	Certificates of physical consistency for integral equation solvers
Standardized benchmarks	Community-driven suite with reproducible metrics and baselines

summarizes the six directions and their key open questions. Addressing these problems will require collaboration between numerical analysts, machine learning researchers, and domain scientists. While the potential payoff is high—enabling solutions to previously intractable integral equations—the path forward is likely to involve incremental progress on multiple fronts.

8. Conclusions

This review has surveyed the rapidly growing literature on deep-learning-based integral equation solvers, organizing it into three methodological families through a problem-oriented lens. Unlike previous surveys of physics-informed machine learning or neural operators, the present work is distinguished by its exclusive focus on integral formulations and by its systematic evaluation from both computational and axiomatic standpoints.

This review shows that deep learning has opened a promising but still theoretically fragmented pathway for solving integral equations. The literature demonstrates encouraging empirical progress in oscillatory, high-dimensional, and singular-kernel settings, yet the supporting mathematical theory remains uneven and often problem-specific.

The novelty of this review is threefold. First, we provide a structured taxonomy—physics-informed embedding, spectral/topological acceleration, and hybrid symbolic–numeric frameworks—that foregrounds the mathematical strategy employed by each method rather than its architectural details. Second, we formulate five explicitly testable propositions (operator consistency, kernel regularity hierarchy, spectral decay preservation, stability under perturbation, and uncertainty calibration) that constitute a minimal axiomatic framework for a rigorous theory of neural integral solvers. These propositions serve as both a diagnostic tool for evaluating existing methods and a roadmap for future theoretical developments. Third, we identify five specific unresolved theoretical questions and propose concrete community-level actions—including a standardized benchmark suite and open-science practices—that would accelerate progress toward a mathematically coherent discipline.

From an axiomatic perspective, the central message is not simply that neural solvers can work but that the field now requires a clearer axiomatic and operator-theoretic foundation. In particular, future work should characterize admissible operator classes, identify appropriate function spaces for neural approximation, establish stability under perturbations, and separate genuinely transferable principles from architecture-specific empirical heuristics. Reframing the field in this way would move the discussion from a collection of promising computational demonstrations toward a mathematically coherent theory of neural approximation for integral operators.

To sharpen the research agenda, we identify five specific theoretical questions that remain unresolved and are critical for the mathematical foundation of neural integral solvers:

• Approximation rates for integral operators. What are the optimal n-widths for neural approximation of solution operators of Fredholm and Volterra equations, and how do they depend on kernel smoothness and domain geometry?
• Stability under kernel perturbations. Can we derive Lipschitz bounds for neural solution operators with respect to changes in the integral kernel, analogous to classical perturbation theory for compact operators?
• Spectral consistency. Under what conditions does a neural network trained with empirical risk minimization preserve the eigenvalue sign pattern and decay rate of a compact self-adjoint operator?
• Uncertainty quantification. How can we construct computationally tractable and rigorous confidence intervals for neural solutions that account for both approximation error and data noise?
• Transferability across operators. What theoretical guarantees exist for meta-learning or domain adaptation when the integral operator varies within a parametric family?

Addressing these questions would transform the field from a collection of empirical successes into a mathematically coherent discipline.

In summary, while classical discretization methods remain essential for low-dimensional, smooth problems, deep-learning-based solvers offer distinct advantages in handling high-dimensional integration, oscillatory solutions, and complex geometries, especially when augmented with physics-informed constraints and low-rank structural priors. By providing a structured overview, a critical axiomatic evaluation, and a clearly defined research agenda, this review aims to serve as both a comprehensive entry point for newcomers and a catalyst for the next generation of theoretically grounded neural integral solvers.