Shape-constrained Symbolic Regression -- Improving Extrapolation with Prior Knowledge
Gabriel Kronberger, Fabricio Olivetti de Fran\c{c}a, Bogdan, Burlacu, Christian Haider, Michael Kommenda

TL;DR
This paper introduces shape-constrained symbolic regression that incorporates prior knowledge through constraints on functions and derivatives, improving extrapolation but with some trade-offs in accuracy and model size.
Contribution
It proposes two evolutionary algorithms for shape-constrained symbolic regression and demonstrates their ability to enforce prior knowledge constraints.
Findings
Models conform to shape constraints, unlike unconstrained methods.
Constrained models have worse predictive accuracy on training and test sets.
Shape-constrained polynomial regression yields the best test performance but larger models.
Abstract
We investigate the addition of constraints on the function image and its derivatives for the incorporation of prior knowledge in symbolic regression. The approach is called shape-constrained symbolic regression and allows us to enforce e.g. monotonicity of the function over selected inputs. The aim is to find models which conform to expected behaviour and which have improved extrapolation capabilities. We demonstrate the feasibility of the idea and propose and compare two evolutionary algorithms for shape-constrained symbolic regression: i) an extension of tree-based genetic programming which discards infeasible solutions in the selection step, and ii) a two population evolutionary algorithm that separates the feasible from the infeasible solutions. In both algorithms we use interval arithmetic to approximate bounds for models and their partial derivatives. The algorithms are tested on…
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.
