arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2503.24092math.FAcs.LGmath.GN
收藏

用于编码器-解码器架构的新通用算子逼近定理

New universal operator approximation theorem for encoder-decoder architectures

Center for Industrial Mathematics(工业数学中心);University of Bremen(不来梅大学)

Janek Gödeke, Pascal Fernsel

AI总结:

该研究受神经网络算子逼近发展启发,针对编码器-解码器架构提出通用算子逼近定理,通过引入新逼近性质,统一扩展现有定理,适用于多种架构及赋范外的度量空间,为最优运输开拓潜在应用。

摘要:

受神经网络算子逼近数学领域快速发展的推动,我们针对广泛的编码器-解码器架构以及各种输入和输出空间,提出了一种新颖的通用算子逼近定理。本研究聚焦于无限维赋范或度量空间之间连续算子在紧集上一致收敛拓扑中的逼近。与算子学习文献中的标准结果不同,我们还研究了编码器-解码器架构的逼近序列可独立于紧集选择的情况。从拓扑角度指出,在大多数相关算子学习框架中,与紧集无关的逼近是一种严格更强的性质。为建立结果,我们引入了针对编码器-解码器架构定制的输入和输出空间的新逼近性质,证明了一个通用算子逼近定理,确保在输入空间的每个紧子集上一致收敛。我们的结果统一并扩展了各种编码器-解码器架构的现有通用算子逼近定理,包括经典的深度算子网络、基算子网络、混合算子网络等。我们框架的一个显著特点是它也适用于赋范设置之外的度量空间,特别是允许将概率测度的p-瓦瑟斯坦空间作为输入或输出空间,以及将 càdlàg 函数的斯科罗霍德空间作为输入空间,这一通用性也为最优运输开辟了潜在应用。

英文摘要:

Motivated by the rapidly growing field of mathematics for operator approximation with neural networks, we present a novel universal operator approximation theorem for broad classes of encoder-decoder architectures and a wide range of input and output spaces. In this study, we focus on the approximation of continuous operators between infinite-dimensional normed or metric spaces in the topology of uniform convergence on compact sets. Unlike standard results in the operator learning literature, we additionally investigate the case where the approximating sequence of encoder-decoder architectures can be chosen independently of the compact sets. Taking a topological perspective, we point out that compact-set-independent approximation is a strictly stronger property in most relevant operator learning frameworks. To establish our results, we introduce new approximation properties of input and output spaces tailored to encoder-decoder architectures. These properties enable us to prove a universal operator approximation theorem ensuring uniform convergence on every compact subset of the input space. Our results unify and extend existing universal operator approximation theorems for various encoder-decoder architectures, including classical DeepONets, BasisONets, MIONets, architectures based on frames and other related approaches. A notable feature of our framework is that it also applies to metric spaces beyond the normed setting. In particular, it allows the consideration of $p$-Wasserstein spaces of probability measures as input or output spaces, and Skorohod spaces of càdlàg functions as input spaces. This generality also opens up potential applications in optimal transport.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑