arXiv:2503.00300cs.LGcs.NA2025-03被引 3

用柯西随机特征提升算子学习的效率与精度

Cauchy Random Features for Operator Learning in Sobolev Space

  • 基于柯西分布构造随机特征,实现核方法的快速近似
  • 在多个基准测试中达到相近或更优的测试误差,训练速度显著提升
  • 无需GPU,代码简洁,适合资源受限场景

算子学习旨在使用机器学习方法逼近无穷维巴拿赫空间间的算子。尽管当前进展多依赖深度神经网络(如Deep Operator Network和Fourier Neural Operator),但理论保证通常仅限于通用逼近性质,无法确保实际中获得高精度网络。受近期基于核的算子学习框架启发,本文提出一种具有理论保证和误差界的新随机特征算子学习方法。该方法可视为核方法的随机化近似,大幅降低训练计算开销。我们提供了所提方法的泛化误差分析,并给出全面的数值结果。相比核方法和神经网络方法,本方法在多个基准测试中取得相似或更优的测试误差,同时训练时间显著减少。额外优势在于实现简单,无需昂贵计算资源(如GPU)。

原文摘要 · Abstract (English)

Operator learning is the approximation of operators between infinite dimensional Banach spaces using machine learning approaches. While most progress in this area has been driven by variants of deep neural networks such as the Deep Operator Network and Fourier Neural Operator, the theoretical guarantees are often in the form of a universal approximation property. However, the existence theorems do not guarantee that an accurate operator network is obtainable in practice. Motivated by the recent kernel-based operator learning framework, we propose a random feature operator learning method with theoretical guarantees and error bounds. The random feature method can be viewed as a randomized approximation of a kernel method, which significantly reduces the computation requirements for training. We provide a generalization error analysis for our proposed random feature operator learning method along with comprehensive numerical results. Compared to kernel-based method and neural network methods, the proposed method can obtain similar or better test errors across benchmarks examples with significantly reduced training times. An additional advantages it that our implementation is simple and does require costly computational resources, such as GPU.

算子学习随机特征核方法高效训练

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