The results indicate that symmetrization improves approximation accuracy, while parameter tuning remains necessary.
Abstract
This paper studies symmetrized neural network (SNN) operators generated by an adjustable half-hyperbolic tangent activation function. The construction is based on the paired density kernels ℵt and ℵ1/t, whose average defines the symmetric kernel F. This kernel is positive, even, normalized, and preserves the partition of unity. Using F, we define finite-interval and whole-line SNN operators in the Banach space-valued setting. Pointwise and uniform convergence estimates are obtained through the first modulus of continuity. Higher-order and fractional approximation estimates are also derived, the latter using Caputo–Bochner fractional derivatives. The numerical part compares the nonsymmetrized operator Ln and the symmetrized operator Lns. For n=80, the uniform error decreases from 0.010463 to 0.003479, the root mean square error (RMSE) decreases from 0.006530 to 0.000826, and the coefficient of determination (R2) improves from 0.999675 to 0.999995. This improvement is accompanied by an increase in central processing unit (CPU) time from 0.014161 s to 0.027088 s. The parameter tests further show that the performance depends on the joint choice of n, t, and ξ. Overall, the results indicate that symmetrization improves approximation accuracy, while parameter tuning remains necessary.
A Banach space-valued approximation framework based on symmetrized neural network (SNN) operators generated by a deformation-dependent sigmoidal activation function, yielding a positive, even, normalized, and localized density kernel satisfying the partition of unity.
G. Anastassiou, Seda Karateke, M. Zontul· Axioms· 0 citations
We derive error bounds from empirical squared residuals for two non-monotone, mesh-free approximations of Hamilton--Jacobi--Bellman equations on unbounded spatial domains: collocation with Wendland kernels under a native space norm constraint, and physics-informed neural networks with smooth activations under a Sobolev...
A radial basis function neural network for dynamic equations on time scales using a Gaussian-type activation generated by the time-scale exponential to establish two-sided exponential bounds, uniform convergence to the classical Gaussian as the graininess tends to zero, and a localisation–admissibility condition arisin...
Mahammad Khuddush, S. Georgiev· Mathematics· 0 citations
The smallest and largest eigenvalues of the Gram matrix induced by the differential neural tangent kernel (DNTK) play a pivotal role in the analysis of over-parameterized PINNs trained by gradient type algorithms. However, a theoretical analysis of the extreme eigenvalues remains completely absent due to the challenge...
This is the first work to characterize neural network approximation error for infinite-dimensional functional inputs explicitly through the joint dimensional decay of coordinate magnitudes and directional sensitivities.
It is proved that quasi-Chebyshev parameter sets with univariate resolution $m$ generate fixed feature spaces attaining the sharp $H^r$-to-to-H^s$ approximation order for a class of analytic activations satisfying a quantitative non-cancellation condition on their Taylor coefficients.
Jia Li, Tong Mao, Jin-Chao Xu· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.