Multi-composite general neural network approximation over finite dimensional Banach spaces

Authors

DOI:

https://doi.org/10.65112/tcmis.10051

Keywords:

inite dimensional Banach spaces, multi-composite general neural network operators approximation, modulus of continuity, multi-composite general accelerated approximation

Abstract

The functions under approximation here have as a domain a finite dimensional Banach space with dimension N∈N and are  with values in RN. Exploiting some topological properties of the above we are able to perform multi-composite general Neural Network multivariate approximation to the above functions. The treatment is quantitative. We produce multivariate multi-composite general Jackson type inequalities involving the modulus of continuity of the function under approximation. The established convergences are pointwise and uniform. Our technique is expected to lead to accelerated speeds of convergence.

Downloads

Download data is not yet available.

References

[1] G. A. Anastassiou, “Rate of convergence of some neural network operators to the unit- univariate case,” J. Math. Anal. Appl., vol. 212, no. 1, pp. 237–262, 1997. https://doi.org/10.1006/jmaa.1997.5494 DOI: https://doi.org/10.1006/jmaa.1997.5494

[2] G. A. Anastassiou, Quantitative Approximations. Boca Raton, New York: Chapman & Hall / CRC, 2001.

[3] Z. Chen and F. Cao, “The approximation operators with sigmoidal functions,” Comput. Math. Appl., vol. 58, no. 4, pp. 758–765, 2009. https://doi.org/10.1016/j.camwa.2009.05.001 DOI: https://doi.org/10.1016/j.camwa.2009.05.001

[4] G. A. Anastassiou, Inteligent Systems: Approximation by Artificial Neural Networks, Intel- ligent Systems Reference Library, vol. 19. Heidelberg: Springer, 2011. DOI: https://doi.org/10.1007/978-3-642-21431-8

[5] G. A. Anastassiou, Intelligent Systems II: Complete Approximation by Neural Network Operators. Heidelberg, New York: Springer, 2016. DOI: https://doi.org/10.1007/978-3-319-20505-2

[6] G. A. Anastassiou, Intelligent Computations: Abstract, Fractional Calculus, Inequalities, Approximations. Heidelberg, New York: Springer, 2018. https://doi.org/10.1007/978-3-319-66936-6 DOI: https://doi.org/10.1007/978-3-319-66936-6

[7] G. A. Anastassiou, Banach Space Valued Neural Network. Heidelberg, New York: Springer, 2023. 10.1007/978-3-031-16400-2 [8] G. A. Anastassiou, Parametrized, deformed and general neural networks. Heidelberg, New York: Springer, 2023. https://doi.org/10.1007/978-3-031-43021-3 DOI: https://doi.org/10.1007/978-3-031-43021-3

[9] G. A. Anastassiou, Trigonometric and Hyperbolic Generated Approximation Theory. London, New Jersey, Singapore: World Scientific, 2025. https://doi.org/10.1142/13857 DOI: https://doi.org/10.1142/13857

[10] D. Costarelli and R. Spigler, “Approximation results for neural network operators activated by sigmoidal functions,” Neural Netw., vol. 44, pp. 101–106, Aug. 2013. https://doi.org/10.1016/j.neunet.2013.03.015 DOI: https://doi.org/10.1016/j.neunet.2013.03.015

[11] D. Costarelli and R. Spigler, “Multivariate neural network operators with sigmoidal activa- tion functions,” Neural Netw., vol. 48, pp. 72–77, Dec. 2013. https://doi.org/10.1016/j.neunet.2013.07.009 DOI: https://doi.org/10.1016/j.neunet.2013.07.009

[12] S. Haykin, Neural Networks: A Comprehensive Foundation, 2nd ed. New York: Prentice Hall, 1998.

[13] W. McCulloch and W. Pitts, “A logical calculus of the ideas immanent in nervous activity,” Bull. Math. Biophys., vol. 7, no. 4, pp. 115–133, 1943. https://doi.org/10.1007/BF02478259 DOI: https://doi.org/10.1007/BF02478259

[14] T. M. Mitchell, Machine Learning. New York: WCB-McGraw-Hill, 1997.

[15] G. A. Anastassiou, General multi-composite sigmoid relied Banach space valued univariate neural network approximation, submitted, 2025. DOI: https://doi.org/10.46719/NPSC2025.33.02

Downloads

Published

2026-01-12

How to Cite

Anastassiou, G. A. (2026). Multi-composite general neural network approximation over finite dimensional Banach spaces. Transactions on Computational Modeling and Intelligent Systems, 2, 10051. https://doi.org/10.65112/tcmis.10051

Similar Articles

You may also start an advanced similarity search for this article.