arXiv:2505.04738cs.LG2025-05被引 3

SetONet让神经算子直接处理无序点云输入,突破固定采样限制。

SetONet: A Set-Based Operator Network for Solving PDEs with Variable-Input Sampling

  • 将输入重构成无序坐标-值集合,用置换不变聚合机制建模
  • 在可变布局和传感器丢失下仍保持低误差,优于DeepONet基线
  • 适合点源、密度分布等非结构化输入场景,无需预处理

大多数基于DeepONet的神经算子模型要求输入函数在固定有序的传感器位置上采样,这限制了其在可变传感器布局、缺失数据、点源及基于样本的密度表示中的应用。本文提出SetONet,将算子输入重构为无序的坐标-值观测集合,并在标准分支-主干网络中使用置换不变聚合,同时保留DeepONet的合成机制和轻量端到端训练。其结构化变体SetONet-Key通过可学习查询令牌和仅位置的键路径,解耦采样几何与传感器值。在四个经典算子学习基准上评估,涵盖固定、可变布局及评估时传感器丢弃情形;并在四个具有固有非结构化点云输入的问题上测试:含多个点源的热传导、对流-扩散、相位屏衍射和最优传输问题。在参数匹配实验中,SetONet-Key在固定传感器基准上误差更低,且在布局变化或传感器丢弃时仍保持稳定。不同池化规则比较显示,基于注意力的聚合通常比均值或求和池化更鲁棒。在点云问题上,SetONet直接处理原始输入,无需栅格化或多阶段预处理,性能优于更大的VIDON基线。

原文摘要 · Abstract (English)

Most neural-operator surrogates for PDEs inherit from DeepONet-style formulations the requirement that the input function be sampled at a fixed, ordered set of sensors. This assumption limits applicability to problems with variable sensor layouts, missing data, point sources, and sample-based representations of densities. We propose SetONet, which addresses this gap by recasting the operator input as an unordered set of coordinate-value observations and encoding it with permutation-invariant aggregation inside a standard branch-trunk operator network while preserving the DeepONet synthesis mechanism and lightweight end-to-end training. A structured variant, SetONet-Key, aggregates sensor information through learnable query tokens and a position-only key pathway, thereby decoupling sampling geometry from sensor values. The method is assessed on four classical operator-learning benchmarks under fixed layouts, variable layouts, and evaluation-time sensor drop-off, and on four problems with inherently unstructured point-cloud inputs, including heat conduction with multiple point sources, advection-diffusion, phase-screen diffraction, and optimal transport problems. In parameter-matched studies, SetONet-Key achieves lower error than the DeepONet baseline on fixed-sensor benchmarks and remains reliable when layouts vary or sensors are dropped at evaluation. Comparisons across pooling rules show that attention-based aggregation is typically more robust than mean or sum pooling. On the point-cloud problems, SetONet operates directly on the native input representation, without rasterization or multi-stage preprocessing, and outperforms the larger VIDON baseline.

神经算子偏微分方程点云处理无序输入

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