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
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.
Forward citations
Cited by 2 Pith papers
-
When is a System Discoverable from Data? Discovery Requires Chaos
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.
-
Data-driven discovery of dynamical models in biology
A review benchmarking regression, network, and decomposition methods on the Oregonator model under the Koopman operator framework, with illustrative experiments on simulated data.
Discussion (0). Sign in to comment.