Submitted:
21 September 2025
Posted:
22 September 2025
You are already at the latest version
Abstract
Keywords:
1. Introduction
2. Mathematical Formulations
Symmetrization Method
2.1. Key Properties and Extremal Values
- 1.
- The functions and are symmetric with respect to the origin when .
- 2.
- For , the functions attain their maximum values at points that are symmetric about the origin, specifically at and respectively.
- 3.
- The maximum value is independent of the deformation parameter q and depends only on the scaling parameter λ.
2.2. Partition of Unity Property
- 1.
- The function defined in (4) is a deformed hyperbolic tangent function that approaches 1 as and -1 as .
- 2.
- The kernel is constructed as a difference of shifted versions of , specifically:
- 3.
- As , exponentially fast due to the properties of .
- 4.
- The sum forms a telescoping series that converges to 1 for all , due to the specific construction and the behavior of at infinity.
- 5.
- The same argument applies to due to the symmetry relation established in (6).
- 6.
- The result for follows directly from its definition as the average of and .
2.3. Normalization Property
- 1.
- The function approaches 1 as and -1 as .
- 2.
- The kernel is constructed as:
- 3.
- The integral of over can be shown to equal 1 by:however, this apparent contradiction is resolved by considering the proper normalization in the construction of , which ensures the integral equals 1. A rigorous proof is provided in Theorem 18.2 of [4].
- It ensures that the kernels can be interpreted as probability density functions.
- It guarantees that constant functions are preserved under convolution with these kernels.
- It is essential for proving convergence results of approximation operators constructed from these kernels.
2.4. Exponential Decay Property
- 1.
- Localization Property: The kernels and Φ are effectively localized. For large n, the sum is dominated by terms where is small, enabling efficient numerical approximations.
- 2.
- Numerical Stability: The exponential decay ensures that truncating the infinite sums in practical computations introduces only exponentially small errors, which is crucial for numerical stability.
- 3.
- Convergence Analysis: This property is fundamental for establishing convergence rates of the associated approximation operators. It allows for precise control of the tail behavior in error estimates, leading to sharp convergence results.
- 4.
- Sparse Representations: In numerical implementations, the exponential decay enables efficient sparse representations of the kernel sums, significantly reducing computational complexity from to in many cases.
- 5.
- Error Bounds: The explicit form of the decay bound (with constant T defined in (16)) provides concrete error bounds that can be used in the analysis of approximation algorithms.
2.5. Multivariate Extension via Tensor Products
2.6. Neural Network Operators
- 1.
- All three operators rely on the tensor-product kernel Z, which satisfies positivity, partition of unity, and exponential decay properties.
- 2.
- is computationally simplest, is more robust for rough functions, and allows numerical integration with controlled accuracy.
- 3.
- These operators provide the foundation for convergence analysis in pointwise, uniform, and senses, as shown in subsequent theorems.
-
If with bounded derivatives, then by a standard Taylor expansion of f about the grid nodes , we obtain:and similarly for , depending on the quadrature rule.
- Higher-order moment conditions on Φ or higher-degree quadrature rules can improve this rate, leading to asymptotic Voronovskaya-type expansions as discussed in later sections.
3. Main Results
3.1. Voronovskaya-Type Expansion for Basic Operators
3.2. Preparatory Observations
4. Voronovskaya-Type Expansions for Kantorovich and Quasi-Interpolation Operators
4.1. Implications for Approximation Rates
- 1.
- The general rate (89) depends explicitly on the balance between the smoothness m and the chosen parameter , giving a controlled decay of the approximation error.
- 2.
5. Second-Order Multivariate Voronovskaya Expansions and Estimates
6. Voronovskaya-Type Expansion in Sobolev
7. Quantitative Rate with Explicit Constants
8. Unified Voronovskaya-Type Expansion in Sobolev with Explicit Constants
9. Uniform Stability of Voronovskaya-Type Expansions under Variations
10. Unified Voronovskaya-Type Expansion with Explicit Constants and Uniform Stability
10.1. Setup
10.2. Unified Voronovskaya-Type Theorem
10.3. Remarks
- This theorem simultaneously captures the classical Voronovskaya expansion, quantitative rates, Sobolev estimates, and uniform stability under parametric families.
- Constants are fully explicit, depending only on kernel moments and derivatives.
- The framework is directly applicable to numerical analysis, multivariate approximation, and theoretical studies of Sobolev-space operators.
11. Setup and Hypotheses for Sobolev-Santos Uniform Adaptive Convergence Theorem
Hypotheses.
- 1.
- Controlled Deformation: There exist constants such that for all .
- 2.
- Uniform Exponential Decay: For all multi-indices with , there exists such that
- 3.
- Uniformly Bounded Moments: For all ,
- 1.
- The factor explicitly captures the influence of adaptive kernel deformation on the remainder, providing a quantitative measure of non-stationarity.
- 2.
- If and , the theorem recovers the classical stationary Voronovskaya expansion.
- 3.
- The theorem can be extended to fractional Sobolev spaces with , allowing finer control for functions with limited smoothness.
- 4.
- Uniformity in s ensures stability of derivatives up to order s, which is crucial for high-dimensional deep learning applications where gradients are propagated through multiple layers.
12. Results
- 1.
-
Voronovskaya-Type Expansions for Basic Operators: For functions , the approximation error of the basic operator admits an asymptotic expansion:This expansion provides explicit convergence rates, dependent on the smoothness m of f and the grid parameter .
- 2.
- Refined Expansions for Kantorovich and Quadrature Operators: For , the Kantorovich operator satisfies a refined expansion:where the remainder is bounded by , demonstrating higher-order accuracy.
- 3.
-
Sobolev Space Estimates: The approximation error in the Sobolev space is bounded by:This result provides quantitative estimates for the convergence rate, with explicit constants derived from the moments of the kernel function.
- 4.
-
Sobolev-Santos Uniform Convergence Theorem: The Sobolev-Santos Theorem (Theorem ) establishes that for adaptive quasi-interpolation operators , the following expansion holds:where the remainder satisfies the explicit estimate:The function quantifies the deviation from stationarity, ensuring uniform stability under parametric variations of the activation function. This theorem is pivotal for applications requiring adaptive kernel deformation, such as high-dimensional deep learning architectures.
- 5.
- Uniform Stability Under Parametric Variations: The expansions remain uniformly valid even when the activation function parameters vary, ensuring robustness in practical applications. This stability is critical for adaptive neural network architectures, where parameters may dynamically adjust during training or optimization.
13. Conclusions
Acknowledgments
References
- Anastassiou, G. A. (1997). Rate of convergence of some neural network operators to the unit-univariate case. Journal of Mathematical Analysis and Applications, 212(1), 237-262. [CrossRef]
- Anastassiou, G. (2000). Quantitative approximations. Chapman and Hall/CRC. [CrossRef]
- Anastassiou, G. A. (2016). Intelligent Systems II: Complete Approximation by Neural Network Operators (Vol. 608). Cham: Springer International Publishing. [CrossRef]
- Anastassiou, G. A. (2023). Parametrized, deformed and general neural networks. Berlin/Heidelberg, Germany: Springer. [CrossRef]
- Z. Chen and F. Cao, The approximation operators with sigmoidal functions, Computers and Mathematics with Applications, 58 (2009), 758-765. [CrossRef]
- Haykin, S. (1994). Neural networks: a comprehensive foundation. Prentice hall PTR.
- McCulloch, W. S., & Pitts, W. (1943). A logical calculus of the ideas immanent in nervous activity. The bulletin of mathematical biophysics, 5(4), 115-133. [CrossRef]
- Yu, D., & Cao, F. (2025). Construction and approximation rate for feedforward neural network operators with sigmoidal functions. Journal of Computational and Applied Mathematics, 453, 116150. [CrossRef]
- Yoo, J., Kim, J., Gim, M., & Lee, H. (2024). Error estimates of physics-informed neural networks for initial value problems. Journal of the Korean Society for Industrial and Applied Mathematics, 28(1), 33-58.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).