Sharpness-Aware Minimization for Evolutionary Feature Construction in Regression
Not on the map. Why?
Abstract (arXiv)
In recent years, genetic programming (GP)-based evolutionary feature construction has achieved significant success. However, a primary challenge with evolutionary feature construction is its tendency to overfit the training data, resulting in poor generalization on unseen data. In this research, we draw inspiration from PAC-Bayesian theory and propose using sharpness-aware minimization in function space to discover symbolic features that exhibit robust performance within a smooth loss landscape in the semantic space. By optimizing sharpness in conjunction with cross-validation loss, as well as designing a sharpness reduction layer, the proposed method effectively mitigates the overfitting problem of GP, especially when dealing with a limited number of instances or in the presence of label noise. Experimental results on 58 real-world regression datasets show that our approach outperforms standard GP as well as six state-of-the-art complexity measurement methods for GP in controlling overfitting. Furthermore, the ensemble version of GP with sharpness-aware minimization demonstrates superior performance compared to nine fine-tuned machine learning and symbolic regression algorithms, including XGBoost and LightGBM.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 67 references that are in the map. First posted on arXiv 11 May 2024.
Builds on
22 of 67 references.
References · 22
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2017Exploring Generalization in Deep Learningcited by 600
- 2014OpenML: networked science in machine learningcited by 526
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 311
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2021Contemporary Symbolic Regression Methods and their Relative Performancecited by 215
- 2022End-to-end symbolic regression with transformerscited by 203
- 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 172
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 146
- 2017PMLB: A Large Benchmark Suite for Machine Learning Evaluation and Comparisoncited by 140
10 more
- 2020Random Features for Kernel Approximation: A Survey on Algorithms, Theory, and Beyondcited by 109
- 2019Weight Agnostic Neural Networkscited by 71
- 2022Mitigating Memorization of Noisy Labels by Clipping the Model Predictioncited by 40
- 2018Learning concise representations for regression by evolving networks of treescited by 33
- 2021On the Generalization of Models Trained with SGD: Information-Theoretic Bounds and Implicationscited by 31
- 2020Adaptation Strategies for Automated Machine Learning on Evolving Datacited by 12
- 2022Learning Symbolic Model-Agnostic Loss Functions via Meta-Learningcited by 9
- 2022Efficient Generalization Improvement Guided by Random Weight Perturbationcited by 8
- 2017Minimum Manhattan Distance Approach to Multiple Criteria Decision Making in Multiobjective Optimization Problemscited by 5
- 2022Genetic Programming-Based Evolutionary Deep Learning for Data-Efficient Image Classificationcited by 4
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024Sharpness-Aware Minimization in Genetic Programmingcited by 2
- 2024Sharpness-Aware Minimization in Genetic Programming16 May 2024