Abstract

The search process is critical for iterative compilation because the large size of the search space and the cost of evaluating the candidate implementations make it infeasible to find the true optimal value of the optimization parameter by brute force. Considering it as a nonlinear global optimization problem, this paper introduces a new hybrid algorithm – UMDA/S: Univariate Marginal Distribution Algorithm with Nelder-Mead Simplex Search, which utilizes the optimization space structure and parameter dependency to find the near optimal parameter. Elitist preservation, weighted estimation and mutation are proposed to improve the performance of UMDA/S. Experimental results show the ability of UMDA/S to locate more excellent parameters, as compared to existing static methods and search algorithms.

Keywords

MSC

68N20, 68T05, 62H10

Cite this article

@article{cai-19122,
  author  = {Pingjing Lu and Yonggang Che and Zhenghua Wang},
  title   = {UMDA/S: An Effective Iterative Compilation Algorithm for Parameter Search},
  journal = {Computing and Informatics},
  volume  = {29},
  number  = {6+},
  pages   = {1159--1179},
  year    = {2010},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2010/6%2B/umda-s-an-effective-iterative-compilation-algorithm-for-parameter-search/}
}
Download .bib