In-Context Symbolic Regression for Robustness-Improved Kolmogorov-Arnold Networks
Francesco Sovrano, Lidia Losavio, Giulia Vilone, Marc Langheinrich

TL;DR
This paper introduces in-context symbolic regression methods for Kolmogorov-Arnold Networks to improve robustness and accuracy in extracting symbolic formulas, outperforming traditional approaches.
Contribution
It presents two novel in-context symbolic regression techniques, GSR and GMP, that enhance robustness and accuracy in symbolic extraction from KANs.
Findings
GSR achieves up to 99.8% reduction in median OFAT test MSE.
Methods improve robustness and consistency of symbolic formulas.
Experimental results demonstrate superior performance over standard approaches.
Abstract
Symbolic regression aims to replace black-box predictors with concise analytical expressions that can be inspected and validated in scientific machine learning. Kolmogorov-Arnold Networks (KANs) are well suited to this goal because each connection between adjacent units (an "edge") is parametrised by a learnable univariate function that can, in principle, be replaced by a symbolic operator. In practice, however, symbolic extraction is a bottleneck: the standard KAN-to-symbol approach fits operators to each learned edge function in isolation, making the discrete choice sensitive to initialisation and non-convex parameter fitting, and ignoring how local substitutions interact through the full network. We study in-context symbolic regression for operator extraction in KANs, and present two complementary instantiations. Greedy in-context Symbolic Regression (GSR) performs greedy, in-context…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
