AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (247.6 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Relaxed conditions for universal approximation by radial basis function neural networks of Hankel translates

Departamento de Análisis Matemático and Instituto de Matemáticas y Aplicaciones (IMAULL), Universidad de La Laguna (ULL), 38200 La Laguna, Spain
Show Author Information

Abstract

Radial basis function neural networks (RBFNNs) of Hankel translates of order μ > 1 / 2 with varying widths whose activation function σ is a.e. continuous, such that z μ 1 / 2 σ ( z ) is locally essentially bounded and not an even polynomial, are shown to enjoy the universal approximation property (UAP) in appropriate spaces of continuous and integrable functions. In this way, the requirement that σ be continuous for this kind of networks to achieve the UAP is weakened, and some results that hold true for RBFNNs of standard translates are extended to RBFNNs of Hankel translates.

CLC number: 41A30, 46F12

References

【1】
【1】
 
 
AIMS Mathematics
Pages 10852-10865

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Marrero I. Relaxed conditions for universal approximation by radial basis function neural networks of Hankel translates. AIMS Mathematics, 2025, 10(5): 10852-10865. https://doi.org/10.3934/math.2025493

99

Views

0

Downloads

0

Crossref

1

Web of Science

1

Scopus

Received: 29 December 2024
Revised: 04 March 2025
Accepted: 06 May 2025
Published: 15 May 2025
©2025 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)