Mingchuan Zhao

CE
h-index3
3papers
6citations
Novelty75%
AI Score47

3 Papers

84.9DBMar 10
Epistemic Closure: Autonomous Mechanism Completion for Physically Consistent Simulation

Yue Wua, Tianhao Su, Rui Hu et al.

The integration of Large Language Models (LLMs) into scientific discovery is currently hindered by the Implicit Context problem, where governing equations extracted from literature contain invisible thermodynamic assumptions (e.g., undrained conditions) that standard generative models fail to recognize. This leads to Physical Hallucination: the generation of syntactically correct solvers that faithfully execute physically invalid laws. Here, we introduce a Neuro-Symbolic Generative Agent that functions as a cognitive supervisor atop traditional numerical engines. By encapsulating physical laws into modular Constitutive Skills and leveraging latent intrinsic priors, the Agent employs a Chain-of-Thought reasoning workflow to autonomously validate, prune, and complete physical mechanisms. We demonstrate this capability on the challenge of thermal pressurization in low-permeability sandstone. While a standard literature-retrieval baseline erroneously predicts catastrophic material failure by blindly adopting a rigid "undrained" simplification, our Agent autonomously identifies the system as operating in a drained regime (Deborah number De << 1) via dimensionless scaling analysis. Consequently, it inductively completes the missing dissipation mechanism (Darcy flow) required to satisfy boundary constraints, predicting a stable stress path consistent with experimental reality. This work establishes a paradigm where AI agents transcend the role of coding assistants to act as epistemic partners, capable of reasoning about and correcting the theoretical assumptions embedded in scientific data.

CEFeb 12
Engineering-Oriented Symbolic Regression: LLMs as Physics Agents for Discovery of Simulation-Ready Constitutive Laws

Yue Wu, Tianhao Su, Mingchuan Zhao et al.

The discovery of constitutive laws for complex materials has historically faced a dichotomy between high-fidelity data-driven approaches, which demand prohibitive full-field experimental data, and traditional engineering fitting, which often yields numerically unstable models outside calibration regimes. In this work, we propose an Engineering-Oriented Symbolic Regression (EO-SR) framework that bridges this gap by leveraging Large Language Models (LLMs) as "Physics-Informed Agents." Unlike unconstrained symbolic regression, our framework utilizes an LLM Agent to zero-shot synthesize executable physical constraints -- specifically thermodynamic consistency and frame indifference -- transforming the search process from mathematical curve-fitting into a physics-governed discovery engine. We validate this approach on the hyperelastic modeling of rubber-like materials using standard Treloar datasets. The framework autonomously identifies a novel hybrid constitutive law that combines a Mooney-Rivlin linear base with a rational locking term. This discovered model not only achieves high predictive accuracy across multi-axial deformation modes (including zero-shot prediction of pure shear) but also guarantees unconditional convexity. Finite element validation demonstrates that while industry-standard models (e.g., Ogden N=3) fail due to numerical singularities under severe transverse compression, the EO-SR-discovered model maintains robust convergence. This study establishes a generalized, low-barrier pathway for discovering simulation-ready constitutive closures that satisfy both data accuracy and rigorous physical laws.

STJul 2, 2025
NGAT: A Node-level Graph Attention Network for Long-term Stock Prediction

Yingjie Niu, Mingchuan Zhao, Valerio Poti et al.

Graph representation learning methods have been widely adopted in financial applications to enhance company representations by leveraging inter-firm relationships. However, current approaches face three key challenges: (1) The advantages of relational information are obscured by limitations in downstream task designs; (2) Existing graph models specifically designed for stock prediction often suffer from excessive complexity and poor generalization; (3) Experience-based construction of corporate relationship graphs lacks effective comparison of different graph structures. To address these limitations, we propose a long-term stock prediction task and develop a Node-level Graph Attention Network (NGAT) specifically tailored for corporate relationship graphs. Furthermore, we experimentally demonstrate the limitations of existing graph comparison methods based on model downstream task performance. Experimental results across two datasets consistently demonstrate the effectiveness of our proposed task and model. The project is publicly available on GitHub to encourage reproducibility and future research.