Abstract
In recent years, machine learning algorithms, especially deep learning, have shown promising prospects in solving Partial Differential Equations (PDEs). However, as the dimension increases, the relationship and interaction between variables become more complex, and existing methods are difficult to provide fast and interpretable solutions for high-dimensional PDEs. To address this issue, we propose a genetic programming symbolic regression algorithm based on transfer learning and automatic differentiation to solve PDEs. This method uses genetic programming to search for a mathematically understandable expression and combines automatic differentiation to determine whether the search result satisfies the PDE and boundary conditions to be solved. To overcome the problem of slow solution speed caused by large search space, we propose a transfer learning mechanism that transfers the structure of one-dimensional PDE analytical solution to the form of high-dimensional PDE solution. We tested three representative types of PDEs, and the results showed that our proposed method can obtain reliable and human-understandable real solutions or algebraic equivalent solutions of PDEs, and the convergence speed is better than the compared methods. Code of this project is at https://github.com/grassdeerdeer/HD-TLGP.
Cite
CITATION STYLE
Cao, L., Liu, Y., Wang, Z., Xu, D., Ye, K., Tan, K. C., & Jiang, M. (2024). An Interpretable Approach to the Solutions of High-Dimensional Partial Differential Equations. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 38, pp. 20640–20648). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v38i18.30050
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.