Skip to content

See, Hypothesize, Validate: Multimodal Agentic Framework for Discovering Governing PDEs

Aug 2026 · 0 citations · 41 references
Computer Science

TL;DR

MAGE is introduced, an agentic framework that organizes PDE discovery as a confidence governed hypothesis validation loop inspired by the scientific cycle of observation, hypothesis, and falsification, and supports further study of structured agentic reasoning for library-free governing-law discovery.

Abstract

Discovering governing partial differential equations (PDEs) from observational data remains a core challenge across the sciences. Existing sparse-regression, symbolic-regression, and LLM-based approaches can be constrained by predefined libraries, noise sensitivity, hallucination, or limited iterative refinement. We introduce \textbf{MAGE} (\textbf{M}ultimodal \textbf{A}gentic \textbf{G}overning \textbf{E}quation Discovery), an agentic framework that organizes PDE discovery as a \textit{confidence governed hypothesis validation loop} inspired by the scientific cycle of observation, hypothesis, and falsification. Four role-specialized agents collaborate: a \textit{Differential Observer} computing derivatives and diagnostic visualizations; a VLM-powered \textit{Phenomenology Extractor} distilling qualitative cues from multimodal diagnostics; an LLM-driven \textit{Governing Law Synthesizer} proposing candidates without a predefined library; and an \textit{Equation Arbiter} fitting coefficients and assigning confidence scores. Discovery iterates until the top candidate clears a user-specified threshold, providing a structured process with an explicit accept-reject protocol. On the evaluated canonical PDE suite, MAGE obtains \textbf{8/8} exact structural recovery and the lowest coefficient error among the compared methods on \textbf{7/8} systems, with improvements of up to \textbf{4 orders of magnitude} and a geometric-mean improvement of approximately \textbf{3 orders of magnitude}. The pipeline also recovers the expected operators in two complex geometries and, on one laboratory sensor record, selects a cubic restoring-force model with held-out $R^2=0.98538$. These results support further study of structured agentic reasoning for library-free governing-law discovery, while broader generalization remains to be evaluated.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

REVEAL: Reverse Engineering Agentic Latents from Frontier-Model Traces

Frontier LLM agents perform complex interactive tasks, but their inference costs motivate transferring their experience to smaller open-source agents. Distillation and latent communication typically require target-model training or access to source-model internals. We study how textual frontier-model trajectories can p...

Yue-Tian Du, Meng Wang, Yu-Cheng Wang et al. · 0 citations
#large language models Open access Sep 2026

Iterated Agent for Symbolic Regression

This paper introduces IdeaSearchFitter, a framework that employs Large Language Models (LLMs) as semantic operators within an evolutionary search that achieves competitive, noise-robust performance on the Feynman Symbolic Regression Database (FSReD), outperforming several strong baselines.

Zhuo-Yang Song, Ze-Yu Cai, Shu-Tao Zhang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Environments as Scaffold: Enriching Feedback to Bootstrap Self-Evolving Agents in Long-Horizon Tasks

This work establishes a feedback design strategy that reformulates environments by transitioning from action guidance to observation enrichment during the later stages of both intra-episode exploration and inter-episode evolution, and reveals that FEEs consistently yield performance improvements over standard settings.

Hongbang Yuan, Zhuo-Ran Jin, Yi-Xin Cao · 0 citations
#machine learning Preprint Sep 2026

DeSyR: A Decoupled Symbolic Recovery Framework with PINN-Guided Structure Search and Physics-Informed Coefficient Refinement

Results show that an approximate neural teacher can guide topology discovery without imposing its error scale on final recovered coefficients, provided a target-capable topology is retained and physics-only refinement converges.

Pan-Cheng Niu, Jun Guo, Qiao-Lin He et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.