REVIEW 1 cited by
Generalization Ability of Feature-based Performance Prediction Models: A Statistical Analysis across Benchmarks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This study examines the generalization ability of algorithm performance prediction models across various benchmark suites. Comparing the statistical similarity between the problem collections with the accuracy of performance prediction models that are based on exploratory landscape analysis features, we observe that there is a positive correlation between these two measures. Specifically, when the high-dimensional feature value distributions between training and testing suites lack statistical significance, the model tends to generalize well, in the sense that the testing errors are in the same range as the training errors. Two experiments validate these findings: one involving the standard benchmark suites, the BBOB and CEC collections, and another using five collections of affine combinations of BBOB problem instances.
Forward citations
Cited by 1 Pith paper
-
Revisiting Generalization Power of a DNN in Terms of Symbolic Interactions
Neural network interactions that generalize follow a decay-shaped distribution over complexity, while non-generalizing interactions follow a spindle-shaped distribution, which a four-parameter fit can separate.
Discussion (0). Continue with ORCID to comment.