OAK

Entropy-based evaluation relaxation strategy for Bayesian optimization algorithm

Metadata Downloads
Abstract
Bayesian Optimization Algorithm (BOA) belongs to the advanced evolutionary algorithms (EA) capable of solving problems with multivariate interactions. However, to attain wide applicability in real-world optimization, BOA needs to be coupled with various efficiency enhancement techniques. A BOA incorporated with a novel entropy-based evaluation relaxation method (eBOA) is developed in this regard. Composed of an on-demand evaluation strategy (ODES) and a sporadic evaluation method, eBOA significantly reduces the number of (fitness) evaluations without imposing any larger population-sizing requirement. Experiments adduce the grounds for its significant improvement in the number of evaluations until reliable convergence. Furthermore, the evaluation relaxation does not negatively affect the scalability performance. © 2010 Springer-Verlag.
Author(s)
Luong, Hoang NgocNguyen, Hai Thanh ThiAhn, Chang Wook
Issued Date
2010-06
Type
Conference Paper
DOI
10.1007/978-3-642-13025-0_14
URI
https://scholar.gist.ac.kr/handle/local/24950
Publisher
IEA/AIE
Citation
23rd International Conference on Industrial Engineering and Other Applications of Applied Intelligence Systems, IEA/AIE 2010, pp.126 - 135
Conference Place
SP
Appears in Collections:
Department of AI Convergence > 2. Conference Papers
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.