arXiv:2512.09376cs.LGcs.CV2025-12被引 1

提出可高效学习复杂几何算子的理论与网络架构,突破维度灾难限制。

Rates and architectures for learning geometrically non-trivial operators

  • 基于双纤维化变换构建几何感知学习框架
  • 误差以超代数速度衰减,训练样本极少仍有效
  • 新架构融合水平集与交叉注意力,适合流体、波动等复杂场景

深度学习已证明能从极少量训练样本中恢复高维空间间的算子,如偏微分方程解映射等数学物理对象。现有理论仅覆盖简单几何的椭圆算子,不涉及奇异性传播。本文将理论扩展至双纤维化变换——包含广义Radon和测地线射线变换的几何积分算子。证明此类算子不遭受维度灾难:误差以超代数速度衰减,即快于任意固定幂次的样本数倒数。同时研究显式编码几何结构的网络架构,发现类交叉注意力结构结合水平集方法,能实现通用、稳定且用极少样本学习双纤维化变换的参数化。成果推动科学机器学习算子学习的理论发展。

原文摘要 · Abstract (English)

Deep learning methods have proven capable of recovering operators between high-dimensional spaces, such as solution maps of PDEs and similar objects in mathematical physics, from very few training samples. This phenomenon of data-efficiency has been proven for certain classes of elliptic operators with simple geometry, i.e., operators that do not change the domain of the function or propagate singularities. However, scientific machine learning is commonly used for problems that do involve the propagation of singularities in a priori unknown ways, such as waves, advection, and fluid dynamics. In light of this, we expand the learning theory to include double fibration transforms--geometric integral operators that include generalized Radon and geodesic ray transforms. We prove that this class of operators does not suffer from the curse of dimensionality: the error decays superalgebraically, that is, faster than any fixed power of the reciprocal of the number of training samples. Furthermore, we investigate architectures that explicitly encode the geometry of these transforms, demonstrating that an architecture reminiscent of cross-attention based on levelset methods yields a parameterization that is universal, stable, and learns double fibration transforms from very few training examples. Our results contribute to a rapidly-growing line of theoretical work on learning operators for scientific machine learning.

算子学习几何建模深度学习科学计算

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