GALE: Geometric Active Learning for Search-Based Software Engineering

Abstract

Multi-objective evolutionary algorithms (MOEAs) help software engineers find novel solutions to complex problems. When automatic tools explore too many options, they are slow to use and hard to comprehend. GALE is a near-linear time MOEA that builds a piecewise approximation to the surface of best solutions along the Pareto frontier. For each piece, GALE mutates solutions towards the better end. In numerous case studies, GALE finds comparable solutions to standard methods (NSGA-II, SPEA2) using far fewer evaluations (e.g. 20 evaluations, not 1,000). GALE is recommended when a model is expensive to evaluate, or when some audience needs to browse and understand how an MOEA has made its conclusions.

DOI: 10.1109/TSE.2015.2432024

Extracted Key Phrases

18 Figures and Tables

0102020162017
Citations per Year

Citation Velocity: 8

Averaging 8 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Krall2015GALEGA, title={GALE: Geometric Active Learning for Search-Based Software Engineering}, author={Joseph Krall and Tim Menzies and Misty Davies}, journal={IEEE Transactions on Software Engineering}, year={2015}, volume={41}, pages={1001-1018} }