Pith. sign in

REVIEW 2 cited by

Learning Symbolic Physics with Graph Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1909.05862 v2 pith:RVOQULIH submitted 2019-09-12 cs.LG astro-ph.IMphysics.comp-phstat.ML

classification cs.LGastro-ph.IMphysics.comp-phstat.ML
keywords graphsymbolicapproachexplicitinductiveknowledgelearnlearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce an approach for imposing physically motivated inductive biases on graph networks to learn interpretable representations and improved zero-shot generalization. Our experiments show that our graph network models, which implement this inductive bias, can learn message representations equivalent to the true force vector when trained on n-body gravitational and spring-like simulations. We use symbolic regression to fit explicit algebraic equations to our trained model's message function and recover the symbolic form of Newton's law of gravitation without prior knowledge. We also show that our model generalizes better at inference time to systems with more bodies than had been experienced during training. Our approach is extensible, in principle, to any unknown interaction law learned by a graph network, and offers a valuable technique for interpreting and inferring explicit causal theories about the world from implicit knowledge captured by deep learning.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. When is a System Discoverable from Data? Discovery Requires Chaos

    math.DS 2025-11 conditional novelty 7.0 of 10

    Uniquely identifying an ODE from trajectory data depends on the trajectory filling enough of the state space: chaos on a high-dimensional attractor yields analytic discoverability, while first integrals preclude it.

  2. Data-driven discovery of dynamical models in biology

    q-bio.QM 2025-09 conditional novelty 4.0 of 10

    A review benchmarking regression, network, and decomposition methods on the Oregonator model under the Koopman operator framework, with illustrative experiments on simulated data.

Pith tools