Pith. sign in

REVIEW 12 cited by

Discovering Symbolic Models from Deep Learning with Inductive Biases

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 2006.11287 v2 pith:MWUYBZSI submitted 2020-06-19 cs.LG astro-ph.COastro-ph.IMphysics.comp-phstat.ML

Discovering Symbolic Models from Deep Learning with Inductive Biases

classification cs.LG astro-ph.COastro-ph.IMphysics.comp-phstat.ML
keywords symbolicneuralrepresentationsapplyapproachbiasesdarkdeep
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We develop a general approach to distill symbolic representations of a learned deep model by introducing strong inductive biases. We focus on Graph Neural Networks (GNNs). The technique works as follows: we first encourage sparse latent representations when we train a GNN in a supervised setting, then we apply symbolic regression to components of the learned model to extract explicit physical relations. We find the correct known equations, including force laws and Hamiltonians, can be extracted from the neural network. We then apply our method to a non-trivial cosmology example-a detailed dark matter simulation-and discover a new analytic formula which can predict the concentration of dark matter from the mass distribution of nearby cosmic structures. The symbolic expressions extracted from the GNN using our technique also generalized to out-of-distribution data better than the GNN itself. Our approach offers alternative directions for interpreting neural networks and discovering novel physical principles from the representations they learn.

discussion (0)

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

Forward citations

Cited by 12 Pith papers

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

  1. Sample Complexity of Scientific Discovery: PAC Learnability of Compositional Function Trees

    cs.LG 2026-06 unverdicted novelty 7.0

    Proves that Rademacher complexity of depth-d compositional trees over finite operator vocabulary is controlled by (K b L)^{d} / sqrt(n) under Lipschitz conditions on operators.

  2. Physics-guided discovery of dynamical dark-energy equations of state through iterative AI reasoning

    astro-ph.CO 2026-06 unverdicted novelty 7.0

    An iterative AI reasoning process proposes new dynamical dark energy equations of state that are competitive with traditional forms on supernova, BAO, and Planck data.

  3. EML-CD: Causal Mechanism Recovery via EML Symbolic Trees in Structure Learning

    stat.ML 2026-06 unverdicted novelty 7.0

    EML-CD recovers causal DAG structure and closed-form mechanisms via gated EML trees, matching PC/GES SHD on Sachs data while recovering 10 of 11 function families in bivariate tests and outperforming SINDy on mechanism f-MSE.

  4. Symbolic Classification-Enabled LHC Limits Online BSM Global Fits

    hep-ph 2026-05 unverdicted novelty 7.0

    Symbolic regression produces an approximate classifier for LHC exclusion limits that enables their direct inclusion during pMSSM global fits.

  5. Predicting intermediate-mass black hole formation in star clusters with machine learning

    astro-ph.GA 2026-05 unverdicted novelty 7.0

    Machine learning regressors trained on Rapster simulations forecast that globular clusters rarely host black holes above 100 solar masses while a few nuclear star clusters may exceed this threshold.

  6. Neuro-Symbolic ODE Discovery with Latent Grammar Flow

    cs.LG 2026-04 unverdicted novelty 7.0

    Latent Grammar Flow discovers ODEs by placing grammar-based equation representations in a discrete latent space, using a behavioral loss to cluster similar equations, and sampling via a discrete flow model guided by d...

  7. Learning to Unscramble: Simplifying Symbolic Expressions via Self-Supervised Oracle Trajectories

    hep-th 2026-03 unverdicted novelty 7.0

    A permutation-equivariant transformer trained on self-supervised oracle trajectories from scrambled expressions achieves near-perfect simplification rates for dilogarithms and 100% success on 5-point gluon scattering ...

  8. Scale-Aware Adversarial Analysis: A Diagnostic for Generative AI in Multiscale Complex Systems

    cs.LG 2026-05 unverdicted novelty 6.0

    A new scale-aware diagnostic framework shows that unconstrained diffusion generative models exhibit structural freezing and instability instead of smooth physical responses under multiscale perturbations.

  9. Into the Gompverse: A robust Gompertzian reionization model for CMB analyses

    astro-ph.CO 2026-04 unverdicted novelty 6.0

    A Gompertzian reionization model with three nuisance parameters demotes optical depth to a derived quantity, reducing its uncertainty by a factor of three and revealing potential neutrino mass tension in CMB analyses.

  10. Self-Revising Discovery Systems for Science: A Categorical Framework for Agentic Artificial Intelligence

    cs.AI 2026-05 unverdicted novelty 5.0

    A category-theoretic model frames scientific discovery as verified regime transitions via left Kan extensions that preserve and compare artifacts across schema changes in agentic AI.

  11. Neuro-Symbolic ODE Discovery with Latent Grammar Flow

    cs.LG 2026-04 unverdicted novelty 5.0

    Latent Grammar Flow embeds grammar-based ODE representations into a discrete latent space with a behavioural loss and samples candidate equations via discrete flow to fit observed data.

  12. Machine Learning for Multi-messenger Probes of New Physics and Cosmology: A Review and Perspective

    hep-ph 2026-04 unverdicted novelty 3.0

    A review summarizing machine learning methods for multi-messenger probes of dark matter and new physics, with a proposed plan for future integrated analyses.