SymbolFit: Automatic Parametric Modeling with Symbolic Regression
Name
41781_2025_Article_140.pdf
Size
7.79 MB
Format
Adobe PDF
Checksum (MD5)
f21a23c97dd26cdfd3bcbe9d9f995419
Author(s)
Tsoi, Ho F.
Rankin, Dylan
Caillol, Cecile
Cranmer, Miles
Dasu, Sridhara
Duarte, Javier
Harris, Philip
Lipeles, Elliot
Loncar, Vladimir
Date Issued
July 1, 2025
Journal
Computing and Software for Big Science
Publisher
Springer International Publishing
Citation
Tsoi, H.F., Rankin, D., Caillol, C. et al. SymbolFit: Automatic Parametric Modeling with Symbolic Regression. Comput Softw Big Sci 9, 12 (2025).
Version
Final published version
Abstract
We introduce SymbolFit (API: https://github.com/hftsoi/symbolfit ), a framework that automates parametric modeling by using symbolic regression to perform a machine-search for functions that fit the data while simultaneously providing uncertainty estimates in a single run. Traditionally, constructing a parametric model to accurately describe binned data has been a manual and iterative process, requiring an adequate functional form to be determined before the fit can be performed. The main challenge arises when the appropriate functional forms cannot be derived from first principles, especially when there is no underlying true closed-form function for the distribution. In this work, we develop a framework that automates and streamlines the process by utilizing symbolic regression, a machine learning technique that explores a vast space of candidate functions without requiring a predefined functional form because the functional form itself is treated as a trainable parameter, making the process far more efficient and effortless than traditional regression methods. We demonstrate the framework in high-energy physics experiments at the CERN Large Hadron Collider (LHC) using five real proton-proton collision datasets from new physics searches, including background modeling in resonance searches for high-mass dijet, trijet, paired-dijet, diphoton, and dimuon events. We show that our framework can flexibly and efficiently generate a wide range of candidate functions that fit a nontrivial distribution well using a simple fit configuration that varies only by random seed, and that the same fit configuration, which defines a vast function space, can also be applied to distributions of different shapes, whereas achieving a comparable result with traditional methods would have required extensive manual effort.
MIT Department
Massachusetts Institute of Technology. Department of Physics
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s41781-025-00140-9
