用强化学习动态选点,让物理神经网络训练更快更准。
RL-PINNs: Reinforcement Learning-Driven Adaptive Sampling for Efficient Training of PINNs
- 用强化学习自动选择最优训练点,避免反复重训
- 单轮采样即达更高精度,高维问题仍高效
- 不依赖梯度计算,适合复杂高阶方程求解
物理信息神经网络(PINNs)是求解偏微分方程(PDEs)的强大框架,但其性能高度依赖训练点的选择策略。传统基于残差的自适应采样需多轮采样与重复训练,导致计算效率低下,尤其在高维或高阶导数场景下。为此,我们提出RL-PINNs,一种基于强化学习(RL)的自适应采样框架,仅需单轮采样即可实现高效训练。该方法将采样过程建模为马尔可夫决策过程,由RL智能体通过最大化长期效用指标动态选择最优训练点。关键创新在于用函数变化量替代依赖梯度的残差作为奖励信号,避免了导数计算开销;同时采用延迟奖励机制,优先保证长期训练稳定性。在涵盖低正则性、非线性、高维及高阶问题的多个PDE基准测试中,RL-PINNs显著优于现有残差驱动方法,在保持极低采样开销的同时,展现出对高维与高阶问题的可扩展性。
原文摘要 · Abstract (English)
Physics-Informed Neural Networks (PINNs) have emerged as a powerful framework for solving partial differential equations (PDEs). However, their performance heavily relies on the strategy used to select training points. Conventional adaptive sampling methods, such as residual-based refinement, often require multi-round sampling and repeated retraining of PINNs, leading to computational inefficiency due to redundant points and costly gradient computations-particularly in high-dimensional or high-order derivative scenarios. To address these limitations, we propose RL-PINNs, a reinforcement learning(RL)-driven adaptive sampling framework that enables efficient training with only a single round of sampling. Our approach formulates adaptive sampling as a Markov decision process, where an RL agent dynamically selects optimal training points by maximizing a long-term utility metric. Critically, we replace gradient-dependent residual metrics with a computationally efficient function variation as the reward signal, eliminating the overhead of derivative calculations. Furthermore, we employ a delayed reward mechanism to prioritize long-term training stability over short-term gains. Extensive experiments across diverse PDE benchmarks, including low-regular, nonlinear, high-dimensional, and high-order problems, demonstrate that RL-PINNs significantly outperforms existing residual-driven adaptive methods in accuracy. Notably, RL-PINNs achieve this with negligible sampling overhead, making them scalable to high-dimensional and high-order problems.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。