Sporadic Model Building for Efficiency Enhancement of hBOA

•

0 likes•402 views

This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other estimation of distribution algorithms (EDAs). With sporadic model building, the structure of the probabilistic model is updated once every few iterations (generations), whereas in the remaining iterations only model parameters (conditional and marginal probabilities) are updated. Since the time complexity of updating model parameters is much lower than the time complexity of learning the model structure, sporadic model building decreases the overall time complexity of model building. The paper shows that for boundedly difficult nearly decomposable and hierarchical optimization problems, sporadic model building leads to a significant model-building speedup that decreases the asymptotic time complexity of model building in hBOA by a factor of Θ(n0.26) to Θ(n0.65), where n is the problem size. On the other hand, sporadic model building also increases the number of evaluations until convergence; nonetheless, for decomposable problems, the evaluation slowdown is insignificant compared to the gains in the asymptotic complexity of model building.

Economy & Finance Technology

Sporadic Model Building for Efficiency Enhancement of hBOA

La película muestra los muchos problemas que enfrentan las mujeres de color en su vida cotidiana, incluyendo embarazos no deseados, violencia doméstica y falta de respeto. Relata la historia de una mujer que no le importaba quedar embarazada a pesar de tener relaciones sexuales sin protección, y de una joven que terminó embarazada luego de ceder a la presión de sus amigas para acostarse con alguien en una fiesta. También describe a mujeres que son víctimas de violación y maltrato debido a la ausencia

Invitación red asesores

Otreblig Fernande

Este documento proporciona información sobre la Red de Asesores del Centro de Desarrollo Educativo de Guanajuato para el ciclo escolar 2013-2014. Detalla las fechas de capacitación para docentes que quieran unirse o continuar formando parte de la red, así como el calendario de inscripción y desarrollo de los tres periodos de trayectos formativos. Finalmente, incluye datos de contacto para aclarar dudas.

Movimientos Articulares

engelbert

Limits of scalability of multiobjective estimation of distribution algorithms

kknsastry

The paper analyzes the scalability of multiobjective estimation of distribution algorithms (MOEDAs) on a class of boundedly-difficult additively-separable multiobjective optimization problems. The paper illustrates that even if the linkage is correctly identified, massive multimodality of the search problems can easily overwhelm the nicher and lead to exponential scale-up. Facetwise models are subsequently used to propose a growth rate of the number of differing substructures between the two objectives to avoid the niching method from being overwhelmed and lead to polynomial scalability of MOEDAs.

Evidencia2.docx

loquita24

Este documento presenta breves biografías de varios blogueros y personalidades de Internet. Incluye información sobre Nir Ofer, cofundador de blogTV.com; Jessica Claire, una diseñadora que usa blogs para mostrar su trabajo; Michelle Malkin, quien lanzó un blog político conservador popular; y David Bravo, un abogado que ha representado a varias páginas de enlaces P2P. También presenta detalles sobre Perez Hilton, un bloguero famoso reconocido por hablar sin tapujos de los famosos, y sobre Evan Williams y B

Museo de Louvre

Sebastian Lagos

Una propuesta de análisis sintáctico-semántico para los nodos iniciales en ci...

Filipa Jorge

Este documento propone un análisis sintáctico-semántico de los nodos iniciales en cibermedios. Los objetivos son analizar el uso de tipografía, color, organización de elementos y presentación de contenido en cibermedios españoles y otros, así como estudiar la evolución del hipertexto y la arquitectura de información. Se propone un estudio empírico comparativo intercultural y se concluyen hallazgos como el predominio del texto sobre gráficos y la concepción del nodo inicial como exponente de la oferta de

KGC2014 "당신의 인디게임은 실패했습니다" -장재곤-

gon

Queries for gifts and occasions grew 54.9% in Q3 2015 compared to the previous year. Mobile search queries increased the most at 125.8% while desktop grew 11% and tablet 48.2%. The majority of searches are now on mobile devices which accounted for 61% of queries. Advertising metrics such as impressions declined 10.8%, clicks rose 16.9% but average cost per click decreased 23.8% for this category in Q3 2015 versus the same period in 2014.

NOSSA CANÇÃO

Diaconisa Cris Silva

Project Management for Technical Communication Professionals

stcindiana

Semiótica del dïa despues

javierzglisser

La foto de portada de Tania embarazada sosteniendo una muñeca no es una simple foto periodística, sino que fue cuidadosamente construida y editada para comunicar un mensaje específico. Varios elementos como la ropa, maquillaje, y fondo fueron añadidos o modificados digitalmente para convertir a Tania en un "símbolo" que personaliza el problema del embarazo adolescente y genera conciencia sobre este tema. El análisis revela que la foto trata de pasar como una imagen periodística pero en realidad

[OpenStack 스터디] OpenStack With Contrail

OpenStack Korea Community

Soldadura laser final

David Rodriguez-Barba

La soldadura por rayo láser es un proceso que utiliza la energía concentrada de un haz láser para fundir y recristalizar los materiales a unir. Existen diferentes tipos de láser como de CO2, de diodo y de cuerpo sólido que se usan en la soldadura dependiendo de la aplicación. La soldadura láser ofrece ventajas como baja deformación, alta velocidad y precisión. Se aplica comúnmente en la industria automotriz, aeronáutica y ferrocarril para soldar metales como acero, aluminio y

Con té partiró

Partitura de Banda

Rajmanglam.com indian-rail-fare-effective-1-june-2015

Sreemanta Kumar Ray

Genetic Algorithms and Genetic Programming for Multiscale Modeling

kknsastry

Effective and efficient multiscale modeling is essential to advance both the science and synthesis in a wide array of fields such as physics, chemistry, materials science, biology, biotechnology and pharmacology. This study investigates the efficacy and potential of using genetic algorithms for multiscale materials modeling and addresses some of the challenges involved in designing competent algorithms that solve hard problems quickly, reliably and accurately.

Towards billion bit optimization via parallel estimation of distribution algo...

kknsastry

The document describes research into using efficient estimation of distribution algorithms (EDAs) like the compact genetic algorithm (cGA) to solve optimization problems involving billions of variables. Key aspects discussed include the cGA's memory and computational efficiency through techniques like parallelization and vectorization. The researchers were able to solve a noisy OneMax problem involving over 33 million variables to optimality and a problem with 1.1 billion variables with relaxed convergence. The document argues this research is important because many real-world problems involving nanotechnology, biology, and information systems require solving optimization problems at massive scales.

Empirical Analysis of ideal recombination on random decomposable problems

kknsastry

This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifically, additively decomposable problems of order k whose subsolution fitnesses are sampled from the standard uniform distribution U[0,1] are analyzed. The scalability of the selectorecombinative GA is investigated for 10,000 rADP instances. The validity of facetwise models in bounding the population size, run duration, and the number of function evaluations required to successfully solve the problems is also verified. Finally, rADP instances that are easiest and most difficult are also investigated.

Population sizing for entropy-based model buliding In genetic algorithms

kknsastry

This paper presents a population-sizing model for the entropy-based model building in genetic algorithms. Specifically, the population size required for building an accurate model is investigated. The effect of the selection pressure on population sizing is also incorporated. The proposed model indicates that the population size required for building an accurate model scales as Θ(m log m), where m is the number of substructures and proportional to the problem size. Experiments are conducted to verify the derivations, and the results agree with the proposed model.

Let's get ready to rumble redux: Crossover versus mutation head to head on ex...

kknsastry

This paper analyzes the relative advantages between crossover and mutation on a class of deterministic and stochastic additively separable problems with substructures of non-uniform salience. This study assumes that the recombination and mutation operators have the knowledge of the building blocks (BBs) and effectively exchange or search among competing BBs. Facetwise models of convergence time and population sizing have been used to determine the scalability of each algorithm. The analysis shows that for deterministic exponentially-scaled additively separable, problems, the BB-wise mutation is more efficient than crossover yielding a speedup of Θ(l logl), where l is the problem size. For the noisy exponentially-scaled problems, the outcome depends on whether scaling on noise is dominant. When scaling dominates, mutation is more efficient than crossover yielding a speedup of Θ(l logl). On the other hand, when noise dominates, crossover is more efficient than mutation yielding a speedup of Θ(l).

Modeling selection pressure in XCS for proportionate and tournament selection

kknsastry

In this paper, we derive models of the selection pressure in XCS for proportionate (roulette wheel) selection and tournament selection. We show that these models can explain the empirical results that have been previously presented in the literature. We validate the models on simple problems showing that, (i) when the model assumptions hold, the theory perfectly matches the empirical evidence; (ii) when the model assumptions do not hold, the theory can still provide qualitative explanations of the experimental results.

Modeling XCS in class imbalances: Population sizing and parameter settings

kknsastry

This paper analyzes the scalability of the population size required in XCS to maintain niches that are infrequently activated. Facetwise models have been developed to predict the effect of the imbalance ratio—ratio between the number of instances of the majority class and the minority class that are sampled to XCS—on population initialization, and on the creation and deletion of classifiers of the minority class. While theoretical models show that, ideally, XCS scales linearly with the imbalance ratio, XCS with standard configuration scales exponentially. The causes that are potentially responsible for this deviation from the ideal scalability are also investigated. Specifically, the inheritance procedure of classifiers’ parameters, mutation, and subsumption are analyzed, and improvements in XCS’s mechanisms are proposed to effectively and efficiently handle imbalanced problems. Once the recommendations are incorporated to XCS, empirical results show that the population size in XCS indeed scales linearly with the imbalance ratio.

Substructrual surrogates for learning decomposable classification problems: i...

kknsastry

This paper presents a learning methodology based on a substructural classification model to solve decomposable classification problems. The proposed method consists of three important components: (1) a structural model that represents salient interactions between attributes for a given data, (2) a surrogate model which provides a functional approximation of the output as a function of attributes, and (3) a classification model which predicts the class for new inputs. The structural model is used to infer the functional form of the surrogate and its coefficients are estimated using linear regression methods. The classification model uses a maximally-accurate, least-complex surrogate to predict the output for given inputs. The structural model that yields an optimal classification model is searched using an iterative greedy search heuristic. Results show that the proposed method successfully detects the interacting variables in hierarchical problems, group them in linkages groups, and build maximally accurate classification models. The initial results on non-trivial hierarchical test problems indicate that the proposed method holds promise and have also shed light on several improvements to enhance the capabilities of the proposed method.

Let's get ready to rumble redux: Crossover versus mutation head to head on ex...

kknsastry

This paper analyzes the relative advantages between crossover and mutation on a class of deterministic and stochastic additively separable problems with substructures of non-uniform salience. This study assumes that the recombination and mutation operators have the knowledge of the building blocks (BBs) and effectively exchange or search among competing BBs. Facetwise models of convergence time and population sizing have been used to determine the scalability of each algorithm. The analysis shows that for deterministic exponentially-scaled additively separable, problems, the BB-wise mutation is more efficient than crossover yielding a speedup of Θ(l logl), where l is the problem size. For the noisy exponentially-scaled problems, the outcome depends on whether scaling on noise is dominant. When scaling dominates, mutation is more efficient than crossover yielding a speedup of Θ(l logl). On the other hand, when noise dominates, crossover is more efficient than mutation yielding a speedup of Θ(l).

Automated alphabet reduction with evolutionary algorithms for protein structu...

kknsastry

This paper focuses on automated procedures to reduce the dimensionality of protein structure prediction datasets by simplifying the way in which the primary sequence of a protein is represented. The potential benefits of this procedure are faster and easier learning process as well as the generation of more compact and human-readable classifiers. The dimensionality reduction procedure we propose consists on the reduction of the 20-letter amino acid (AA) alphabet, which is normally used to specify a protein sequence, into a lower cardinality alphabet. This reduction comes about by a clustering of AA types accordingly to their physical and chemical similarity. Our automated reduction procedure is guided by a fitness function based on the Mutual Information between the AA-based input attributes of the dataset and the protein structure feature that being predicted. To search for the optimal reduction, the Extended Compact Genetic Algorithm (ECGA) was used, and afterwards the results of this process were fed into (and validated by) BioHEL, a genetics-based machine learning technique. BioHEL used the reduced alphabet to induce rules for protein structure prediction features. BioHEL results are compared to two standard machine learning systems. Our results show that it is possible to reduce the size of the alphabet used for prediction from twenty to just three letters resulting in more compact, i.e. interpretable, rules. Also, a protein-wise accuracy performance measure suggests that the loss of accuracy accrued by this substantial alphabet reduction is not statistically significant when compared to the full alphabet.

Analyzing probabilistic models in hierarchical BOA on traps and spin glasses

kknsastry

The hierarchical Bayesian optimization algorithm (hBOA) can solve nearly decomposable and hierarchical problems of bounded difficulty in a robust and scalable manner by building and sampling probabilistic models of promising solutions. This paper analyzes probabilistic models in hBOA on two common test problems: concatenated traps and 2D Ising spin glasses with periodic boundary conditions. We argue that although Bayesian networks with local structures can encode complex probability distributions, analyzing these models in hBOA is relatively straightforward and the results of such analyses may provide practitioners with useful information about their problems. The results show that the probabilistic models in hBOA closely correspond to the structure of the underlying optimization problem, the models do not change significantly in subsequent iterations of BOA, and creating adequate probabilistic models by hand is not straightforward even with complete knowledge of the optimization problem.

Modeling selection pressure in XCS for proportionate and tournament selection

kknsastry

Viewers also liked

Kirurgia plastikoa

xabito

eeuwig levengoedbericht

Occasions & gifts

Asphri457

NOSSA CANÇÃO

Diaconisa Cris Silva

Project Management for Technical Communication Professionals

stcindiana

Semiótica del dïa despues

javierzglisser

[OpenStack 스터디] OpenStack With Contrail

OpenStack Korea Community

Soldadura laser final

David Rodriguez-Barba

Con té partiró

Partitura de Banda

Rajmanglam.com indian-rail-fare-effective-1-june-2015

Sreemanta Kumar Ray

Viewers also liked (10)

Kirurgia plastikoa

eeuwig leven

Occasions & gifts

NOSSA CANÇÃO

Project Management for Technical Communication Professionals

Semiótica del dïa despues

[OpenStack 스터디] OpenStack With Contrail

Soldadura laser final

Con té partiró

Rajmanglam.com indian-rail-fare-effective-1-june-2015

More from kknsastry

Genetic Algorithms and Genetic Programming for Multiscale Modeling

kknsastry

Towards billion bit optimization via parallel estimation of distribution algo...

kknsastry

Empirical Analysis of ideal recombination on random decomposable problems

kknsastry

Population sizing for entropy-based model buliding In genetic algorithms

kknsastry

Let's get ready to rumble redux: Crossover versus mutation head to head on ex...

kknsastry

Modeling selection pressure in XCS for proportionate and tournament selection

kknsastry

Modeling XCS in class imbalances: Population sizing and parameter settings

kknsastry

Substructrual surrogates for learning decomposable classification problems: i...

kknsastry

Let's get ready to rumble redux: Crossover versus mutation head to head on ex...

kknsastry

This paper analyzes the relative advantages between crossover and mutation on a class of deterministic and stochastic additively separable problems with substructures of non-uniform salience. This study assumes that the recombination and mutation operators have the knowledge of the building blocks (BBs) and effectively exchange or search among competing BBs. Facetwise models of convergence time and population sizing have been used to determine the scalability of each algorithm. The analysis shows that for deterministic exponentially-scaled additively separable, problems, the BB-wise mutation is more efficient than crossover yielding a speedup of Θ(l logl), where l is the problem size. For the noisy exponentially-scaled problems, the outcome depends on whether scaling on noise is dominant. When scaling dominates, mutation is more efficient than crossover yielding a speedup of Θ(l logl). On the other hand, when noise dominates, crossover is more efficient than mutation yielding a speedup of Θ(l).

Automated alphabet reduction with evolutionary algorithms for protein structu...

kknsastry

Analyzing probabilistic models in hierarchical BOA on traps and spin glasses

kknsastry

Modeling selection pressure in XCS for proportionate and tournament selection

kknsastry

Modeling XCS in class imbalances: Population size and parameter settings

kknsastry

Fast and accurate reaction dynamics via multiobjective genetic algorithm opti...

kknsastry

The document describes research into using multiobjective genetic algorithms to optimize semiempirical potentials for fast and accurate reaction dynamics simulations. The researchers developed a method to tune semiempirical parameters using a limited set of ab initio calculations to better describe excited state potential energy surfaces. They found that multiobjective optimization was able to find globally accurate potential energy surfaces more efficiently than weighted single-objective optimizations. Analysis of the optimized parameter sets showed they produced stable and physically reasonable results.

On Extended Compact Genetic Algorithm

kknsastry

In this study we present a detailed analysis of the extended compact genetic algorithm (ECGA). Based on the analysis, empirical relations for population sizing and convergence time have been derived and are compared with the existing relations. We then apply ECGA to a non-azeotropic binary working fluid power cycle optimization problem. The optimal power cycle obtained improved the cycle efficiency by 2.5% over that existing cycles, thus illustrating the capabilities of ECGA in solving real-world problems.

Silicon Cluster Optimization Using Extended Compact Genetic Algorithm

kknsastry

This paper presents an efficient cluster optimization algorithm. The proposed algorithm uses extended compact genetic algorithm (ECGA), one of the competent genetic algorithms (GAs) coupled with Nelder-Mead simplex local search. The lowest energy structures of silicon clusters with 4-11 atoms have been successfully predicted. The minimum population size and total number of function (potential energy of the cluster) evaluations required to converge to the global optimum with a reliability of 96% have been empirically determined and are O(n4.2) and O(n8.2) respectively. The results obtained indicate that the proposed algorithm is highly reliable in predicting globally optimal structures. However, certain efficiency techniques have to be employed for predicting structures of larger clusters to reduce the high computational cost due to function evaluation.

A Practical Schema Theorem for Genetic Algorithm Design and Tuning

kknsastry

The document discusses the results of a study on the effects of a new drug on memory and cognitive function in older adults. The double-blind study involved 100 participants aged 65-80 who were given either the drug or a placebo daily for 6 months. Researchers found that those who received the drug performed significantly better on memory and problem-solving tests at the end of the study compared to those who received the placebo.

On the Supply of Building Blocks

kknsastry

Don't Evaluate, Inherit

kknsastry

This paper studies fitness inheritance as an efficiency enhancement technique for genetic and evolutionary algorithms. Convergence and population-sizing models are derived and compared with experimental results. These models are optimized for greatest speed-up and the optimal inheritance proportion to obtain such a speed-up is derived. Results on OneMax problems show that when the inheritance effects are considered in the population-sizing model, the number of function evaluations are reduced by 20% with the use of fitness inheritance. Results indicate that for a fixed population size, the number of function evaluations can be reduced by 70% using a simple fitness inheritance technique.

Efficient Cluster Optimization Using A Hybrid Extended Compact Genetic Algori...

kknsastry

More from kknsastry (20)