Bayesian Symbolic Regression with Entropic Reinforcement Learning

• URL: http://arxiv.org/abs/2608.09617v2
• Date: Tue, 11 Aug 2026 14:35:30 GMT
• Title: Bayesian Symbolic Regression with Entropic Reinforcement Learning
• Abstract summary: We propose ERRLESS, a scalable approach for sampling from the posterior distribution over expressions given data.<n>ERRLESS learns a neural policy that constructs expressions sequentially by building up their abstract syntax trees.<n>We demonstrate that ERRLESS achieves competitive results on the Feynman benchmark while producing short and interpretable expressions.
• Score: 40.36303059396686
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Symbolic regression is the problem of finding an algebraic expression describing a stochastic dependence of a target variable on a set of inputs. Unlike forms of regression that fit parameters assuming a fixed model structure, symbolic regression is a search problem over the space of expressions, represented, for example, as abstract syntax trees using a library of operators. Symbolic regression is typically used in settings with limited, noisy data in the natural sciences. However, searching for a single best-fitting expression fails to capture the epistemic uncertainty about the expression, which motivates a Bayesian perspective that enables uncertainty quantification and specification of natural priors to constrain the search space. In this work, we propose ERRLESS (Entropy-Regularized Reinforcement Learning for Expression Structure Sampling), a scalable approach for sampling from the posterior distribution over expressions given data using maximum-entropy reinforcement learning. ERRLESS learns a neural policy that constructs expressions sequentially by building up their abstract syntax trees. At convergence, the policy samples expressions from the posterior. At test time, expressions can be sampled by rollouts of this policy. We demonstrate that ERRLESS achieves competitive results on the Feynman benchmark while producing short and interpretable expressions. Additionally, we demonstrate that the mean of the posterior predictive approximated by ERRLESS achieves a high coefficient of determination ($R^2$) compared to an SMC baseline, highlighting the benefits of the Bayesian perspective in symbolic regression.

Related papers

• Sparse Orthogonal Regression Technique: A Spectral Framework for Equation Discovery, Approximation, and Integration [4.389213808289583]
  We develop a sparse framework for learning orthonormal-basis expansions from noisy and irregularly sampled data.<n>SORT estimates expansion coefficients using L1-regularized regression, avoiding explicit quadrature or analytic inner-product evaluation.<n>The central application is data-driven discovery of ordinary differential equations.
  arXiv  Detail & Related papers  (2026-08-13T17:31:27Z)
• Factorize to Generalize: Retrieval-Guided Invariant-Dynamic Decomposition for Time Series Forecasting [64.2640656619583]
  Time series foundation models (TSFMs) have recently achieved strong zero-shot forecasting performance through large-scale pretraining and retrieval-augmented prediction.<n>We propose a Retrieval-guided Invariant-Dynamic DEcomposition framework for time series forecasting.
  arXiv  Detail & Related papers  (2026-05-24T07:31:55Z)
• Deep Variational Inference Symbolic Regression [41.99844472131922]
  Symbolic regression discovers explicit, interpretable equations without assuming a functional form in advance.<n>Deep Symbolic Regression (DSR) uses a neural network to generate symbolic expressions.<n>We introduce Deep Variational Inference Symbolic Regression (DVISR), a variational Bayesian extension of DSR.
  arXiv  Detail & Related papers  (2026-05-01T20:04:11Z)
• VaSST: Variational Inference for Symbolic Regression using Soft Symbolic Trees [2.6521352889229446]
  We introduce VaSST, a scalable probabilistic framework for symbolic regression based on variational inference.<n>VaSST achieves superior performance in both structural recovery and predictive accuracy compared to state-of-the-art symbolic regression methods.
  arXiv  Detail & Related papers  (2026-02-27T00:07:31Z)
• Bayesian Symbolic Regression via Posterior Sampling [0.0]
  Symbolic regression is a powerful tool for discovering governing equations directly from data, but its sensitivity to noise hinders its broader application.<n>This paper introduces a Sequential Monte Carlo framework for Bayesian symbolic regression that approximates the posterior distribution over symbolic expressions.
  arXiv  Detail & Related papers  (2025-12-11T17:38:20Z)
• Sparse Interpretable Deep Learning with LIES Networks for Symbolic Regression [22.345828337550575]
  Symbolic regression aims to discover closed-form mathematical expressions that accurately describe data.<n>Existing SR methods often rely on population-based search or autoregressive modeling.<n>We introduce LIES (Logarithm, Identity, Exponential, Sine), a fixed neural network architecture with interpretable primitive activations that are optimized to model symbolic expressions.
  arXiv  Detail & Related papers  (2025-06-09T22:05:53Z)
• Estimating Causal Effects from Learned Causal Networks [56.14597641617531]
  We propose an alternative paradigm for answering causal-effect queries over discrete observable variables. We learn the causal Bayesian network and its confounding latent variables directly from the observational data. We show that this emphmodel completion learning approach can be more effective than estimand approaches.
  arXiv  Detail & Related papers  (2024-08-26T08:39:09Z)
• Scaling and renormalization in high-dimensional regression [72.59731158970894]
  We present a unifying perspective on recent results on ridge regression.<n>We use the basic tools of random matrix theory and free probability, aimed at readers with backgrounds in physics and deep learning.<n>Our results extend and provide a unifying perspective on earlier models of scaling laws.
  arXiv  Detail & Related papers  (2024-05-01T15:59:00Z)
• Deep Generative Symbolic Regression [83.04219479605801]
  Symbolic regression aims to discover concise closed-form mathematical equations from data. Existing methods, ranging from search to reinforcement learning, fail to scale with the number of input variables. We propose an instantiation of our framework, Deep Generative Symbolic Regression.
  arXiv  Detail & Related papers  (2023-12-30T17:05:31Z)
• Understanding Augmentation-based Self-Supervised Representation Learning via RKHS Approximation and Regression [53.15502562048627]
  Recent work has built the connection between self-supervised learning and the approximation of the top eigenspace of a graph Laplacian operator. This work delves into a statistical analysis of augmentation-based pretraining.
  arXiv  Detail & Related papers  (2023-06-01T15:18:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.