mlsanityData to 7 Oct 2026

From Equations to Insights: Unraveling Symbolic Structures in PDEs with LLMs

arXiv 2503.09986 ↗First posted 13 Mar 2025cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Motivated by the remarkable success of artificial intelligence (AI) across diverse fields, the application of AI to solve scientific problems, often formulated as partial differential equations (PDEs), has garnered increasing attention. While most existing research concentrates on theoretical properties (such as well-posedness, regularity, and continuity) of the solutions, alongside direct AI-driven methods for solving PDEs, the challenge of uncovering symbolic relationships within these equations remains largely unexplored. In this paper, we propose leveraging large language models (LLMs) to learn such symbolic relationships. Our results demonstrate that LLMs can effectively predict the operators involved in PDE solutions by utilizing the symbolic information in the PDEs both theoretically and numerically. Furthermore, we show that discovering these symbolic relationships can substantially improve both the efficiency and accuracy of symbolic machine learning for finding analytical approximation of PDE solutions, delivering a fully interpretable solution pipeline. This work opens new avenues for understanding the symbolic structure of scientific problems and advancing their solution processes.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 48 references that are in the map. First posted on arXiv 13 Mar 2025.

Builds on

23 of 48 references.

References · 23

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  2. 2024The Llama 3 Herd of Modelscited by 14,192
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  4. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  5. 2013Intriguing properties of neural networkscited by 5,114
  6. 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,806
  7. 2017DGM: A deep learning algorithm for solving partial differential equationscited by 674
  8. 2017The Deep Ritz method: A deep learning-based numerical algorithm for solving variational problemscited by 581
  9. 2017Solving high-dimensional partial differential equations using deep learningcited by 549
  10. 2017A systematic study of the class imbalance problem in convolutional neural networkscited by 510
  11. 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 286
  12. 2014The Loss Surfaces of Multilayer Networkscited by 278
11 more
  1. 2019Physics-Constrained Deep Learning for High-dimensional Surrogate Modeling and Uncertainty Quantification without Labeled Datacited by 261
  2. 2017A unified deep artificial neural network approach to partial differential equations in complex geometriescited by 122
  3. 2020Algorithms for Solving High Dimensional PDEs: From Nonlinear Monte Carlo to Machine Learningcited by 77
  4. 2020Neural Network Approximation: Three Hidden Layers Are Enoughcited by 63
  5. 2021Deep Network Approximation: Achieving Arbitrary Accuracy with Fixed Number of Neuronscited by 41
  6. 2020Solving high-dimensional eigenvalue problems using deep neural networks: A diffusion Monte Carlo like approachcited by 35
  7. 2020Deep neural network approximation for high-dimensional elliptic PDEs with boundary conditionscited by 25
  8. 2022Finite Expression Method for Solving High-Dimensional Partial Differential Equationscited by 21
  9. 2023A Finite Expression Method for Solving High-Dimensional Committor Problemscited by 9
  10. 2024Solving High-Dimensional Partial Integral Differential Equations: The Finite Expression Methodcited by 3
  11. 2024On the Stochastic (Variance-Reduced) Proximal Gradient Method for Regularized Expected Reward Optimizationcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.