用同步方法同时训练神经微分代数方程,提升精度与效率
A Simultaneous Approach for Training Neural Differential-Algebraic Systems of Equations
- 将神经DAE转为离散非线性规划问题,同步求解参数与轨迹
- 在稀疏数据、未观测状态等条件下仍保持高精度与泛化能力
- 适用于物理约束已知的混合模型,适合科学计算场景
科学机器学习是科学计算与机器学习结合的新领域。在微分方程框架下,神经常微分方程(NODEs)已取得显著成果。近期研究扩展至神经微分代数方程(DAEs),通过数据学习方程中未知关系。训练神经DAE同样计算昂贵,需每次参数更新都求解一次DAE,且传统深度学习算法如随机梯度下降难以严格处理代数约束。本文采用同步方法解决神经DAE问题,构建全离散非线性规划(NLP)问题,以局部最优解同时获得神经网络参数与对应DAE的解。该方法扩展了此前针对神经ODE的同步框架,支持混合模型——部分方程成分已知(如物理约束)。此外,提出一种改进策略:通过辅助问题初始化并近似海森矩阵项,提升非线性规划求解器的性能与收敛性。在多种设置下(如稀疏数据、未观测状态、多轨迹)均取得良好表现。最后,提出若干可提升方法可扩展性与鲁棒性的未来方向。
原文摘要 · Abstract (English)
Scientific machine learning is an emerging field that broadly describes the combination of scientific computing and machine learning to address challenges in science and engineering. Within the context of differential equations, this has produced highly influential methods, such as neural ordinary differential equations (NODEs). Recent works extend this line of research to consider neural differential-algebraic systems of equations (DAEs), where some unknown relationships within the DAE are learned from data. Training neural DAEs, similarly to neural ODEs, is computationally expensive, as it requires the solution of a DAE for every parameter update. Further, the rigorous consideration of algebraic constraints is difficult within common deep learning training algorithms such as stochastic gradient descent. In this work, we apply the simultaneous approach to neural DAE problems, resulting in a fully discretized nonlinear optimization problem, which is solved to local optimality and simultaneously obtains the neural network parameters and the solution to the corresponding DAE. We extend recent work demonstrating the simultaneous approach for neural ODEs, by presenting a general framework to solve neural DAEs, with explicit consideration of hybrid models, where some components of the DAE are known, e.g. physics-informed constraints. Furthermore, we present a general strategy for improving the performance and convergence of the nonlinear programming solver, based on solving an auxiliary problem for initialization and approximating Hessian terms. We achieve promising results in terms of accuracy, model generalizability and computational cost, across different problem settings such as sparse data, unobserved states and multiple trajectories. Lastly, we provide several promising future directions to improve the scalability and robustness of our approach.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。