364 research outputs found
Can Machines Think in Radio Language?
People can think in auditory, visual and tactile forms of language, so can
machines principally. But is it possible for them to think in radio language?
According to a first principle presented for general intelligence, i.e. the
principle of language's relativity, the answer may give an exceptional solution
for robot astronauts to talk with each other in space exploration.Comment: 4 pages, 1 figur
Large Language and Text-to-3D Models for Engineering Design Optimization
The current advances in generative AI for learning large neural network
models with the capability to produce essays, images, music and even 3D assets
from text prompts create opportunities for a manifold of disciplines. In the
present paper, we study the potential of deep text-to-3D models in the
engineering domain, with focus on the chances and challenges when integrating
and interacting with 3D assets in computational simulation-based design
optimization. In contrast to traditional design optimization of 3D geometries
that often searches for the optimum designs using numerical representations,
such as B-Spline surface or deformation parameters in vehicle aerodynamic
optimization, natural language challenges the optimization framework by
requiring a different interpretation of variation operators while at the same
time may ease and motivate the human user interaction. Here, we propose and
realize a fully automated evolutionary design optimization framework using
Shap-E, a recently published text-to-3D asset network by OpenAI, in the context
of aerodynamic vehicle optimization. For representing text prompts in the
evolutionary optimization, we evaluate (a) a bag-of-words approach based on
prompt templates and Wordnet samples, and (b) a tokenisation approach based on
prompt templates and the byte pair encoding method from GPT4. Our main findings
from the optimizations indicate that, first, it is important to ensure that the
designs generated from prompts are within the object class of application, i.e.
diverse and novel designs need to be realistic, and, second, that more research
is required to develop methods where the strength of text prompt variations and
the resulting variations of the 3D designs share causal relations to some
degree to improve the optimization.Comment: 9 pages, 13 figures, IEEE conference templat
Adaptive modelling strategy for continuous multi-objective optimization
The Pareto optimal set of a continuous multi-objective optimization problem is a piecewise continuous manifold under some mild conditions. We have recently developed several multi-objective evolutionary algorithms based on this property. However, the modelling methods used in these algorithms are rather costly. In this paper, a cheap and effective modelling strategy is proposed for building the probabilistic models of promising solutions. A new criterion is proposed for measuring the convergence of the algorithm. The locality degree of each local model is adjusted according to the proposed convergence criterion. Experimental results show that the algorithm with the proposed strategy is very promising. © 2007 IEEE
Vector Field Embryogeny
We present a novel approach toward evolving artificial embryogenies, which omits the graph representation of gene regulatory networks and directly shapes the dynamics of a system, i.e., its phase space. We show the feasibility of the approach by evolving cellular differentiation, a basic feature of both biological and artificial development. We demonstrate how a spatial hierarchy formulation can be integrated into the framework and investigate the evolution of a hierarchical system. Finally, we show how the framework allows the investigation of allometry, a biological phenomenon, and its role for evolution. We find that direct evolution of allometric change, i.e., the evolutionary adaptation of the speed of system states on transient trajectories in phase space, is advantageous for a cellular differentiation task
Learning to Expand/Contract Pareto Sets in Dynamic Multi-objective Optimization with a Changing Number of Objectives
Dynamic multi-objective optimization problems (DMOPs) with a changing number of objectives may have Pareto-optimal set (PS) manifold expanding or contracting over time. Knowledge transfer has been used for solving DMOPs, since it can transfer useful information from solving one problem instance to solve another related problem instance. However, we show that the state-of-the-art transfer approach based on heuristic lacks diversity on problem with extremely strong bias and loses convergence on problems with multi-modality and variable correlation, after the number of objectives increases and decreases, respectively. Therefore, we propose a novel transfer strategy based on learning, called learning to expand and contract PS (denoted as LEC) for enhancing diversity and convergence after number of objective increases and decreases, respectively. It firstly learns potentially good directions for expansion and contraction separately via principal component analysis. Then, the most promising expansion and contraction directions are selected from their candidates according to whether they help diversity and convergence, respectively. Lastly, PS is learnt to be expanded and contracted based on these most promising directions. Comprehensive studies using 13 DMOP benchmarks with a changing number of objectives demonstrate that our proposed LEC is effective on improving solution quality, not only right after changes but also after optimization of different generations, compared to state-of-the-art algorithms.<br/
Combining model-based and genetics-based offspring generation for multi-objective optimization using a convergence criterion
Abstract — In our previous work [1], it has been shown that the performance of evolutionary multi-objective algorithms can be greatly enhanced if the regularity in the distribution of Pareto-optimal solutions is taken advantage using a probabilistic model. This paper suggests a new hybrid multi-objective evolutionary algorithm by introducing a convergence based criterion to determine when the model-based method and when the genetics-based method should be used to generate offspring in each generation. The basic idea is that the genetics-based method, i.e., crossover and mutation, should be used when the population is far away from the Pareto front and no obvious regularity in population distribution can be observed. When the population moves towards the Pareto front, the distribution of the individuals will show increasing regularity and in this case, the model-based method should be used to generate offspring. The proposed hybrid method is verified on widely used test problems and our simulation results show that the method is effective in achieving Pareto-optimal solutions compared to two state-of-the-art evolutionary multi-objective algorithms: NSGA-II and SPEA2, and our pervious method in [1]. I
Knowledge Transfer for Dynamic Multi-objective Optimization with a Changing Number of Objectives
Different from most other dynamic multi-objective optimization problems (DMOPs), DMOPs with a changing number of objectives usually result in expansion or contraction of the Pareto front or Pareto set manifold. Knowledge transfer has been used for solving DMOPs, since it can transfer useful information from solving one problem instance to solve another related problem instance. However, we show that the state-of-the-art transfer algorithm for DMOPs with a changing number of objectives lacks sufficient diversity when the fitness landscape and Pareto front shape present nonseparability, deceptiveness or other challenging features. Therefore, we propose a knowledge transfer dynamic multi-objective evolutionary algorithm (KTDMOEA) to enhance population diversity after changes by expanding/contracting the Pareto set in response to an increase/decrease in the number of objectives. This enables a solution set with good convergence and diversity to be obtained after optimization. Comprehensive studies using 13 DMOP benchmarks with a changing number of objectives demonstrate that our proposed KTDMOEA is successful in enhancing population diversity compared to state-of-the-art algorithms, improving optimization especially in fast changing environments
- …