Limits of scalability of multiobjective estimation of distribution algorithms
•
1 like•427 views
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.
Report
Share
Report
Share
Recommended
Sporadic Model Building for Efficiency Enhancement of hBOA
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.
Evidencia2.docx
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
El Louvre es un museo y palacio ubicado en París, Francia. Es uno de los museos de arte más grandes e importantes del mundo, albergando una colección de más de 380,000 objetos que abarcan un amplio rango de culturas y períodos históricos, desde la Antigüedad hasta el siglo XIX. El edificio original del Louvre sirvió como un palacio real antes de convertirse en un museo público en 1793.
Invitación red asesores
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.
Reflexión de la película mujeres de color
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
Una propuesta de análisis sintáctico-semántico para los nodos iniciales en ci...
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
Recommended
Sporadic Model Building for Efficiency Enhancement of hBOA
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.
Evidencia2.docx
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
El Louvre es un museo y palacio ubicado en París, Francia. Es uno de los museos de arte más grandes e importantes del mundo, albergando una colección de más de 380,000 objetos que abarcan un amplio rango de culturas y períodos históricos, desde la Antigüedad hasta el siglo XIX. El edificio original del Louvre sirvió como un palacio real antes de convertirse en un museo público en 1793.
Invitación red asesores
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.
Reflexión de la película mujeres de color
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
Una propuesta de análisis sintáctico-semántico para los nodos iniciales en ci...
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
Occasions & gifts
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
O documento é uma canção religiosa que expressa o desejo de encontrar um lar e ouvir a voz de Deus ecoando em seus corações. Os cantores se veem como estrangeiros procurando abrigo e pedem a Deus que faça Seu trono em suas canções e lance ao pó sua glória.
Project Management for Technical Communication Professionals
Presentation to the members of the Indiana Chapter of the Society for Technical Communication, December 18, 2006. Delivered by Greg McCormick on the Project Management Institute methodology and how it can help technical communication professionals better plan and manage their technical documentation projects.
Semiótica del dïa despues
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
Contrail provides software defined networking and virtual network capabilities for OpenStack clouds. Key components of Contrail include the Contrail controller, vRouters running on hypervisors, and integration with OpenStack using Neutron and Nova. Virtual networks in Contrail can be created which provide isolation between groups of virtual machines and connectivity to physical networks.
Soldadura laser final
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
Genetic Algorithms and Genetic Programming for Multiscale Modeling
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...
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
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
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...
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
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
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...
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...
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 Θ(<em>l</em> log<em>l</em>), where <em>l</em> 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 Θ(<em>l</em> log<em>l</em>). On the other hand, when noise dominates, crossover is more efficient than mutation yielding a speedup of Θ(<em>l</em>).
Automated alphabet reduction with evolutionary algorithms for protein structu...
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. <br />
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
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
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.
More Related Content
Viewers also liked
Occasions & gifts
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
O documento é uma canção religiosa que expressa o desejo de encontrar um lar e ouvir a voz de Deus ecoando em seus corações. Os cantores se veem como estrangeiros procurando abrigo e pedem a Deus que faça Seu trono em suas canções e lance ao pó sua glória.
Project Management for Technical Communication Professionals
Presentation to the members of the Indiana Chapter of the Society for Technical Communication, December 18, 2006. Delivered by Greg McCormick on the Project Management Institute methodology and how it can help technical communication professionals better plan and manage their technical documentation projects.
Semiótica del dïa despues
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
Contrail provides software defined networking and virtual network capabilities for OpenStack clouds. Key components of Contrail include the Contrail controller, vRouters running on hypervisors, and integration with OpenStack using Neutron and Nova. Virtual networks in Contrail can be created which provide isolation between groups of virtual machines and connectivity to physical networks.
Soldadura laser final
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
Viewers also liked (10)
Project Management for Technical Communication Professionals
Project Management for Technical Communication Professionals
Rajmanglam.com indian-rail-fare-effective-1-june-2015
Rajmanglam.com indian-rail-fare-effective-1-june-2015
More from kknsastry
Genetic Algorithms and Genetic Programming for Multiscale Modeling
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...
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
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
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...
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
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
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...
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...
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 Θ(<em>l</em> log<em>l</em>), where <em>l</em> 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 Θ(<em>l</em> log<em>l</em>). On the other hand, when noise dominates, crossover is more efficient than mutation yielding a speedup of Θ(<em>l</em>).
Automated alphabet reduction with evolutionary algorithms for protein structu...
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. <br />
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
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
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 size and parameter settings
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.
Fast and accurate reaction dynamics via multiobjective genetic algorithm opti...
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
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
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
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
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive functioning. Exercise causes chemical changes in the brain that may help boost feelings of calmness, happiness and focus.
Don't Evaluate, Inherit
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...
The document discusses the benefits of meditation for reducing stress and anxiety. Regular meditation practice can help calm the mind and body by lowering heart rate and blood pressure. Studies have shown that meditating for just 10-20 minutes per day can have significant positive impacts on both mental and physical health over time.
More from kknsastry (20)
Genetic Algorithms and Genetic Programming for Multiscale Modeling
Genetic Algorithms and Genetic Programming for Multiscale Modeling
Towards billion bit optimization via parallel estimation of distribution algo...
Towards billion bit optimization via parallel estimation of distribution algo...
Empirical Analysis of ideal recombination on random decomposable problems
Empirical Analysis of ideal recombination on random decomposable problems
Population sizing for entropy-based model buliding In genetic algorithms
Population sizing for entropy-based model buliding In genetic algorithms
Let's get ready to rumble redux: Crossover versus mutation head to head on ex...
Let's get ready to rumble redux: Crossover versus mutation head to head on ex...
Modeling selection pressure in XCS for proportionate and tournament selection
Modeling selection pressure in XCS for proportionate and tournament selection
Modeling XCS in class imbalances: Population sizing and parameter settings
Modeling XCS in class imbalances: Population sizing and parameter settings
Substructrual surrogates for learning decomposable classification problems: i...
Substructrual surrogates for learning decomposable classification problems: i...
Let's get ready to rumble redux: Crossover versus mutation head to head on ex...
Let's get ready to rumble redux: Crossover versus mutation head to head on ex...
Automated alphabet reduction with evolutionary algorithms for protein structu...
Automated alphabet reduction with evolutionary algorithms for protein structu...
Analyzing probabilistic models in hierarchical BOA on traps and spin glasses
Analyzing probabilistic models in hierarchical BOA on traps and spin glasses
Modeling selection pressure in XCS for proportionate and tournament selection
Modeling selection pressure in XCS for proportionate and tournament selection
Modeling XCS in class imbalances: Population size and parameter settings
Modeling XCS in class imbalances: Population size and parameter settings
Fast and accurate reaction dynamics via multiobjective genetic algorithm opti...
Fast and accurate reaction dynamics via multiobjective genetic algorithm opti...
Silicon Cluster Optimization Using Extended Compact Genetic Algorithm
Silicon Cluster Optimization Using Extended Compact Genetic Algorithm
A Practical Schema Theorem for Genetic Algorithm Design and Tuning
A Practical Schema Theorem for Genetic Algorithm Design and Tuning
Efficient Cluster Optimization Using A Hybrid Extended Compact Genetic Algori...
Efficient Cluster Optimization Using A Hybrid Extended Compact Genetic Algori...
Recently uploaded
Pushing the limits of ePRTC: 100ns holdover for 100 days
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Full-RAG: A modern architecture for hyper-personalization
Mike Del Balso, CEO & Co-Founder at Tecton, presents "Full RAG," a novel approach to AI recommendation systems, aiming to push beyond the limitations of traditional models through a deep integration of contextual insights and real-time data, leveraging the Retrieval-Augmented Generation architecture. This talk will outline Full RAG's potential to significantly enhance personalization, address engineering challenges such as data management and model training, and introduce data enrichment with reranking as a key solution. Attendees will gain crucial insights into the importance of hyperpersonalization in AI, the capabilities of Full RAG for advanced personalization, and strategies for managing complex data integrations for deploying cutting-edge AI solutions.
A tale of scale & speed: How the US Navy is enabling software delivery from l...
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...Edge AI and Vision Alliance
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/building-and-scaling-ai-applications-with-the-nx-ai-manager-a-presentation-from-network-optix/
Robin van Emden, Senior Director of Data Science at Network Optix, presents the “Building and Scaling AI Applications with the Nx AI Manager,” tutorial at the May 2024 Embedded Vision Summit.
In this presentation, van Emden covers the basics of scaling edge AI solutions using the Nx tool kit. He emphasizes the process of developing AI models and deploying them globally. He also showcases the conversion of AI models and the creation of effective edge AI pipelines, with a focus on pre-processing, model conversion, selecting the appropriate inference engine for the target hardware and post-processing.
van Emden shows how Nx can simplify the developer’s life and facilitate a rapid transition from concept to production-ready applications.He provides valuable insights into developing scalable and efficient edge AI solutions, with a strong focus on practical implementation.みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
ここ3000字までしか入らないけどタイトルの方がたくさん文字入ると思います。
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
Microsoft - Power Platform_G.Aspiotis.pdf
Revolutionizing Application Development
with AI-powered low-code, presentation by George Aspiotis, Sr. Partner Development Manager, Microsoft
Artificial Intelligence for XMLDevelopment
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
20240605 QFM017 Machine Intelligence Reading List May 2024
Everything I found interesting about machines behaving intelligently during May 2024
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
Large Language Model (LLM) and it’s Geospatial Applications
Large Language Model (LLM) and it’s Geospatial Applications.
National Security Agency - NSA mobile device best practices
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Climate Impact of Software Testing at Nordic Testing Days
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
20 Comprehensive Checklist of Designing and Developing a Website
Dive into the world of Website Designing and Developing with Pixlogix! Looking to create a stunning online presence? Look no further! Our comprehensive checklist covers everything you need to know to craft a website that stands out. From user-friendly design to seamless functionality, we've got you covered. Don't miss out on this invaluable resource! Check out our checklist now at Pixlogix and start your journey towards a captivating online presence today.
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AIVladimir Iglovikov, Ph.D.
Presented by Vladimir Iglovikov:
- https://www.linkedin.com/in/iglovikov/
- https://x.com/viglovikov
- https://www.instagram.com/ternaus/
This presentation delves into the journey of Albumentations.ai, a highly successful open-source library for data augmentation.
Created out of a necessity for superior performance in Kaggle competitions, Albumentations has grown to become a widely used tool among data scientists and machine learning practitioners.
This case study covers various aspects, including:
People: The contributors and community that have supported Albumentations.
Metrics: The success indicators such as downloads, daily active users, GitHub stars, and financial contributions.
Challenges: The hurdles in monetizing open-source projects and measuring user engagement.
Development Practices: Best practices for creating, maintaining, and scaling open-source libraries, including code hygiene, CI/CD, and fast iteration.
Community Building: Strategies for making adoption easy, iterating quickly, and fostering a vibrant, engaged community.
Marketing: Both online and offline marketing tactics, focusing on real, impactful interactions and collaborations.
Mental Health: Maintaining balance and not feeling pressured by user demands.
Key insights include the importance of automation, making the adoption process seamless, and leveraging offline interactions for marketing. The presentation also emphasizes the need for continuous small improvements and building a friendly, inclusive community that contributes to the project's growth.
Vladimir Iglovikov brings his extensive experience as a Kaggle Grandmaster, ex-Staff ML Engineer at Lyft, sharing valuable lessons and practical advice for anyone looking to enhance the adoption of their open-source projects.
Explore more about Albumentations and join the community at:
GitHub: https://github.com/albumentations-team/albumentations
Website: https://albumentations.ai/
LinkedIn: https://www.linkedin.com/company/100504475
Twitter: https://x.com/albumentationsBuilding RAG with self-deployed Milvus vector database and Snowpark Container...
This talk will give hands-on advice on building RAG applications with an open-source Milvus database deployed as a docker container. We will also introduce the integration of Milvus with Snowpark Container Services.
Recently uploaded (20)
Pushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 days
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!
Full-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalization
Monitoring Java Application Security with JDK Tools and JFR Events
Monitoring Java Application Security with JDK Tools and JFR Events
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
20240605 QFM017 Machine Intelligence Reading List May 2024
20240605 QFM017 Machine Intelligence Reading List May 2024
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
Large Language Model (LLM) and it’s Geospatial Applications
Large Language Model (LLM) and it’s Geospatial Applications
National Security Agency - NSA mobile device best practices
National Security Agency - NSA mobile device best practices
Climate Impact of Software Testing at Nordic Testing Days
Climate Impact of Software Testing at Nordic Testing Days
20 Comprehensive Checklist of Designing and Developing a Website
20 Comprehensive Checklist of Designing and Developing a Website
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Building RAG with self-deployed Milvus vector database and Snowpark Container...
Building RAG with self-deployed Milvus vector database and Snowpark Container...