arXiv:2602.23381math.GNcs.LG2026-02

证明了神经网络在非欧空间中仍具通用逼近能力。

Universality of shallow and deep neural networks on non-Euclidean spaces

  • 基于连续特征映射构建通用神经网络模型
  • 任意宽度下可在拓扑空间实现函数逼近
  • 深度窄层结构在特定条件下仍具通用性

研究输入定义在一般拓扑空间的浅层与深层神经网络。模型由给定的连续特征映射族构建,在欧氏空间下退化为多层前馈网络。重点考察通用逼近性质,建立了此类网络在任意拓扑空间及局部凸空间上连续向量值函数空间中稠密的一般条件。任意宽度情形下的普遍性结果将经典逼近定理推广至非欧空间。还考虑深度窄层设置,即各隐层宽度有界而深度可增长,识别出此类网络保持通用逼近性质的条件。以Ostrand对Kolmogorov叠加定理的推广为例,导出紧度量空间乘积上的显式普遍性结果,宽度界以拓扑维数表示。

原文摘要 · Abstract (English)

We study shallow and deep neural networks whose inputs range over a general topological space. The model is built from a prescribed family of continuous feature maps and reduces to multilayer feedforward networks in the Euclidean case. We focus on the universal approximation property and establish general conditions under which such networks are dense in spaces of continuous vector-valued functions on arbitrary topological spaces and, in particular, locally convex spaces. Universality results obtained in the arbitrary-width case extend classical approximation theorems to non-Euclidean spaces. We also consider the deep narrow setting, in which the width of each hidden layer is uniformly bounded while the depth is allowed to grow. We identify conditions under which such networks retain the universal approximation property. As a concrete example, we employ Ostrand's extension of the Kolmogorov superposition theorem to derive an explicit universality result for products of compact metric spaces, with width bounds expressed in terms of topological dimension.

神经网络逼近理论拓扑空间

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。