paper-with-me

홈 › Papers

DISCOVER: Deep identification of symbolically concise open-form PDEs via enhanced reinforcement-learning

2022-10-04 · Mengge Du, Yuntian Chen, Dongxiao Zhang

The working mechanisms of complex natural systems tend to abide by concise and profound partial differential equations (PDEs). Methods that directly mine equations from data are called PDE discovery, which reveals consistent physical laws and facilitates our adaptive interaction with the natural world. In this paper, an enhanced deep reinforcement-learning framework is proposed to uncover symbolically concise open-form PDEs with little prior knowledge. Particularly, based on a symbol library of basic operators and operands, a structure-aware recurrent neural network agent is designed and seamlessly combined with the sparse regression method to generate concise and open-form PDE expressions. All of the generated PDEs are evaluated by a meticulously designed reward function by balancing fitness to data and parsimony, and updated by the model-based reinforcement learning in an efficient way. Customized constraints and regulations are formulated to guarantee the rationality of PDEs in terms of physics and mathematics. The experiments demonstrate that our framework is capable of mining open-form governing equations of several dynamic systems, even with compound equation terms, fractional structure, and high-order derivatives, with excellent efficiency. Without the need for prior knowledge, this method shows great potential for knowledge discovery in more complicated circumstances with exceptional efficiency and scalability.

📄 PDF Abstract BibTeX arXiv:2210.02181

Code (1)

menggedu/discover 공식 구현 tf

Tasks

Deep Reinforcement LearningFormModel-based Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Methods 이 논문이 사용한 방법론

Library 설명 없음

Similar Papers 제목 키워드 기반

Concise QBF Encodings for Games on a Grid (extended version)

2023-03-29 · Irfansha Shaik, Jaco van de Pol

Encoding 2-player games in QBF correctly and efficiently is challenging and error-prone. To enable concise specifications and uniform encodings of games played on grid boards, like Tic-Tac-Toe, Connect-4, Domineering, Pu…

MEKER: Memory Efficient Knowledge Embedding Representation for Link Prediction and Question Answering

2022-04-22 · ACL 2022 5 · Viktoriia Chekalina, Anton Razzhigaev, Albert Sayapin, Evgeny Frolov 외

Knowledge Graphs (KGs) are symbolically structured storages of facts. The KG embedding contains concise data used in NLP tasks requiring implicit information about the real world. Furthermore, the size of KGs that may be…

Knowledge GraphsLink PredictionQuestion Answering

Data-Driven Learning of 3-Point Correlation Functions as Microstructure Representations

2021-09-06 · Sheng Cheng, Yang Jiao, Yi Ren

This paper considers the open challenge of identifying complete, concise, and explainable quantitative microstructure representations for disordered heterogeneous material systems. Completeness and conciseness have been …

Bayesian Optimization

Differentiable Sparse Identification of Lagrangian Dynamics

2025-11-13 · Zitong Zhang, Hao Sun arxiv

Data-driven discovery of governing equations from data remains a fundamental challenge in nonlinear dynamics. Although sparse regression techniques have advanced system identification, they struggle with rational functio…

AI Poincaré 2.0: Machine Learning Conservation Laws from Differential Equations

2022-03-23 · Ziming Liu, Varun Madhavan, Max Tegmark

We present a machine learning algorithm that discovers conservation laws from differential equations, both numerically (parametrized as neural networks) and symbolically, ensuring their functional independence (a non-lin…

BIG-bench Machine Learning