用函数编码器构建基底映射,显著提升算子学习精度
Basis-to-Basis Operator Learning Using Function Encoders
- 通过基底分解与系数映射,将算子学习拆解为两步
- 在多个基准任务上实现比现有方法高两个数量级的精度
- 适用于线性算子,可直接类比特征分解与奇异值分解
我们提出基于函数编码器的基底到基底(B2B)算子学习方法,用于希尔伯特空间上的函数算子学习。该方法将算子学习分为两部分:分别学习输入和输出空间的基函数集,并学习基函数系数间的非线性映射。B2B 方法避免了以往方法对数据固定位置的依赖,借助最小二乘等经典技术计算系数。对于线性算子,可通过单一矩阵变换以闭式解实现基底间映射。进一步地,结合函数编码器与泛函分析的深层理论联系,我们推导出类特征分解与奇异值分解的算子学习算法。我们在七个基准算子学习任务上进行实验验证,结果表明,B2B 在多个任务上相较现有方法实现两个数量级的精度提升。
原文摘要 · Abstract (English)
We present Basis-to-Basis (B2B) operator learning, a novel approach for learning operators on Hilbert spaces of functions based on the foundational ideas of function encoders. We decompose the task of learning operators into two parts: learning sets of basis functions for both the input and output spaces and learning a potentially nonlinear mapping between the coefficients of the basis functions. B2B operator learning circumvents many challenges of prior works, such as requiring data to be at fixed locations, by leveraging classic techniques such as least squares to compute the coefficients. It is especially potent for linear operators, where we compute a mapping between bases as a single matrix transformation with a closed-form solution. Furthermore, with minimal modifications and using the deep theoretical connections between function encoders and functional analysis, we derive operator learning algorithms that are directly analogous to eigen-decomposition and singular value decomposition. We empirically validate B2B operator learning on seven benchmark operator learning tasks and show that it demonstrates a two-orders-of-magnitude improvement in accuracy over existing approaches on several benchmark tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。