Oct 17, 2026J/K move · Enter open · S save
Veronica Guidetti, Luca La Rocca, Fabrício Olivetti de França, Gabriel Kronberger
Department of Physics, Informatics and Mathematics, University of Modena and Reggio Emilia, via G. Campi 213/b, Modena, 41126, Italy · Department of Education and Humanities, University of Modena and Reggio Emilia, viale Timavo 93, Reggio nell’Emilia, 42121, Italy · Center for Mathematics, Computation and Cognition (CMCC), Federal University of ABC, Avenida dos Estados, 5001, Santo Andre, 09280-560, Brazil+1
Genetic programming symbolic regression (GPSR) often returns expressions that are larger than necessary, with dormant branches and finely tuned algebraic configurations that fit sampling noise. Existing complexity-control strategies, such as multi-objective size-accuracy search or information criteria embedded in the fitness function, act on syntactic representations during model search. We introduce Fisher-Geometric pruning (FGP), a post-hoc model-reduction framework that acts on fitted models and can complement these techniques. FGP combines local information geometry at the maximum-likelihood solution with explicit compatibility tests for interpretable parametric boundaries. A taxonomy of parametric directions separates local sensitivity from proximity to reducible boundaries, enabling the treatment of unidentifiable directions and reductions through zero constraints, asymptotic limits, and signed parameter identifications. Candidate reductions are realised by symbolic contraction and refitting, then accepted only when their cross-validated predictive risk remains within a prescribed tolerance. We evaluate FGP on controlled diagnostic problems and Pareto fronts generated by GPSR. Across both settings, FGP substantially reduces structural complexity while preserving, and often improving, out-of-sample accuracy. Comparisons with competing pruning strategies and ablations show that, by combining geometric screening, boundary compatibility, and predictive validation, FGP yields the most consistent joint gains in parsimony and generalisation.