Pith. sign in

REVIEW 1 major objections 7 minor 54 references

Low error can hide broken physics in AI-discovered surrogates

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

A verification-first agentic workflow for SciML surrogate discovery adds per-candidate, machine-checkable physics audits that expose a causality failure an error-only baseline misses.

T0 review reviewed 2026-07-09 challenge →

load-bearing objection The paper's headline causality evidence comes from a post-hoc reclassification, not the live verification layer. The framework idea is sound and the gap is real, but the evidence structure undercuts the central claim. the 1 major comments →

arxiv 2607.07379 v1 pith:AIXSHRP2 submitted 2026-07-08 cs.AI cs.LG

Physics-Audited Agentic Discovery in Scientific Machine Learning

Diab W. Abueidda , Bilal Ahmed , Panos Pantidis , Mostafa E. Mobasher This is my paper
classification cs.AI cs.LG
keywords physics-audited machine learningagentic discoverysurrogate modelsneural operatorscausality verificationcomputational solid mechanicsscientific machine learning
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper introduces PA-SciML, a workflow that adds machine-checkable physics audits to automated surrogate-model discovery for mechanics problems. LLM agents propose and train candidate surrogate models; before or during search, a setup step fixes a scoring evaluator and drafts a contract file specifying which physical requirements (boundary conditions, superposition, scaling, causality) to check on each candidate's predicted output fields. Fixed, non-LLM routines then test every trained candidate against those contracts and optionally search the admissible input domain for worst-case violations without needing reference solutions. A surrogate is reported as verified only if it passes these stated checks. The paper demonstrates the approach on two computational solid mechanics problems. In a static linear elasticity example, the audit-enabled search found a more accurate surrogate and confirmed it satisfies superposition, stiffness scaling, and boundary conditions. In a transient elastodynamics example, an error-only baseline with nearly identical mean error (rel-L2 2.724e-3 vs 2.629e-3) fails a causality check because its predicted response at early times changes when only later boundary motion is altered, with normalized violations of 12.62 at sampled inputs and 2750.62 under adversarial input search. The audit-selected surrogate, which uses a causal convolution branch by construction, passes. The paper's central distinction is that per-candidate physics evidence on predicted fields provides information that aggregate error scores cannot.

Core claim

The paper's central discovery is that two surrogate models with nearly indistinguishable predictive error can differ decisively on a physically essential property that the error metric does not measure. In the transient elastodynamics example, the error-only baseline responds to future parts of the loading history, making it an invalid forward model despite having a mean relative L2 error within 3.5% of the audit-selected surrogate. The causality check, applied directly to the surrogate's predicted fields without reference solutions, exposes this failure. The audit-selected surrogate avoids it by construction through a causal convolution branch that the candidate search introduced on its own

What carries the argument

The central machinery is the contract file: a typed, reviewable specification of physics checks (linearity, scaling, symmetry, boundary consistency, causality, etc.) with parameters, tolerances, and hard/soft labels, drafted by an LLM-mediated setup role called the Mechanician and then executed by fixed routines against each trained candidate's predicted outputs. The Sampled hard-contract gate uses the maximum tolerance-normalized violation across active hard contracts to gate verified reporting. A separate Adversary routine searches admissible inputs for worst-case violations without reference solution fields.

Load-bearing premise

The framework depends on the LLM-mediated Mechanician correctly identifying and parameterizing the physically relevant checks before candidate search begins. If a critical check is omitted or a tolerance is set too loosely, the framework provides a false sense of verification. In the live transient run, causality was classified as a soft diagnostic rather than a hard gate; it only became disqualifying in the post-run reference audit when the authors reclassified it. The value

What would settle it

If, across repeated runs and diverse mechanics problems, error-only selection consistently produces surrogates that also pass all physically relevant checks under a common reference audit, then the per-candidate physics audit adds documentation but does not change selection outcomes. The transient example's single-run causality failure would need to be shown as a systematic pattern rather than a one-run artifact for the framework's value proposition to hold.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • Engineering adoption of LLM-discovered surrogate models could require physics-audit evidence as a precondition, not just low validation error, because the transient example shows that near-identical error can mask a causality violation that makes a model unsuitable for real-time control or what-if prediction.
  • The contract-file approach generalizes to other physics regimes: any problem where a governing principle can be expressed as a machine-checkable input-output property (conservation, positivity, monotonicity, thermodynamic consistency) could be audited the same way, extending beyond solid mechanics to fluid dynamics, heat transfer, or electromagnetics.
  • The fact that the candidate search independently introduced causally-structured architectures (causal convolution, discrete superposition representations) suggests that physics-check signals during search may steer LLM agents toward architectures a domain expert would recognize as principled, even without being told the structure in advance.
  • The separation of error evidence from physics-check evidence means that a surrogate can be reported with a graded status: accurate, verified under named checks, or unverified, rather than a single scalar score collapsing all information.
  • The Adversary's no-reference violation search could be applied to already-deployed surrogates as a post-hoc audit tool, potentially catching physics violations in models selected by purely error-driven pipelines.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

1 major / 7 minor

Summary. This paper introduces Physics-Audited Agentic SciML (PA-SciML), a workflow that augments LLM-driven surrogate model discovery with per-candidate, machine-checkable physics audits on predicted fields. The framework fixes a scoring evaluator before search, derives reviewable physics contracts (hard/soft checks with tolerances), applies sampled physics checks to each trained candidate's outputs, and optionally runs a no-reference adversarial input search for high-violation cases. Two numerical examples in computational solid mechanics are presented: (1) parametric linear elasticity, where the audit-enabled run selects a more accurate surrogate while both selected and baseline models pass common linear-elastic checks, and (2) transient elastodynamics, where an error-only baseline with similar mean error (rel-L2 2.724e-3 vs. 2.629e-3) fails a causality check under a post-run reference audit, while the audit-selected surrogate passes by construction. The central claim is that per-candidate physics evidence on predicted fields provides information that error-only selection cannot.

Significance. The paper addresses a genuine gap in agentic SciML: existing systems select surrogates by aggregate scores without checking each candidate's predicted fields against machine-checkable physical requirements. The framework is carefully specified, with clear separation between LLM-mediated design roles and fixed-code verification routines. The adversarial input search is a notable strength—it operates without reference solutions and provides a falsifiable probe. The isolated-edit attribution analysis (Eq. 2) and method-card saving rule add a useful mechanism for accumulating reusable design knowledge. The transient elastodynamics example provides a concrete, compelling demonstration that two surrogates with near-identical mean error can differ decisively on a causality requirement. The paper is transparent about its limitations, including single-seed comparisons and the LLM-mediated origin of contract files.

major comments (1)
  1. §4.3, paragraph on 'Physics checks' (page 18–19): The paper's headline causality evidence comes from a post-run reference audit in which causality was reclassified as a hard check. In the live transient run, the Mechanician classified causality as a soft diagnostic, so the in-run Sampled hard-contract gate would not have disqualified the acausal error-only baseline. The paper acknowledges this ('In the live run, causality was recorded but did not disqualify candidates. In the post-run comparison, both selected surrogates are checked again with causality treated as a hard requirement'), but the abstract frames the result as evidence that the workflow works ('an error-only baseline with similar mean error fails a stricter causality check'). The 'stricter' check was not part of the live workflow that the paper proposes. This is a load-bearing concern because the central claim—that per-cand/
minor comments (7)
  1. §3.2, Eq. (1): The notation H for the set of active hard contracts is introduced but the relationship between H and the full contract file could be stated more explicitly for readers unfamiliar with the framework.
  2. Table 9: The model identifiers 'Claude Sonnet 4.6' and 'GPT-5.4' are unusual; please verify these are the correct model version names as of the submission date.
  3. Figure 2: The workflow diagram is dense and could benefit from larger font sizes or simplification to improve readability.
  4. §4.2, Table 4: The entry for '1/E scaling' for the selected surrogate shows '0 / 0' while the error-only baseline shows '1.080×10^-3 / 2.582×10^-3'. A brief note explaining why the selected surrogate's violation is exactly zero (by construction) would help readers.
  5. Appendix B, Table 10: The 'bound' check type description mentions a 'configured interval' but the interval is not specified in the main text for either example. Please clarify.
  6. §4.3: The transient example uses 500 validation histories. A brief note on how these were generated (random boundary motion histories, structured sampling, etc.) would improve reproducibility.
  7. §3.3, Eq. (2): The definition of phi_i could benefit from a concrete numerical example showing how values exceeding 100% arise, beyond the brief parenthetical already provided.

Simulated Author's Rebuttal

1 responses · 0 unresolved

The referee raises one major comment concerning the framing of the transient elastodynamics result: the headline causality failure was exposed by a post-run reference audit in which causality was reclassified as a hard check, not by the live in-run Sampled hard-contract gate (which had causality as a soft diagnostic). The referee argues this undercuts the paper's central claim that per-candidate physics evidence provides information that error-only selection cannot. We agree that the abstract and framing overstate what the live workflow demonstrated in the transient example. The core framework and the static elasticity example are not affected, but the transient example's presentation must be revised to accurately distinguish what the live gate did and did not catch, and to reframe the contribution accordingly.

read point-by-point responses

  1. Referee: §4.3, paragraph on 'Physics checks' (page 18–19): The paper's headline causality evidence comes from a post-run reference audit in which causality was reclassified as a hard check. In the live transient run, the Mechanician classified causality as a soft diagnostic, so the in-run Sampled hard-contract gate would not have disqualified the acausal error-only baseline. The paper acknowledges this, but the abstract frames the result as evidence that the workflow works. The 'stricter' check was not part of the live workflow that the paper proposes. This is a load-bearing concern because the central claim—that per-candidate physics evidence during selection provides information that error-only selection cannot—is not supported by the transient example as run.

    Authors: The referee is correct on the factual point: in the live transient run, the Mechanician classified causality as a soft diagnostic, so the in-run Sampled hard-contract gate did not gate on it. The causality failure was exposed by a post-run reference audit with causality reclassified as hard. The abstract's current phrasing ('an error-only baseline with similar mean error fails a stricter causality check') does not make clear that this stricter check was not part of the live workflow, and this is a genuine framing problem. We will revise the manuscript as follows: (1) The abstract will be rewritten to accurately state that the live in-run gate caught two physically inadmissible candidates (nonzero response to zero input) but did not gate on causality; the causality failure was exposed by a post-run reference audit under a stricter verification setting. (2) Section 4.3 will be reorganized to separate three distinct findings: (a) the live gate removed two candidates with nonzero zero-input response during Candidate search, demonstrating in-run physics gating; (b) the selected surrogate is causal by construction and passes the reference causality check; (c) the error-only baseline fails the reference causality check, demonstrating that error-only selection can miss a causality failure—but this finding comes from a post-run audit, not the live gate. (3) The central claim of the paper will be reframed: the framework's contribution is that it produces and reports per-candidate physics evidence at all, making such audits possible; the transient example shows both that the live gate can catch some failures and that a stricter post-run contract can expose failures the live contract missed. The fact that the live contract classified causality as soft is itself evidence for the框架's revision: no

Circularity Check

0 steps flagged

No significant circularity found. The physics checks are defined independently of the surrogates and the error metric; the central causality evidence is not circular.

full rationale

The paper's central claim is that per-candidate physics audits provide evidence that error-only selection cannot. Walking the derivation chain: (1) The causality check (Appendix B, Table 10) is defined independently: it builds two input histories that agree through a cut time and differ only later, then measures the relative L2 difference of pre-cut-time responses. This definition references only the surrogate's input-output map, not the surrogate's architecture, training, or error metric. (2) The selected surrogate passes causality because the search discovered a causal-convolution architecture (left-padded, bias-free), not because causality was defined to pass. The paper is explicit: 'None of this structure was prescribed: the problem specification fixes only the operator's input-output form... and the candidate search introduced the causal branch.' (3) The error-only baseline fails because it uses a bidirectional branch; the causality check catches this independently. (4) The Adversary search holds the trained surrogate fixed and varies only admissible inputs, using no reference solutions. (5) The paper is transparent that the selected surrogates satisfy checks 'by construction' and frames the audit's role as confirming the exported model preserves intended structure, not as discovering new violations in the selected model. The decisive failure (acausal baseline) is found in a model that was independently selected by error-only search. The authors cite their own prior work [31-34] in related work for context, but these citations are not load-bearing for the framework's central claims or the verification logic. The post-hoc reclassification of causality from soft to hard is a methodological limitation the paper acknowledges, but it is not circularity: the check itself is the same; only its gating severity changed. No step in the derivation chain reduces to its own inputs by construction. Score 1 reflects the minor self-citations in related work that are not load-bearing for the central verification argument.

Axiom & Free-Parameter Ledger

5 free parameters · 5 axioms · 4 invented entities

The axiom ledger captures the key setup choices and assumptions that govern the framework's verification claims. The most consequential free parameters are the contract tolerances and hard/soft labels, which directly determine pass/fail outcomes and were adjusted post-hoc in the transient example. The Mechanician role is an invented entity whose correctness is not independently verified. The adversary and method-card concepts have clearer independent evidence.

free parameters (5)
  • Contract tolerances (τ_c) = 5% normalized for transient hard checks; ≥3× calibration residual for static
    Tolerances are chosen by the LLM-mediated Mechanician during setup based on calibration evidence. The 3× rule is guidance, not enforced. These directly determine pass/fail outcomes.
  • Hard/soft check labels = Varies by verification setting (e.g., causality was soft in live run, hard in reference audit)
    The classification of checks as gating vs. diagnostic is a setup choice that determines whether a candidate is reported as verified. In the transient example, this choice is adjusted post-hoc.
  • Admissible input domain Z = E∈[5,20], ν∈[0.15,0.35], loads∈[-0.3,0.3] for static; prescribed motion histories for transient
    The domain bounds what the audit and adversary can probe. Violations outside Z are not claimed.
  • Adversary search budget and parameterization = Not numerically specified
    The adversary reports the largest violation found under the chosen budget, but the budget and optimization settings are not quantified in the paper.
  • Method-card saving threshold (dominant edit share) = 0.5
    The threshold for when an isolated edit is considered dominant enough to save as a reusable method card. Set by the framework configuration.
axioms (5)
  • domain assumption The physics checks selected by the Mechanician are physically valid for the governing regime, inputs, and outputs being audited.
    Stated in §3.2: 'These families are not universal mechanics assumptions: the contract file should include only properties valid for the governing regime.' The entire verification claim depends on this.
  • domain assumption The Fixed evaluator provides a meaningful predictive comparison metric.
    §3.1: 'Predictive comparisons are therefore conditional on the Fixed evaluator and its validation data.' The evaluator is fixed before search but its correctness is not guaranteed.
  • domain assumption Sampled audit probes are representative of the admissible input domain.
    The Sampled hard-contract gate checks finite probes from Z (eq. 1). A pass means no violation was found on sampled probes, not that no violation exists in Z.
  • domain assumption The LLM-mediated roles (Proposer, Critic, Engineer, etc.) can produce runnable, trainable surrogate implementations.
    The framework assumes LLM-generated code can be validated, trained, and scored. Failed candidates are recorded but the search depends on enough successful implementations.
  • standard math Single-precision arithmetic noise floor is an acceptable reference for zero-violation checks.
    §4.2: violations at 1e-15 to 1e-6 are described as 'single-precision noise floor' and treated as effectively zero.
invented entities (4)
  • PA-SciML workflow independent evidence
    purpose: Verification-first agentic SciML discovery framework with physics contracts, adversary search, and method-card saving
    The workflow is the paper's main contribution. Its components are demonstrated on two numerical examples with falsifiable outcomes (pass/fail on stated checks).
  • Mechanician role no independent evidence
    purpose: LLM-mediated setup component that drafts physics-check contract files from problem statements and calibration evidence
    The Mechanician is an LLM agent role that proposes contract files. Its correctness is not independently verified — the paper states contract files are 'reviewable modeling choices, not automatic evidence of physical validity.'
  • Adversary (no-reference high-violation input search) independent evidence
    purpose: Holds trained surrogate fixed, varies admissible inputs to find large physics-check violations without reference solutions
    The adversary is a fixed-code routine with a concrete optimization objective (maximize contract violation over Z). It produces falsifiable reports (largest violation found under budget).
  • Method card no independent evidence
    purpose: Reusable design note saved when an isolated edit produces a dominant score improvement and passes required checks
    Method cards are saved during post-discovery attribution. Whether reuse actually improves later searches is acknowledged as 'a testable claim for future runs' (§4.4).

reviewed 2026-07-09 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Physics-Audited Agentic Discovery in Scientific Machine Learning." pith.science (2026). https://pith.science/paper/AIXSHRP2

@misc{pith2026260707379,
  author       = {Pith},
  title        = {Pith review of: Physics-Audited Agentic Discovery in Scientific Machine Learning},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AIXSHRP2}},
  note         = {Machine review of arXiv:2607.07379}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

In agentic scientific machine learning (SciML), large language model (LLM) agents can discover surrogate models and select one by an automated score, typically an error metric. A low error, however, does not establish that the predicted fields satisfy the physics that matter for mechanics, such as boundary conditions, superposition, stiffness scaling, or causality. We introduce Physics-Audited Agentic SciML (PA-SciML), a verification-first workflow for agentic SciML discovery. The workflow fixes a scoring evaluator before search, derives reviewable machine-checkable physics requirements, checks each trained candidate on its outputs, and separately searches prescribed input ranges or measured load-history spans for high-violation cases without reference solution fields. A surrogate is reported as verified only under the stated checks. When enabled, the workflow also adds advisory numerical probes before training and tests one modeling change at a time to record which isolated edits are associated with score gains before reuse. In the reported computational-solid-mechanics numerical examples, the static elasticity run selects a surrogate with lower validation error than the error-only baseline while both selected models pass the common linear-elastic checks. In the transient elastodynamics run, an error-only baseline with similar mean error fails a stricter causality check by responding to future parts of the loading history, while the selected surrogate passes the stated checks. The main distinction is per-candidate physics evidence on predicted fields, not a richer aggregate score.

Figures

Figures reproduced from arXiv: 2607.07379 by Bilal Ahmed, Diab W. Abueidda, Mostafa E. Mobasher, Panos Pantidis.

Figure 1
Figure 1. Figure 1: High-level overview of PA-SciML. The user supplies a mechanics problem, data description, and physics requirements. The Discovery loop uses LLM-mediated roles to propose, critique, implement, and repair trial surrogates. Fixed routines score successful candidates and, when contracts are present, audit their predicted fields. The selected surrogate is reported with predictive accuracy separated from physics… view at source ↗
Figure 2
Figure 2. Figure 2: Audit-enabled PA-SciML workflow. From user-specified problem information, setup fixes the data summary, the Fixed evaluator, and, when auditing is enabled, physics contracts before Candidate search. LLM-mediated stages propose, critique, write, and repair trial surrogates; fixed routines validate, train, score, perform the Physics audit, and, when enabled, run the Adversary before reporting the final selec… view at source ↗
Figure 3
Figure 3. Figure 3: Discovery loop. Setup turns the supplied problem information into fixed run artifacts, including the Fixed evaluator that supplies one lower-is-better score. During Candidate search, the workflow chooses scored candidates to extend, optionally retrieves a saved method card, proposes a model change, writes or repairs the candidate implementation, and runs fixed validation, training, and scoring with it. Opt… view at source ↗
Figure 4
Figure 4. Figure 4: Verification layer. The verification sequence starts when the LLM-mediated Mechanician proposes a contract file from the supplied problem statement and calibration evidence generated during setup; setup fixes one verification setting before Candidate search; the trained candidate surrogate is held fixed; the Physics Auditor computes sampled violmax from active hard contracts; and the in-run Sampled hard-co… view at source ↗
Figure 5
Figure 5. Figure 5: Adversary: a no-reference high-violation input search. When enabled, the Adversary runs after the Physics audit as a fixed routine with no LLM-mediated step. It poses a bounded optimization, meaning a search over the prescribed admissible input domain Z. The input-side search variables z parameterize Z, and the objective maximizes the contract violation vc(z) while the trained surrogate is held fixed, incl… view at source ↗
Figure 6
Figure 6. Figure 6: Post-discovery attribution and Method-card saving. The figure follows one improving parent–child edge after Candidate search. Because the Fixed evaluator is lower-is-better, the score gain is g = sparent − schild > 0. LLM-mediated steps decompose the child change into at most the configured K edits and create one parent-code variant per edit; fixed execution then retrains and rescores each variant. Each ba… view at source ↗
Figure 7
Figure 7. Figure 7: Parametric linear elasticity: domain and boundary conditions. The unit square Ω = [0, 1]2 is an isotropic linear-elastic solid with material parameters E and ν. A uniform traction ¯t = (fx, fy) is applied on the top edge y=1, with fx the tangential and fy the normal component, each varying over [−0.3, 0.3] across samples (red arrows show one representative direction). The left edge x=0 is traction-free and… view at source ↗
Figure 8
Figure 8. Figure 8: Selected surrogate for the parametric elasticity example: a physics-structured DeepONet. Blue boxes are the trained networks; neutral boxes are fixed by construction and carry the linear-elastic structure. The branch turns the Poisson ratio into four head fields A, B, C, D, and the fixed compliance prefactors fx/E and fy/E assemble coefficients that are linear in the loads, so, for any trained weights, loa… view at source ↗
Figure 9
Figure 9. Figure 9: Parametric linear elasticity, selected surrogate diagnostics. (a) Distribution of the per-sample relative [PITH_FULL_IMAGE:figures/full_fig_p016_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Parametric linear elasticity: displacement-magnitude fields of the selected surrogate. Reference (top row) against selected-surrogate prediction (bottom row) of the displacement magnitude |u| over the unit square Ω = [0, 1]2 , for the validation cases at the 10th, 50th (median), and 90th percentiles of the per-sample relative L 2 error (n = 1000); each column header gives the selected case’s error. The tw… view at source ↗
Figure 11
Figure 11. Figure 11: Transient elastodynamics: domain and boundary conditions. The thin strip Ω = [−0.5, 0.5]×[−0.1, 0.1] is an isotropic linear-elastic solid in plane stress with material properties fixed for every sample, E = 10, ν = 0.25, and ρ = 1 in consistent units; only the loading history varies between samples. The left edge x=−0.5 is fully fixed, ux = uy = 0. The right edge x=+0.5 follows a prescribed time-dependent… view at source ↗
Figure 12
Figure 12. Figure 12: Selected surrogate for the transient elastodynamics example: a DeepONet with a causal load branch and a factorized space-time trunk. Blue boxes are the trained networks, one per displacement component; neutral boxes are fixed by construction and carry the transient linear-elastic structure. The branches read the right-edge motion history through left-padded, bias-free causal convolutions, so the coefficie… view at source ↗
Figure 13
Figure 13. Figure 13: Transient elastodynamics, selected surrogate diagnostics. (a) Distribution of the per-sample relative [PITH_FULL_IMAGE:figures/full_fig_p021_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Transient elastodynamics: field behavior of the selected surrogate. (a) Reference (solid) and predicted (dashed) displacement histories ux(t) and uy(t) at the interior node nearest the strip center, for the median-error validation case (relative L 2 2.63 × 10−3 ); the curves are in good agreement and both build up from rest, consistent with the zero initial conditions. (b) Magnitude of the final-time disp… view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

54 extracted references · 54 canonical work pages · 4 internal anchors

  1. [1]

    Raissi, P

    M. Raissi, P. Perdikaris, and G. E. Karniadakis. Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations.Journal of Computational Physics, 378:686–707, 2019

    work page 2019

  2. [2]

    Kevrekidis, Lu Lu, Paris Perdikaris, Sifan Wang, and Liu Yang

    George Em Karniadakis, Ioannis G. Kevrekidis, Lu Lu, Paris Perdikaris, Sifan Wang, and Liu Yang. Physics- informed machine learning.Nature Reviews Physics, 3(6):422–440, 2021

    work page 2021

  3. [3]

    Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators.Nature Machine Intelligence, 3(3): 218–229, 2021

    Lu Lu, Pengzhan Jin, Guofei Pang, Zhongqiang Zhang, and George Em Karniadakis. Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators.Nature Machine Intelligence, 3(3): 218–229, 2021

    work page 2021

  4. [4]

    Fourier neural operator for parametric partial differential equations

    Zongyi Li, Nikola Borislavov Kovachki, Kamyar Azizzadenesheli, Burigede Liu, Kaushik Bhattacharya, An- drew Stuart, and Anima Anandkumar. Fourier neural operator for parametric partial differential equations. In International Conference on Learning Representations (ICLR), 2021

    work page 2021

  5. [5]

    Bo Ni and Markus J. Buehler. MechAgents: Large language model multi-agent collaborations can solve mechanics problems, generate new data, and integrate knowledge.Extreme Mechanics Letters, 67:102131, 2024

    work page 2024

  6. [6]

    PDE-Agents: An LLM-Orchestrated Multi-Agent Framework for Automated Finite Element Simulations with Knowledge Graph-Augmented Reasoning

    Sayan Adhikari, Gulshan Noorsumar, and Øyvind Jensen. PDE-Agents: An LLM-orchestrated multi-agent framework for automated finite element simulations with knowledge graph-augmented reasoning. arXiv preprint arXiv:2606.07850, 2026

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  7. [7]

    ALL-FEM: Agentic large language models fine-tuned for finite element methods.Computer Methods in Applied Mechanics and Engineering, 457:118985, 2026

    Rushikesh Deotale, Adithya Srinivasan, Mahmoud Golestanian, Yuan Tian, Tianyi Zhang, Pavlos Vlachos, and Hector Gomez. ALL-FEM: Agentic large language models fine-tuned for finite element methods.Computer Methods in Applied Mechanics and Engineering, 457:118985, 2026

    work page 2026

  8. [8]

    OpenFOAMGPT: A retrieval-augmented large language model (LLM) agent for OpenFOAM-based computational fluid dynamics.Physics of Fluids, 37(3):035120, 2025

    Sandeep Pandey, Ran Xu, Wenkang Wang, and Xu Chu. OpenFOAMGPT: A retrieval-augmented large language model (LLM) agent for OpenFOAM-based computational fluid dynamics.Physics of Fluids, 37(3):035120, 2025

    work page 2025

  9. [9]

    Toward autonomous engineering design: A knowledge-guided multi-agent framework

    Varun Kumar and George Em Karniadakis. Toward autonomous engineering design: A knowledge-guided multi-agent framework. arXiv preprint arXiv:2511.03179, 2025

    work page arXiv 2025

  10. [10]

    AgenticSciML: collaborative multi-agent systems for emergent discovery in scientific machine learning.npj Artificial Intelligence, 2026

    Qile Jiang and George Karniadakis. AgenticSciML: collaborative multi-agent systems for emergent discovery in scientific machine learning.npj Artificial Intelligence, 2026

    work page 2026

  11. [11]

    ATHENA: Agentic Team for Hierarchical Evolutionary Numerical Algorithms

    Juan Diego Toscano, Daniel T. Chen, and George Em Karniadakis. ATHENA: Agentic team for hierarchical evolutionary numerical algorithms. arXiv preprint arXiv:2512.03476, 2025

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  12. [12]

    GRAFT-ATHENA: Self-Improving Agentic Teams for Autonomous Discovery and Evolutionary Numerical Algorithms

    Juan Diego Toscano, Zhaojie Chai, and George Em Karniadakis. GRAFT-ATHENA: Self-improving agentic teams for autonomous discovery and evolutionary numerical algorithms. arXiv preprint arXiv:2605.11117, 2026

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  13. [13]

    PINNsAgent: Automated PDE surrogation with large language models

    Qingpo Wuwu, Chonghan Gao, Tianyu Chen, Yihang Huang, Yuekai Zhang, Jianing Wang, Jianxin Li, Haoyi Zhou, and Shanghang Zhang. PINNsAgent: Automated PDE surrogation with large language models. In Proceedings of the 42nd International Conference on Machine Learning, volume 267 ofProceedings of Machine Learning Research, pages 68143–68165. PMLR, 2025

    work page 2025

  14. [14]

    Lang-PINN: From language to physics-informed neural networks via a multi-agent framework

    Xin He, Liangliang You, Hongduan Tian, Bo Han, Ivor Tsang, and Yew-Soon Ong. Lang-PINN: From language to physics-informed neural networks via a multi-agent framework. arXiv preprint arXiv:2510.05158, 2025

    work page arXiv 2025

  15. [15]

    Tianping Chen and Hong Chen. Universal approximation to nonlinear operators by neural networks with arbitrary activation functions and its application to dynamical systems.IEEE Transactions on Neural Networks, 6(4): 911–917, 1995

    work page 1995

  16. [16]

    Neural Operator: Learning Maps Between Function Spaces With Applications to PDEs

    Nikola Kovachki, Zongyi Li, Burigede Liu, Kamyar Azizzadenesheli, Kaushik Bhattacharya, Andrew Stuart, and Anima Anandkumar. Neural Operator: Learning Maps Between Function Spaces With Applications to PDEs. Journal of Machine Learning Research, 24(89):1–97, 2023

    work page 2023

  17. [17]

    Karniadakis

    Samuel Lanthaler, Siddhartha Mishra, and George E. Karniadakis. Error estimates for DeepONets: a deep learning framework in infinite dimensions.Transactions of Mathematics and Its Applications, 6(1), 2022. Article tnac001

    work page 2022

  18. [18]

    Learning the solution operator of parametric partial differential equations with physics-informed DeepONets.Science Advances, 7(40), 2021

    Sifan Wang, Hanwen Wang, and Paris Perdikaris. Learning the solution operator of parametric partial differential equations with physics-informed DeepONets.Science Advances, 7(40), 2021. Article eabi8605

    work page 2021

  19. [19]

    Physics-Informed Neural Operator for Learning Partial Differential Equations.ACM/IMS Journal of Data Science, 1(3):1–27, 2024

    Zongyi Li, Hongkai Zheng, Nikola Kovachki, David Jin, Haoxuan Chen, Burigede Liu, Kamyar Azizzadenesheli, and Anima Anandkumar. Physics-Informed Neural Operator for Learning Partial Differential Equations.ACM/IMS Journal of Data Science, 1(3):1–27, 2024. Article 9. 25 Physics-Audited Agentic SciMLA PREPRINT

    work page 2024

  20. [20]

    MIONet: Learning multiple-input operators via tensor product.SIAM Journal on Scientific Computing, 44(6):A3490–A3514, 2022

    Pengzhan Jin, Shuai Meng, and Lu Lu. MIONet: Learning multiple-input operators via tensor product.SIAM Journal on Scientific Computing, 44(6):A3490–A3514, 2022

    work page 2022

  21. [21]

    A comprehensive and fair comparison of two neural operators (with practical extensions) based on FAIR data.Computer Methods in Applied Mechanics and Engineering, 393, 2022

    Lu Lu, Xuhui Meng, Shengze Cai, Zhiping Mao, Somdatta Goswami, Zhongqiang Zhang, and George Em Karniadakis. A comprehensive and fair comparison of two neural operators (with practical extensions) based on FAIR data.Computer Methods in Applied Mechanics and Engineering, 393, 2022. Article 114778

    work page 2022

  22. [22]

    Fourier Neural Operator with Learned Deformations for PDEs on General Geometries.Journal of Machine Learning Research, 24(388):1–26, 2023

    Zongyi Li, Daniel Zhengyu Huang, Burigede Liu, and Anima Anandkumar. Fourier Neural Operator with Learned Deformations for PDEs on General Geometries.Journal of Machine Learning Research, 24(388):1–26, 2023

    work page 2023

  23. [23]

    Gege Wen, Zongyi Li, Kamyar Azizzadenesheli, Anima Anandkumar, and Sally M. Benson. U-FNO—An enhanced Fourier neural operator-based deep-learning model for multiphase flow.Advances in Water Resources, 163, 2022. Article 104180

    work page 2022

  24. [24]

    Abueidda, Seid Koric, Nahil A

    Diab W. Abueidda, Seid Koric, Nahil A. Sobh, and Huseyin Sehitoglu. Deep learning for plasticity and thermo- viscoplasticity.International Journal of Plasticity, 136, 2021. Article 102852

    work page 2021

  25. [25]

    Abueidda, Syed Bahauddin Alam, and Seid Koric

    Jaewan Park, Kazuma Kobayashi, Qibang Liu, Amar Alem Koric, Diab W. Abueidda, Syed Bahauddin Alam, and Seid Koric. Sequential deep operator neural networks for plastic and thermo-viscoplastic transient material behavior.International Journal of Plasticity, 201, 2026. Article 104689

    work page 2026

  26. [26]

    Stress Field Prediction in Cantilevered Structures Using Convolutional Neural Networks.Journal of Computing and Information Science in Engineering, 20(1), 2020

    Zhenguo Nie, Haoliang Jiang, and Levent Burak Kara. Stress Field Prediction in Cantilevered Structures Using Convolutional Neural Networks.Journal of Computing and Information Science in Engineering, 20(1), 2020. Article 011002

    work page 2020

  27. [27]

    A deep energy method for finite deformation hyperelasticity.European Journal of Mechanics - A/Solids, 80, 2020

    Vien Minh Nguyen-Thanh, Xiaoying Zhuang, and Timon Rabczuk. A deep energy method for finite deformation hyperelasticity.European Journal of Mechanics - A/Solids, 80, 2020. Article 103874

    work page 2020

  28. [28]

    A physics-informed variational DeepONet for predicting crack path in quasi-brittle materials.Computer Methods in Applied Mechanics and Engineering, 391, 2022

    Somdatta Goswami, Minglang Yin, Yue Yu, and George Em Karniadakis. A physics-informed variational DeepONet for predicting crack path in quasi-brittle materials.Computer Methods in Applied Mechanics and Engineering, 391, 2022. Article 114587

    work page 2022

  29. [29]

    Kovachki, and Andrew M

    Kaushik Bhattacharya, Bamdad Hosseini, Nikola B. Kovachki, and Andrew M. Stuart. Model Reduction and Neural Networks for Parametric PDEs.The SMAI Journal of Computational Mathematics, 7:121–157, 2021

    work page 2021

  30. [30]

    Nonlocal kernel network (NKN): A stable and resolution-independent deep neural network.Journal of Computational Physics, 469, 2022

    Huaiqian You, Yue Yu, Marta D’Elia, Tian Gao, and Stewart Silling. Nonlocal kernel network (NKN): A stable and resolution-independent deep neural network.Journal of Computational Physics, 469, 2022. Article 111536

    work page 2022

  31. [31]

    Abueidda, Mbebo Nonna, Panos Pantidis, and Mostafa E

    Diab W. Abueidda, Mbebo Nonna, Panos Pantidis, and Mostafa E. Mobasher. Time resolution independent operator learning.Computer Methods in Applied Mechanics and Engineering, 450, 2026. Article 118586

    work page 2026

  32. [32]

    Geom-DeepONet: A point-cloud-based deep operator network for field predictions on 3D parameterized geometries.Computer Methods in Applied Mechanics and Engineering, 429, 2024

    Junyan He, Seid Koric, Diab Abueidda, Ali Najafi, and Iwona Jasiuk. Geom-DeepONet: A point-cloud-based deep operator network for field predictions on 3D parameterized geometries.Computer Methods in Applied Mechanics and Engineering, 429, 2024. Article 117130

    work page 2024

  33. [33]

    Mobasher

    Panos Pantidis and Mostafa E. Mobasher. Integrated Finite Element Neural Network (I-FENN) for non-local continuum damage mechanics.Computer Methods in Applied Mechanics and Engineering, 404, 2023. Article 115766

    work page 2023

  34. [34]

    Amin, Diab W

    Fouad M. Amin, Diab W. Abueidda, Panos Pantidis, and Mostafa E. Mobasher. I-FENN with DeepONets: Accelerating simulations in coupled multiphysics problems.Computer Methods in Applied Mechanics and Engineering, 451, 2026. Article 118645

    work page 2026

  35. [35]

    Bock, Roland C

    Frederic E. Bock, Roland C. Aydin, Christian J. Cyron, Norbert Huber, Surya R. Kalidindi, and Benjamin Klusemann. A Review of the Application of Machine Learning and Data Mining Approaches in Continuum Materials Mechanics.Frontiers in Materials, 6, 2019. Article 110

    work page 2019

  36. [36]

    Auto-PINN: Understanding and Optimizing Physics-Informed Neural Architecture

    Yicheng Wang, Xiaotian Han, Chia-Yuan Chang, Daochen Zha, Ulisses Braga-Neto, and Xia Hu. Auto-PINN: Understanding and Optimizing Physics-Informed Neural Architecture. arXiv preprint arXiv:2205.13748, 2022

    work page internal anchor Pith review Pith/arXiv arXiv 2022

  37. [37]

    Boiko, Robert MacKnight, Ben Kline, and Gabe Gomes

    Daniil A. Boiko, Robert MacKnight, Ben Kline, and Gabe Gomes. Autonomous chemical research with large language models.Nature, 624(7992):570–578, 2023

    work page 2023

  38. [38]

    Bran, Sam Cox, Oliver Schilter, Carlo Baldassari, Andrew D

    Andres M. Bran, Sam Cox, Oliver Schilter, Carlo Baldassari, Andrew D. White, and Philippe Schwaller. Aug- menting large language models with chemistry tools.Nature Machine Intelligence, 6(5):525–535, 2024

    work page 2024

  39. [39]

    Towards end-to-end automation of AI research.Nature, 651(8107):914–919, 2026

    Chris Lu, Cong Lu, Robert Tjarko Lange, Yutaro Yamada, Shengran Hu, Jakob Foerster, David Ha, and Jeff Clune. Towards end-to-end automation of AI research.Nature, 651(8107):914–919, 2026

    work page 2026

  40. [40]

    Narasimhan, and Yuan Cao

    Shunyu Yao, Jeffrey Zhao, Dian Yu, Nan Du, Izhak Shafran, Karthik R. Narasimhan, and Yuan Cao. ReAct: Synergizing reasoning and acting in language models. InInternational Conference on Learning Representations, 2023. 26 Physics-Audited Agentic SciMLA PREPRINT

    work page 2023

  41. [41]

    Tenenbaum, and Igor Mordatch

    Yilun Du, Shuang Li, Antonio Torralba, Joshua B. Tenenbaum, and Igor Mordatch. Improving Factuality and Reasoning in Language Models through Multiagent Debate. InProceedings of the 41st International Conference on Machine Learning, volume 235 ofProceedings of Machine Learning Research, pages 11733–11763. PMLR, 2024

    work page 2024

  42. [42]

    CAMEL: Communicative Agents for “Mind” Exploration of Large Language Model Society

    Guohao Li, Hasan Hammoud, Hani Itani, Dmitrii Khizbullin, and Bernard Ghanem. CAMEL: Communicative Agents for “Mind” Exploration of Large Language Model Society. InAdvances in Neural Information Processing Systems, volume 36, pages 51991–52008. Curran Associates, Inc., 2023

    work page 2023

  43. [43]

    White, Doug Burger, and Chi Wang

    Qingyun Wu, Gagan Bansal, Jieyu Zhang, Yiran Wu, Beibin Li, Erkang Zhu, Li Jiang, Xiaoyun Zhang, Shaokun Zhang, Jiale Liu, Ahmed Hassan Awadallah, Ryen W. White, Doug Burger, and Chi Wang. AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversations. InFirst Conference on Language Modeling, 2024

    work page 2024

  44. [44]

    MetaGPT: Meta programming for A multi-agent collaborative framework

    Sirui Hong, Mingchen Zhuge, Jonathan Chen, Xiawu Zheng, Yuheng Cheng, Jinlin Wang, Ceyao Zhang, Zili Wang, Steven Ka Shing Yau, Zijuan Lin, Liyang Zhou, Chenyu Ran, Lingfeng Xiao, Chenglin Wu, and Jürgen Schmidhuber. MetaGPT: Meta programming for A multi-agent collaborative framework. InInternational Conference on Learning Representations, 2024

    work page 2024

  45. [45]

    Reflexion: Language Agents with Verbal Reinforcement Learning

    Noah Shinn, Federico Cassano, Ashwin Gopinath, Karthik Narasimhan, and Shunyu Yao. Reflexion: Language Agents with Verbal Reinforcement Learning. InAdvances in Neural Information Processing Systems, volume 36, pages 8634–8652. Curran Associates, Inc., 2023

    work page 2023

  46. [46]

    Xing, Hao Zhang, Joseph E

    Lianmin Zheng, Wei-Lin Chiang, Ying Sheng, Siyuan Zhuang, Zhanghao Wu, Yonghao Zhuang, Zi Lin, Zhuohan Li, Dacheng Li, Eric P. Xing, Hao Zhang, Joseph E. Gonzalez, and Ion Stoica. Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena. InAdvances in Neural Information Processing Systems, volume 36, pages 46595–46623. Curran Associates, Inc., 2023

    work page 2023

  47. [47]

    Physics-constrained deep learning for high-dimensional surrogate modeling and uncertainty quantification without labeled data.Journal of Computational Physics, 394:56–81, 2019

    Yinhao Zhu, Nicholas Zabaras, Phaedon-Stelios Koutsourelakis, and Paris Perdikaris. Physics-constrained deep learning for high-dimensional surrogate modeling and uncertainty quantification without labeled data.Journal of Computational Physics, 394:56–81, 2019

    work page 2019

  48. [48]

    Lu Lu, Raphaël Pestourie, Wenjie Yao, Zhicheng Wang, Francesc Verdugo, and Steven G. Johnson. Physics- Informed Neural Networks with Hard Constraints for Inverse Design.SIAM Journal on Scientific Computing, 43 (6):B1105–B1132, 2021

    work page 2021

  49. [49]

    Enforcing Analytic Constraints in Neural Networks Emulating Physical Systems.Physical Review Letters, 126(9), 2021

    Tom Beucler, Michael Pritchard, Stephan Rasp, Jordan Ott, Pierre Baldi, and Pierre Gentine. Enforcing Analytic Constraints in Neural Networks Emulating Physical Systems.Physical Review Letters, 126(9), 2021. Article 098302

    work page 2021

  50. [50]

    Dill, Kyle Julian, and Mykel J

    Guy Katz, Clark Barrett, David L. Dill, Kyle Julian, and Mykel J. Kochenderfer. Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks. InComputer Aided Verification (CAV), volume 10426 ofLecture Notes in Computer Science, pages 97–117, 2017

    work page 2017

  51. [51]

    Huang, Duligur Ibeling, Kyle Julian, Christopher Lazarus, Rachel Lim, Parth Shah, Shantanu Thakoor, Haoze Wu, Aleksandar Zelji´c, David L

    Guy Katz, Derek A. Huang, Duligur Ibeling, Kyle Julian, Christopher Lazarus, Rachel Lim, Parth Shah, Shantanu Thakoor, Haoze Wu, Aleksandar Zelji´c, David L. Dill, Mykel J. Kochenderfer, and Clark Barrett. The Marabou Framework for Verification and Analysis of Deep Neural Networks. InComputer Aided Verification (CAV), volume 11561 ofLecture Notes in Compu...

    work page 2019

  52. [52]

    Goodfellow, Jonathon Shlens, and Christian Szegedy

    Ian J. Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and Harnessing Adversarial Examples. In International Conference on Learning Representations (ICLR), 2015

    work page 2015

  53. [53]

    Towards Deep Learning Models Resistant to Adversarial Attacks

    Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. Towards Deep Learning Models Resistant to Adversarial Attacks. InInternational Conference on Learning Representations (ICLR), 2018

    work page 2018

  54. [54]

    Psaros, Xuhui Meng, Zongren Zou, Ling Guo, and George Em Karniadakis

    Apostolos F. Psaros, Xuhui Meng, Zongren Zou, Ling Guo, and George Em Karniadakis. Uncertainty quantification in scientific machine learning: Methods, metrics, and comparisons.Journal of Computational Physics, 477, 2023. Article 111902. A Reproducibility A.1 Data availability The code and data supporting this study will be made publicly available upon pub...

    work page 2023

This paper was first reviewed by glm-5.2 on July 9, 2026.