research
research copied to clipboard
Stochastic superoptimization
Basically this paper - utilize sparse sampling (probably MCMC) to search the configuration space of semantically equivalent programs, and select the fastest. Will need a lot of clever tricks to avoid getting stuck in local minima (that paper details several).
See also STOKE.