分层RBF-KAN和RBF-SKAN架构用于多维函数逼近和随机场学习
Hierarchical RBF-KAN and RBF-SKAN Architectures for Multidimensional Function Approximation and Random Field Learning
AI总结:
提出并分析使用径向基函数作为激活函数的分层Kolmogorov-Arnold神经网络架构,用于逼近确定性函数和随机场模型,并证明其通用逼近性质及缓解维度灾难的潜力。
摘要:
本文提出并分析了使用径向基函数作为激活函数的分层Kolmogorov-Arnold神经网络架构,用于逼近确定性函数和随机场模型。具体地,我们开发了用于多维确定性函数逼近的分层径向基函数Kolmogorov-Arnold网络(分层RBF-KAN)和用于随机场学习的分层径向基函数随机Kolmogorov-Arnold网络(分层RBF-SKAN)。从理论角度,我们为两种架构建立了通用逼近结果。特别地,我们推导了分层RBF-KAN的定量逼近估计,表明所提出的框架通过降低逼近问题的有效维度,有潜力部分缓解高维函数学习中的维度灾难。此外,我们证明了分层RBF-SKAN可以在Wasserstein-2度量下逼近随机场模型。实验上,我们表明所提出的基于径向基函数的神经网络结构能够有效学习多元函数和随机场模型。
英文摘要:
In this manuscript, we propose and analyze hierarchical Kolmogorov--Arnold neural network architectures employing radial basis functions as activation functions for approximating deterministic functions and random field models. Specifically, we develop a hierarchical radial-basis-function Kolmogorov--Arnold network (hierarchical RBF-KAN) for multidimensional deterministic function approximation and a hierarchical radial-basis-function stochastic Kolmogorov--Arnold network (hierarchical RBF-SKAN) for random field learning. From a theoretical perspective, we establish universal approximation results for both architectures. In particular, we derive quantitative approximation estimates for the hierarchical RBF-KAN, showing that the proposed framework has the potential to partially alleviate the curse of dimensionality in learning high-dimensional functions by reducing the effective dimensionality of the approximation problem. Furthermore, we show that the hierarchical RBF-SKAN can approximate random field models under the Wasserstein-2 metric. Empirically, we show that our proposed radial-basis-function-based neural network structure could effectively learn multivariate functions and random field models.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。