Kumara Sastry » Conference Proceedings

Real-coded ECGA for solving decomposable real-valued optimization problems

Kumara Sastry — Sun, 06 Apr 2008 04:33:28 +0000

Li, M., Goldberg, D. E., Sastry, K., Yu, T.-L. (2007). Proceedings of the 2007 IEEE Congress on Evolutionary Computation (CEC 2007). 2194–2201. [Full Paper].

Abstract:
This paper presents the real-coded extended compact genetic algorithms (rECGA) for decomposable real-valued optimization problems. Mutual information among real-valued variables is employed to measure variables interaction or dependency, and the variables clustering and aggregation algorithms are proposed to identify the substructures of a problem through partitioning variables. Then, mixture Gaussian probability density function is estimated to model the promising individuals for each substructure, and the sampling of multivariate Gaussian probability density function is done by adopting Cholesky decomposition. Finally, experiments on decomposable test functions are conducted. The results show that the rECGA is able to correctly identify the substructure of decomposable problems with linear or nonlinear correlations, and achieves a good scalability.

Influence of selection and replacement strategies on linkage learning in BOA

Kumara Sastry — Sun, 06 Apr 2008 04:28:54 +0000

Lima, C. F., Pelikan, M., Goldberg, D. E., Lobo, F. G., Sastry, K., Hauschild, M. (2007). Proceedings of the 2007 IEEE Congress on Evolutionary Computation (CEC 2007). 1083–1090. [Full Paper].

Abstract:
The Bayesian optimization algorithm (BOA) uses Bayesian networks to learn linkages between the decision variables of an optimization problem. This paper studies the influence of different selection and replacement methods on the accuracy of linkage learning in BOA. Results on concatenated m-k deceptive trap functions show that the model accuracy depends on a large extent on the choice of selection method and to a lesser extent on the replacement strategy used. Specifically, it is shown that linkage learning in BOA is more accurate with truncation selection than with tournament selection. The choice of replacement strategy is important when tournament selection is used, but it is not relevant when using truncation selection. On the other hand, if performance is our main concern, tournament selection and restricted tournament replacement should be preferred. These results aim to provide practitioners with useful information about the best way to tune BOA with respect to structural model accuracy and overall performance.

A simple real-coded extended compact genetic algorithm

Kumara Sastry — Sun, 06 Apr 2008 04:24:33 +0000

Fossati, L., Lanzi, P. L., Sastry, K., Goldberg, D. E., Gomez, O. (2007). Proceedings of the 2007 IEEE Congress on Evolutionary Computation (CEC 2007). 342–348. [Full Paper].

Abstract:
This paper presents a simple real-coded estimation of distribution algorithm (EDA) design using ?-ary extended compact genetic algorithm (?ECGA) and discretization methods. Specifically, the real-valued decision variables are mapped to discrete symbols of user-specified cardinality using discretization methods. The ?ECGA is then used to build the probabilistic model and to sample a new population based on the probabilistic model. The effect of alphabet cardinality and the selection pressure on the scalability of the real-coded ECGA (rECGA) method is investigated. The results show that the population size required by rECGA—to successfully solve a class of additivelyseparable problems—scales sub-quadratically with problem size and the number of function evaluations scales sub-cubically with problem size. The proposed rECGA is simple, making it amenable for further empirical and theoretical analysis. Moreover, the probabilistic models built in the proposed realcoded ECGA are readily interpretable and can be easily visualized. The proposed algorithm and the results presented in this paper are first step towards conducting a systematic analysis of real-coded EDAs and towards developing a design theory for development of scalable and robust real-coded EDAs.

Discovering building blocks for human based genetic algorithms

Kumara Sastry — Sun, 06 Apr 2008 04:01:19 +0000

Ueda, T., Yasui, N. I., Llorà, X., Sastry, K. Goldberg, D. E. (2008). Smart Systems Engineering: Computational Intelligence in Architecting Complex Engineering Systems (ANNIE 2007). [First Runner Up, Theoretical Developments in Computational Intelligence] [Preprint: IlliGAL Report No. 2007020].

Abstract:
The push for rapid innovation and creativity in this Internet age places a premium on eective integration of both human and computer-generated knowledge. One of the key components of a distributed and scalable environment for accomplishing this integration called DISCUS is the human-based genetic algorithm (HBGA)–a GA where humans perform genetic operations. This paper takes the first step towards designing a competent HBGA, which can enable humans to innovate quickly, reliably, and accurately. Specifically, this paper proposes a methodology for discovering building blocks from text documents including reports, chat, transcripts and e-mail. The proposed method has been applied to simple test problems and to a news article set. The results show that the proposed BB-identification methodology is eective and enables humans to eectively exchange the BBs for rapid innovation.

Towards billion bit optimization via parallel estimation of distribution algorithm

Kumara Sastry — Sat, 14 Jul 2007 14:49:00 +0000

Sastry, K., Goldberg, D. E., Llorà, X. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 577–584. [Best paper in Estimation of Distribution Algorithms track] [Preprint: IlliGAL report no. 2007007] [Full paper - DOI] [Presentation Slides].

Empirical Analysis of ideal recombination on random decomposable problems

Kumara Sastry — Sat, 14 Jul 2007 14:36:06 +0000

Sastry, K., Pelikan, M., Goldberg, D. E. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 1388–1395. [Nominated for best paper in Genetic Algorithms track] [Preprint: IlliGAL report no. 2006016] [Full paper - DOI] [Presentation slides].

Automated alphabet reduction method with evolutionary algorithms for protein structure prediction

Kumara Sastry — Sat, 14 Jul 2007 14:24:26 +0000

Bacardit, J., Stout, M., Hirst, J. D., Sastry, K., Llorà, X., Krasnogor, N. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 346–353. [Bronze ``Humies'' award at the Human Competitive Results Competition] [Preprint: IlliGAL report no. 2007015] [Full paper - DOI].

Population sizing for entropy-based model building in genetic algorithms

Kumara Sastry — Sat, 14 Jul 2007 14:15:10 +0000

Yu, T.-L., Sastry, K., Goldberg, D. E., Pelikan, M. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 601–608. [Nominated for the best paper award in Estimation of Distribution Algorithms track] [Preprint: IlliGAL report no. 2006020] [Full paper - DOI] [Presentation slides].

Let’s get ready to rumble redux: Crossover versus mutation head to head on exponentially scaled problems

Kumara Sastry — Sat, 14 Jul 2007 03:06:50 +0000

Sastry, K., Goldberg, D. E. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 1380–1387. [Preprint: IlliGAL report no. 2007005] [Full paper - DOI] [Presentation slides].

Modeling selection pressure in XCS for proportionate and tournament selection

Kumara Sastry — Sat, 14 Jul 2007 02:15:34 +0000

Orriols-Puig, A., Sastry, K., Lanzi, P. L., Goldberg, D. E., Bernadó-Mansilla, E. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 1846–1853. [Preprint: IlliGAL report no. 2007004] [Full paper - DOI] [Presentation slides].