用谱方法与变分能量框架求解偏微分方程,实现可微优化。
Variational (Energy-Based) Spectral Learning: A Machine Learning Framework for Solving Partial Differential Equations
- 将PDE转化为基于系数的变分能量函数,直接优化系数向量
- 在1D和2D泊松、扩散、伯格斯方程上达到经典谱法精度
- 支持自动微分,适合现代深度学习优化器,适合科研人员
我们提出变分谱学习(VSL),一种直接在谱展开系数空间中求解偏微分方程(PDE)的机器学习框架。该方法将给定PDE \mathcal{L}u = f \quad \text{in} \quad Q=Ω×(0,T) 及其边界与初始条件,转化为由强形式最小二乘残差和弱(伽辽金)形式构建的可微时空能量函数。解表示为有限谱展开形式 u_N(x,t)=\sum_{n=1}^{N} c_n\,ϕ_n(x,t),其中ϕ_n为空间与时间的张量积切比雪夫基,满足狄利克雷边界条件。这带来系数向量\mathbf{c}的紧凑线性参数化,所有PDE复杂性被吸收进变分能量中。我们展示了如何构建强形式与弱形式的时空泛函,加入初始条件与Tikhonov正则化项,并通过梯度优化最小化目标函数。实践中,使用TensorFlow实现,结合自动微分与余弦退火重启学习率策略,可稳健优化中等规模系数向量。在典型椭圆与抛物型问题(包括一维与二维泊松、扩散、伯格斯型方程)上的数值实验表明,VSL精度接近经典谱配点法与Crank-Nicolson时间步长方法,同时提供可微目标,适配现代优化工具。
原文摘要 · Abstract (English)
We introduce variational spectral learning (VSL), a machine learning framework for solving partial differential equations (PDEs) that operates directly in the coefficient space of spectral expansions. VSL offers a principled bridge between variational PDE theory, spectral discretization, and contemporary machine learning practice. The core idea is to recast a given PDE \[ \mathcal{L}u = f \quad \text{in} \quad Q=Ω\times(0,T), \] together with boundary and initial conditions, into differentiable space-time energies built from strong-form least-squares residuals and weak (Galerkin) formulations. The solution is represented as a finite spectral expansion \[ u_N(x,t)=\sum_{n=1}^{N} c_n\,ϕ_n(x,t), \] where $ϕ_n$ are tensor-product Chebyshev bases in space and time, with Dirichlet-satisfying spatial modes enforcing homogeneous boundary conditions analytically. This yields a compact linear parameterization in the coefficient vector $\mathbf{c}$, while all PDE complexity is absorbed into the variational energy. We show how to construct strong-form and weak-form space-time functionals, augment them with initial-condition and Tikhonov regularization terms, and minimize the resulting objective with gradient-based optimization. In practice, VSL is implemented in TensorFlow using automatic differentiation and Keras cosine-decay-with-restarts learning-rate schedules, enabling robust optimization of moderately sized coefficient vectors. Numerical experiments on benchmark elliptic and parabolic problems, including one- and two-dimensional Poisson, diffusion, and Burgers-type equations, demonstrate that VSL attains accuracy comparable to classical spectral collocation with Crank-Nicolson time stepping, while providing a differentiable objective suitable for modern optimization tooling.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。