将几何约束融入神经网络,提升模型对边界和不连续性的建模精度。
Geometry-Aware R-Structured Kolmogorov-Arnold Networks

- 用可微R函数显式编码几何约束,结合KAN学习平滑非线性结构。
- 在圆形/矩形支持集上测试,测试RMSE降低最高达67%。
- 适合需要高精度边界定位与可解释性的回归任务。
我们提出一种新型混合神经架构——几何感知的R结构柯尔莫哥洛夫-阿诺德网络(GRS-KAN),将V.L.拉切夫的R函数引入柯尔莫哥洛夫-阿诺德网络(KAN)框架。该方法融合两种互补建模机制:通过KAN分支学习平滑非线性结构,同时利用可微R函数解析编码已知的几何或逻辑约束。这使得不连续性、可行区域及隐式几何边界可在可训练架构中显式表示。框架通过R-合取和R-析取实现可微逻辑运算,使复杂几何支撑可解析表达并直接嵌入回归模型。提出了加法型、乘法型及权重自适应三种变体。在具有圆形单元和矩形支撑集的回归问题上进行了验证。数值实验表明,显式几何编码显著提升了预测精度与边界定位能力;在基准测试中,几何感知的GRS-KAN模型测试RMSE最高降低67%,同时通过显式解析表达增强了模型可解释性。自适应变体进一步展示了自动判断几何先验是否有益的能力。
原文摘要 · Abstract (English)
We propose a novel hybrid neural architecture, the Geometry-aware R-Structured Kolmogorov-Arnold Network (GRS-KAN), which integrates V.L.Rvachev's R-functions into the Kolmogorov-Arnold Network (KAN) framework. The proposed approach combines two complementary modeling mechanisms: smooth nonlinear structure is learned by KAN branches, while known geometric or logical constraints are encoded analytically using differentiable R-functions. This enables explicit representation of discontinuities, feasible regions, and implicit geometric boundaries within a trainable neural architecture. The framework implements differentiable logical operations through R-conjunctions and R-disjunctions, allowing complex geometric supports to be represented analytically and incorporated directly into regression models. Several GRS-KAN variants are introduced, including additive, multiplicative, and agnostic branch-weighted architectures. The method is demonstrated on regression problems involving discontinuities with circular and rectangular supports. Numerical experiments show that explicit geometric encoding substantially improves predictive accuracy and boundary localization compared with standard KANs. In the considered benchmarks, geometry-aware GRS-KAN models reduce test RMSE by up to 67% while simultaneously improving interpretability through explicit analytical representation of the learned geometric structure. The agnostic variant further demonstrates the ability to automatically determine whether geometric priors are beneficial for a given learning task.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。