Symbolic Density Estimators for Unnormalized Distributions
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: I'm Tom, and with me are Jane, Lu, senior AI researcher at Tsinghua, Meng, lead engineer at a mysterious AI startup and Lalam, the in-house Large Language Model.
Jane: Today's paper: "Symbolic Density Estimators for Unnormalized Distributions".
Tom: Estimating symbolic or analytical forms of probability density functions from observed samples using deep generative models and symbolic regression allows for the automated discovery of interpretable relationships characterizing complex physical…
Jane: First, who's behind it and why it matters.
Title and authors: Tom: So we're looking at this paper now, "Symbolic Density Estimators for Unnormalized Distributions," and it starts by pointing out that estimating the symbolic or analytical form of probability density functions from observed samples is a really fundamental challenge in statistical and computational modelling.
Jane: That sounds like a big deal because traditionally you have to rely heavily on expert intuition to pick the right functional forms or parametric families for those distributions, which means figuring out the coefficients later is often just parameter estimation.
Lu: It's about automating model discovery, so taking something that usually requires a lot of human expertise and turning it into an AI problem is really interesting.
Meng: So if we're talking about the title, "Symbolic Density Estimators for Unnormalized Distributions," what does that mean in practical terms?
Tom: It means they are trying to automate how we figure out the exact mathematical expression—the symbolic form—of a probability density function just by looking at some samples you have.
Jane: They're not just fitting a curve; they're trying to find the underlying equation, like an energy function H(x) that governs that distribution, which is what we see in physical systems when we talk about Boltzmann distributions.
Lu: It connects density estimation directly to physics, which is a major intersection for deep generative models.
Meng: So the main implication here seems to be using machine learning not just to generate samples, but to derive interpretable physical laws from raw data that might be non-perturbative.
The paper's summary: Tom: The core idea of this paper is using a framework that combines deep generative modeling with Symbolic Regression, which they call the "Symbolic Density Estimators for Unnormalized Distributions."
Jane: They take samples and use a deep generative model to get good approximations of the distribution, and then they feed those results into Symbolic Regression to find the explicit symbolic expression.
Lu: They are essentially converting an unsupervised density estimation problem into a supervised symbolic regression problem by using quantities like log-likelihoods and score fields from flow-based or score-based models.
Meng: That conversion is key because it leverages information learned from the generative model, which should help constrain the search space for the symbolic expression they are looking for.
Tom: And they have a few specific strategies to make this work better: first, local factorization of the Hamiltonian to reduce dimensionality in high-dimensional settings.
Jane: Then there's incorporating task-specific inductive biases through choosing specific SR primitives and structural constraints that encode prior physical knowledge about the system.
Lu: And third, they introduce a multi-scale perturbation strategy where they add controlled noise to samples from high-density regions to improve coverage of the low-density regions, which is critical for stable symbolic estimation.
Meng: So it’s not just one trick; it’s this layered approach—generative model, SR with constraints, and noisy sampling—to tackle the difficulty of finding these exact symbolic forms.
The paper's improvements: Tom: The paper highlights three main improvements they made to get this framework working in practice.
Jane: First, they focus on local factorization of the Hamiltonian, which helps reduce the effective dimensionality when you are dealing with many-body systems and high dimensions.
Lu: That helps keep the symbolic search space manageable for scalable estimation, especially when you're looking at complex physical systems where things get very high dimensional quickly.
Meng: Then they incorporate task-specific inductive biases by choosing specific SR primitives and structural constraints that feed prior knowledge about the underlying physical system directly into the regression process.
Tom: And the third point is this multi-scale perturbation strategy, which augments samples from dense regions with controlled noise to ensure better coverage of those low-density regions, which are often where the tricky symbolic estimation happens.
Jane: That's a practical way to make sure you don't miss important parts of the distribution when you’re trying to find that true underlying equation.
Lu: They also showed this framework is complementary to existing work in symbolic regression and symbolic distillation, making it designed to work with various SR backends like genetic programming methods or neural symbolic approaches.
Meng: It's good they've shown compatibility across different SR methods, because that shows the framework isn't just tied to one specific way of doing things symbolically.
Conclusion: Tom: So we’re wrapping up on "Symbolic Density Estimators for Unnormalized Distributions." The main thing is that they successfully combine deep generative models and symbolic regression to estimate the energy function or Hamiltonian from samples using domain-specific prior knowledge.
Jane: They showed this works even in non-perturbative regimes, which means they can estimate compact symbolic approximations of effective Hamiltonians from discrete samples of locally interacting systems where exact analytical derivations are challenging.
Lu: This means AI can perform model discovery by converting an unsupervised density estimation problem into a supervised symbolic regression problem by leveraging quantities obtained from learned flow-based and score-based models, such as log-likelihoods and score fields.
Meng: And the paper shows that for long-range interaction systems, when they use PySR, they can estimate the correct symbolic structure with perfect precision and recall and no spurious terms.
Tom: It’s a powerful tool for physics and chemistry because it allows scientists to harness machine learning to analyze large datasets while simultaneously estimating interpretable symbolic equations for those locally interacting systems using domain-specific prior knowledge.
Jane: It really demonstrates the ability to estimate compact symbolic approximations of effective Hamiltonians from discrete samples of locally interacting systems in non-perturbative regimes where exact analytical derivations are challenging.
Lu: This framework opens up avenues for follow-up studies in condensed matter physics, nuclear physics, and climate sciences because it can handle complex physical modeling.
Meng: It's good to see this kind of work that moves from just generating data to actually deriving interpretable physical laws from those data points using symbolic regression.
Vikas Kanaujia, Riyansha Singh, Shashank Sharma, Vipul Arora
Department of Electrical Engineering, IIT Kanpur · Department of Computer Science and Engineering, IIT Kanpur
cs.LG, hep-lat
Submitted: 2026-10-07
Updated: 2026-10-07
Comments: 32 pages, 3 figures
Journal ref: Transactions on Machine Learning Research, issn={2835-8856},year={2026}
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 71/100
The gist: Estimating symbolic or analytical forms of probability density functions from observed samples using deep generative models and symbolic regression allows for the automated discovery of interpretable
Key concepts
- Deep Generative Models
- These are advanced machine learning models trained on data to learn the underlying structure of a distribution. They are used here to generate synthetic samples that represent the target probability density function, which helps in understanding where the data is dense and sparse.
- Symbolic Regression (SR)
- SR is a technique that automatically searches for and outputs an explicit mathematical formula, like an equation, that best describes the relationship between input variables and output values. It tries to find a simple symbolic expression from complex data using optimization techniques.
- Flow-based Models
- These models create a transformation path between a simple known distribution (like a standard Gaussian) and the target distribution being studied. They are excellent for generating samples from complex, high-dimensional distributions by applying a sequence of learnable, invertible transformations.
- Score Matching
- This involves training a deep model to predict the 'score' of the data—which relates to how likely a point is under the distribution. By minimizing the distance between predicted and true scores, it helps in accurately estimating complex probability distributions.
Summary
Estimating symbolic or analytical forms of probability density functions from observed samples using deep generative models and symbolic regression allows for the automated discovery of interpretable relationships characterizing complex physical phenomena like Hamiltonian functions. The gist Estimating the symbolic or analytical form of probability density functions from observed samples is a fundamental challenge in statistical and computational modelling>
Framework Overview
The proposed framework integrates deep generative modeling with Symbolic Regression (SR) to estimate density functions as symbolic expressions using domain-specific prior knowledge, such as the range of interactions and a predefined set of primitive functions> The framework consists of training a deep generative model using samples, fitting an SR model using likelihood information from the generative model and density factorization, and incorporating noisy perturbations for low-density regions> The central idea is to convert an unsupervised density estimation problem into a supervised symbolic regression problem by leveraging quantities obtained from learned flow-based and score-based models, such as log-likelihoods and score fields>
Generative Models
The paper examines flow-based and score-based models for density estimation, which are used to generate samples from the target distribution> Flow models apply a sequence of simple and learnable bijective transformations on samples from a known standard distribution to obtain the density of the transformed variable using Eq. (4)> Score matching involves training a deep model sθ(x) to estimate the target score s(x) by minimizing an expected square distance, J(θ), which can be simplified under certain regularity conditions> Denoising score matching addresses high-dimensional issues by perturbing x with a pre-defined noise distribution qσ(x˜x), and training is carried out across multiple noise levels to generate samples from low-density regions of p(x)>
Symbolic Regression (SR)
SR is a supervised learning approach that aims to estimate an explicit mathematical expression describing the relationship between input and output variables, seeking an optimal expression f∗ = arg min f∈F L(f) where L is a loss function like the mean squared error (MSE)> Two approaches are used: genetic programming based algorithm implemented using PySR library, which uses evolutionary algorithms to optimize a tree data structure representing a mathematical expression in terms of mean squared error, and deep neural network based equation learner (EQL) approach, which minimizes the MSE between y and yˆ> The estimated expression is related to the energy function as f(x) = Hˆ (x) + log Zˆ (5), where Hˆ(x) is obtained by dropping terms independent of x>
Key Improvements and Strategies
The framework incorporates three key components to improve symbolic estimation in practice:
-
Local factorization of the Hamiltonian, exploiting spatial locality in many-body systems to reduce the effective dimensionality of the symbolic search space and enable scalable estimation in high-dimensional settings>
-
Incorporation of task-specific inductive biases through the choice of SR primitives and structural constraints, which encode prior knowledge about the underlying physical system>
-
A multi-scale perturbation strategy that augments samples from high-density regions produced by generative models with controlled noise, thereby improving coverage of low-density regions that are critical for stable symbolic estimation>
Experimental Validation
Experiments were conducted on several benchmarks, including multivariate Gaussian and many-well distributions, as well as problems in computational physics like the XY model and scalar ϕ4 theory> The framework was applied to estimate energy functions H(x) or effective Hamiltonians arising from renormalization in non-perturbative settings where analytical derivations are challenging> Results show effectiveness for estimating the Hamiltonian of the XY model and density functions for several popular toy distributions, with MSE close to zero and R2 values near one on independent test sets> For long-range interaction systems, the framework successfully estimates the correct interaction structure when patch size is chosen to encompass the full interaction neighborhood, particularly with PySR>
Performance Metrics
The quality of symbolic estimation is assessed using several metrics:
-
Mean Squared Error (MSE) and Coefficient of Determination (R2) compare the estimated Hamiltonian Hˆ (x) with the ground-truth Hamiltonian H(x)> The MSE calculation involves mean normalization to remove additive constants>
-
Relative Coefficient Error (RCE), Precision (P), and Recall (R) quantify symbolic expression quality by measuring coefficient accuracy, fraction of true terms, and fraction of ground-truth terms estimated respectively>
-
F1 Score summarizes precision and recall through their harmonic mean>
Limitations
The scalability of the SR stage is constrained by the rapid growth of the search space with the number of variables, especially in systems with long-range interactions where larger patches are required, which increases complexity and likelihood of spurious terms> The framework relies on domain knowledge for specifying symbolic libraries and patch structures, meaning expression quality depends on these choices> Furthermore, mode-covering behavior in deep generative models can lead to biased density estimates and consequently larger coefficient errors and spurious symbolic terms in the estimated Hamiltonian>
Impact
The potential of this work extends to many areas in computational sciences, including Physics, Chemistry and Climate science by enabling scientists to harness machine learning for analyzing large datasets while simultaneously estimating interpretable symbolic equations for locally interacting systems using domain-specific prior knowledge> The paper demonstrates the ability of the proposed framework to estimate compact symbolic approximations of effective Hamiltonians from discrete samples of locally interacting systems in non-perturbative regimes> The work can be taken up for follow up studies in Condensed matter Physics, Nuclear Physics and Climate sciences>
Conclusion
The proposed framework successfully combines deep generative models and symbolic regression to estimate the energy function or Hamiltonian of a system from observed samples using domain-specific prior knowledge> It demonstrates the ability to estimate compact symbolic approximations of effective Hamiltonians from discrete samples of locally interacting systems in non-perturbative regimes where exact analytical derivations are challenging> The framework is applicable to systems with long-range interactions provided that the patch size is large enough to capture the relevant dependencies>
--- Page 17
Published in Transactions on Machine Learning Research (09/2026)
Improvements for AI systems
-
The framework can estimate
compact symbolic approximations of effective Hamiltonians from discrete samples of locally interacting systems,
which allows AI systems to derive interpretable physical laws from raw data in non-perturbative regimes where analytical derivations are challenging. -
AI can perform model discovery by converting
an unsupervised density estimation problem into a supervised symbolic regression problem by leveraging quantities obtained from learned flow-based and score-based models, such as log-likelihoods and score fields.
-
The system can handle complex physical modeling, such as estimating the energy functions of the XY model and scalar phi4 theory, even in non-perturbative settings where traditional perturbative or analytic approaches fail.
-
For long-range interactions, the framework can estimate
the correct symbolic structure with perfect precision and recall and no spurious terms
when using PySR, demonstrating its ability to identifyinterpretable long-range interaction terms from samples alone.
-
The AI system can be robust against model inaccuracies; for instance, in strong misspecification settings, it shows that
PySR substantially reduces the error relative to the underlying flow model,
suggesting that SR acts as adenoising or compression step by reducing the approximation error present in the learned generative model.
Abstract
Estimating the symbolic or analytical form of probability density functions (PDFs) from observed samples is a fundamental challenge in statistical and computational modelling. This process is critical for deriving interpretable and generalizable relationships characterizing the underlying phenomenon. Traditionally, this estimation depends strongly on domain expertise and prior field-specific knowledge, with experts selecting appropriate functional forms or parametric families based on empirical evidence and theoretical understanding. The coefficients of these forms are then typically determined through parameter estimation. In this paper, we develop a framework for estimating symbolic expressions of unnormalized distributions from observed samples using domain-specific prior knowledge, such as the range of interactions and a predefined set of primitive functions. We integrate deep generative models with symbolic regression (SR), incorporating inductive biases, such as factorizing large distributions, to keep the problem tractable. The deep generative models we examine include likelihood-based models, viz., flow models, and score-based models. Experiments show the effectiveness of the proposed framework for estimating density functions for multivariate toy distributions as well as lattices from computational physics, namely, XY model and ϕ 4 theory. When applied to the renormalization problem in ϕ 4 theory, the proposed framework estimates compact symbolic approximations of the hamiltonian function at different scales directly from samples, yielding expressions that may be challenging to derive using traditional perturbative or analytic approaches in nonperturbative settings.
Sources
- Interpretable Machine Learning for Science with PySR and SymbolicRegression.jl
- Generative Diffusion Models for Lattice Field Theory
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks