OccamNet: A Fast Neural Model for Symbolic Regression at Scale
Not on the map. Why?
Abstract (arXiv)
Neural networks' expressiveness comes at the cost of complex, black-box models that often extrapolate poorly beyond the domain of the training dataset, conflicting with the goal of finding compact analytic expressions to describe scientific data. We introduce OccamNet, a neural network model that finds interpretable, compact, and sparse symbolic fits to data, `a la Occam's razor. Our model defines a probability distribution over functions with efficient sampling and function evaluation. We train by sampling functions and biasing the probability mass toward better fitting solutions, backpropagating using cross-entropy matching in a reinforcement-learning loss. OccamNet can identify symbolic fits for a variety of problems, including analytic and non-analytic functions, implicit functions, and simple image classification, and can outperform state-of-the-art symbolic regression methods on real-world regression datasets. Our method requires a minimal memory footprint, fits complicated functions in minutes on a single CPU, and scales on a GPU.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 3; 2024: 5; 2025: 3; 2026: 1.
13 papers.
Sort:
By area:
- 2024KAN: Kolmogorov-Arnold Networkscited by 634
- 2024KAN 2.0: Kolmogorov-Arnold Networks Meet Sciencecited by 116
- 2023Transformer-based Planning for Symbolic Regressioncited by 72
- 2021Discovering Sparse Interpretable Dynamics from Partial Observationscited by 25
- 2023Toward Physically Plausible Data-Driven Models: A Novel Neural Network Approach to Symbolic Regressioncited by 14
- 2025Interpretable Machine Learning in Physics: A Reviewcited by 11
- 2024OccamLLM: Fast and Exact Language Model Arithmetic in a Single Stepcited by 7
- 2023Learning Symbolic Rules over Abstract Meaning Representations for Textual Reinforcement Learningcited by 4
- 2024Closed-Form Interpretation of Neural Network Classifiers with Symbolic Gradientscited by 3
- 2025Data-driven Discovery of Digital Twins in Biomedical Researchcited by 2
- 2024Closed-Form Interpretation of Neural Network Latent Spaces with Symbolic Gradientscited by 1
- 2025Modular connectivity in neural networks emerges from Poisson noise-motivated regularisation, and promotes robustness and compositional generalisationcited by 0
- 2026Knowledge-Informed Kernel State Reconstruction from Heterogeneous Partial Observations29 Jan 2026
- 2025Modular connectivity in neural networks emerges from Poisson noise-motivated regularisation, and promotes robustness and compositional generalisation5 Dec 2025
- 2025Data-driven Discovery of Digital Twins in Biomedical Research29 Aug 2025
- 2025Interpretable Machine Learning in Physics: A Review30 Mar 2025
- 2024Closed-Form Interpretation of Neural Network Latent Spaces with Symbolic Gradients9 Sep 2024
- 2024KAN 2.0: Kolmogorov-Arnold Networks Meet Science19 Aug 2024
- 2024OccamLLM: Fast and Exact Language Model Arithmetic in a Single Step4 Jun 2024
- 2024KAN: Kolmogorov-Arnold Networks30 Apr 2024
- 2024Closed-Form Interpretation of Neural Network Classifiers with Symbolic Gradients10 Jan 2024
- 2023Learning Symbolic Rules over Abstract Meaning Representations for Textual Reinforcement Learning5 Jul 2023
- 2023Transformer-based Planning for Symbolic Regression13 Mar 2023
- 2023Toward Physically Plausible Data-Driven Models: A Novel Neural Network Approach to Symbolic Regression1 Feb 2023
1 more
- 2024KAN: Kolmogorov-Arnold Networkscited by 634
- 2024KAN 2.0: Kolmogorov-Arnold Networks Meet Sciencecited by 116
- 2023Transformer-based Planning for Symbolic Regressioncited by 72
- 2021Discovering Sparse Interpretable Dynamics from Partial Observationscited by 25
- 2023Toward Physically Plausible Data-Driven Models: A Novel Neural Network Approach to Symbolic Regressioncited by 14
- 2025Interpretable Machine Learning in Physics: A Reviewcited by 11
- 2023Learning Symbolic Rules over Abstract Meaning Representations for Textual Reinforcement Learningcited by 4
- 2024Closed-Form Interpretation of Neural Network Classifiers with Symbolic Gradientscited by 3
- 2025Data-driven Discovery of Digital Twins in Biomedical Researchcited by 2
- 2024Closed-Form Interpretation of Neural Network Latent Spaces with Symbolic Gradientscited by 1
- 2025Modular connectivity in neural networks emerges from Poisson noise-motivated regularisation, and promotes robustness and compositional generalisationcited by 0
- 2026Knowledge-Informed Kernel State Reconstruction from Heterogeneous Partial Observationscited by 0
- 2026Knowledge-Informed Kernel State Reconstruction from Heterogeneous Partial Observations29 Jan 2026
- 2025Modular connectivity in neural networks emerges from Poisson noise-motivated regularisation, and promotes robustness and compositional generalisation5 Dec 2025
- 2025Data-driven Discovery of Digital Twins in Biomedical Research29 Aug 2025
- 2025Interpretable Machine Learning in Physics: A Review30 Mar 2025
- 2024Closed-Form Interpretation of Neural Network Latent Spaces with Symbolic Gradients9 Sep 2024
- 2024KAN 2.0: Kolmogorov-Arnold Networks Meet Science19 Aug 2024
- 2024KAN: Kolmogorov-Arnold Networks30 Apr 2024
- 2024Closed-Form Interpretation of Neural Network Classifiers with Symbolic Gradients10 Jan 2024
- 2023Learning Symbolic Rules over Abstract Meaning Representations for Textual Reinforcement Learning5 Jul 2023
- 2023Transformer-based Planning for Symbolic Regression13 Mar 2023
- 2023Toward Physically Plausible Data-Driven Models: A Novel Neural Network Approach to Symbolic Regression1 Feb 2023
- 2021Discovering Sparse Interpretable Dynamics from Partial Observations22 Jul 2021