提出HS-FNO模型,解决含时滞的偏微分方程预测难题。
HS-FNO: History-Space Fourier Neural Operator for Non-Markovian Partial Differential Equations

- 基于历史状态升维,用可学习预测+精确平移组合更新历史
- 在五类延迟与记忆驱动方程上,滚动预测误差降至0.094,优于基线
- 适合需记忆依赖建模的科学计算场景,如流行病传播、材料演化
神经算子为时变偏微分方程提供快速代理模型,但标准自回归方法通常假设瞬时场$u(t,\cdot)$是完整状态,这在时滞方程、分布式记忆系统等非马尔可夫动力学中失效:两条轨迹在$ t $时刻相同,但因历史不同而未来相异。本文提出历史空间傅里叶神经算子(HS-FNO),针对延迟与记忆驱动型偏微分方程,在升维状态$u_t(θ,x)=u(t+θ,x)$,$θ∈[-τ,0]$上建模。核心计算步骤将历史状态更新分解为:对新暴露未来片段的可学习预测,和对已有历史窗口部分的精确平移-追加传输。该设计避免学习确定性历史坐标,降低学习输出维度,并强制满足自然离散历史更新结构。在五个基准测试族(延迟反应-扩散、空间流行病学、非局部神经场动力学、延迟波、分布式记忆闭包)上验证,跨十组随机种子,HS-FNO在单步、历史空间及滚动预测误差上均低于主流基线。最大提升出现在自回归预测:滚动误差由当前状态、滞后堆叠、无约束历史到历史算子的0.241、0.188、0.185下降至0.094。同一模型参数量少于无约束历史预测。结果表明,强制历史状态演化的离散平移结构是一种有效的归纳偏置,适用于非马尔可夫型偏微分方程代理建模。
原文摘要 · Abstract (English)
Neural operators provide fast surrogate models for time-dependent partial differential equations, but their standard autoregressive use usually assumes that the instantaneous field $u(t,\cdot)$ is a complete state. This assumption fails for delay equations, distributed-memory systems, and other non-Markovian dynamics: two trajectories may agree at time $t$ and nevertheless have different futures because their histories differ. We introduce the History-Space Fourier Neural Operator (HS-FNO), a neural operator for delay and memory-driven PDEs formulated on the lifted state $u_t(θ,x)=u(t+θ,x)$, $θ\in[-τ,0]$. The key computational step is to decompose one history-state update into a learned predictor for the newly exposed future slice and an exact shift-append transport for the portion of the history window already known from the previous state. This avoids learning deterministic history coordinates, reduces the learned output dimension, and enforces the natural discrete history update. We test HS-FNO on five benchmark families covering delayed reaction--diffusion, spatial epidemiology, nonlocal neural-field dynamics, delayed waves, and distributed-memory closures. Across ten random seeds, HS-FNO attains the lowest aggregate one-step, history-space, and rollout errors among the principal baselines. The largest gain occurs in autoregressive prediction, where aggregate rollout error decreases from $0.241$, $0.188$, and $0.185$ for current-state, lag-stack, and unconstrained history-to-history operators, respectively, to $0.094$. The same model uses fewer parameters than unconstrained history prediction. These results indicate that enforcing the discrete shift structure of history-state evolution is an effective inductive bias for non-Markovian PDE surrogate modeling.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。