Pith. sign in

REVIEW 3 cited by

An Approach to Symbolic Regression Using Feyn

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 2104.05417 v1 pith:TWEMDHA7 submitted 2021-04-12 cs.LG cs.AIcs.ET

classification cs.LGcs.AIcs.ET
keywords qlatticefeynlearningmachinemodelstoolapproachcalled
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this article we introduce the supervised machine learning tool called Feyn. The simulation engine that powers this tool is called the QLattice. The QLattice is a supervised machine learning tool inspired by Richard Feynman's path integral formulation, that explores many potential models that solves a given problem. It formulates these models as graphs that can be interpreted as mathematical equations, allowing the user to completely decide on the trade-off between interpretability, complexity and model performance. We touch briefly upon the inner workings of the QLattice, and show how to apply the python package, Feyn, to scientific problems. We show how it differs from traditional machine learning approaches, what it has in common with them, as well as some of its commonalities with symbolic regression. We describe the benefits of this approach as opposed to black box models. To illustrate this, we go through an investigative workflow using a basic data set and show how the QLattice can help you reason about the relationships between your features and do data discovery.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Probabilistic Symbolic Regression for Equation Discovery via Operator-induced and Regularized Symbolic Forests

    stat.ME 2025-09 conditional novelty 7.0 of 10

    A hierarchical Bayesian symbolic regression framework (HierBOSSS) with tree-based expression priors, Occam-window model selection, and posterior concentration rates at near-parametric and near-minimax speeds.

  2. VaSST: Variational Inference for Symbolic Regression using Soft Symbolic Trees

    stat.ME 2026-02 conditional novelty 6.0 of 10

    VaSST uses variational inference over continuously relaxed symbolic trees to recover closed-form expressions from noisy data, reporting competitive structural recovery and predictive accuracy on simulated and Feynman ...

  3. (Exhaustive) Symbolic Regression and model selection by minimum description length

    astro-ph.IM 2025-07 conditional novelty 3.0 of 10

    Exhaustive search over simple functions ranked by description length beats the Friedmann equation, MOND, and common inflaton potentials on astrophysical datasets.

Pith tools