跳到正文
arXiv cs.AI· Vignesh Gopakumar, Zhuoyuan Wang, Ander Gray, Valentin Duruisseaux, Josh Williams, William Michael Edward Ellis, Nuno Nobre, Matthew Field, James Panayis, Alexander I. Blair, Andrew Davis, Stanislas Pamela, Robert Akers, Marc Peter Deisenroth, Anima Anandkumar·· 12 小时前AI 评分32

L-SplineFNO:面向非结构化网格的可学习样条神经算子

Learnable Splines for Unstructured Neural Operators

AI 导读

L-SplineFNO 将 FNO 主干与稀疏可学习的张量积 B 样条传递相结合,在非结构化网格与隐式笛卡尔网格之间建立映射,单张 A100 GPU 上训练可扩展至 2660 万节点、推理达 4600 万节点。

正文 · 原文

Authors:Vignesh Gopakumar, Zhuoyuan Wang, Ander Gray, Valentin Duruisseaux, Josh Williams, William Michael Edward Ellis, Nuno Nobre, Matthew Field, James Panayis, Alexander I. Blair, Andrew Davis, Stanislas Pamela, Robert Akers, Marc Peter Deisenroth, Anima Anandkumar

View PDF HTML (experimental)

Abstract:Neural operators approximate solution operators of partial differential equations at a fraction of the cost of numerical solvers. Efficient grid-based architectures such as the Fourier neural operator (FNO) assume uniform rectangular grids, whereas engineering simulations use large, irregular, and locally refined meshes. We introduce L-SplineFNO, a memory-efficient neural operator that couples an FNO backbone with a sparse, learnable tensor-product B-spline transfer between unstructured meshes and a latent Cartesian grid. A local normalised scatter avoids the geometry-dependent solve of analytic spline transformation while preserving compact support, partition of unity, and spline smoothness by construction. The neural operator, conditioned on global design and operating parameters, learns the mapping of geometry to the field solution. Across six three-dimensional engineering benchmarks, L-SplineFNO achieves strong predictive accuracy while requiring substantially less memory and compute than baseline operators, scaling to 26.6 million nodes in training and 46 million in inference on a single A100 GPU. It also supports zero-shot super-resolution and efficient closed-form spatial derivatives. Uniquely, the analytic spline decoder yields rigorous prediction bounds over continuous space and uncertain parameters, via Bernstein convex hulls and Taylor models, demonstrated on a 29.2-million-node MAST-U tokamak model.
Subjects: Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Computational Physics (physics.comp-ph)
Cite as: arXiv:2610.22446 [cs.AI]
  (or arXiv:2610.22446v1 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2610.22446

arXiv-issued DOI via DataCite

Submission history

From: Vignesh Gopakumar Mr. [view email]
[v1] Thu, 15 Oct 2026 15:15:31 UTC (22,337 KB)

来源:arXiv cs.AI · arxiv.org