Mapping the Fitness Landscape: A Structure-Guided Approach to Multi-Modal Optimization

Multimodal optimization requires finding many optima rather than merely keeping a diverse population. Yet most niching-based evolutionary algorithms rely on distances or density estimators without explicitly recovering the underlying peak--basin organization in the decision space, which can lead to pseudo-multimodality: many distinct individuals ultimately collapse into only a few basins. We introduce Chaotic Landscape-Decoding Evolution (CLDE), a decision-space-centric framework that turns multimodal search into a closed loop of decode--value--allocate--refine. CLDE injects controlled global exploration via a logistic chaotic map with a decaying step size, then builds a $k$-nearest-neighbor graph on a decoding canvas and performs persistence-guided basin growing that merges peaks only when they are not separated by deep valleys. An adaptive persistence threshold continuously tunes the decoding resolution online to avoid over-fragmentation and over-merging. Guided by the decoded structure, CLDE carries out basin-wise selection and refinement to improve solution quality while preserving basin coverage. We instantiate CLDE as CLDE-S and CLDE-M for single- and multi-objective multimodal optimization. Experiments on 20 CEC2013 functions show that CLDE-S achieves strong peak ratio under the same evaluation budget, while on DTLZ and MMMOP suites CLDE-M attains competitive IGD/IGDx, with pronounced gains on strongly multimodal problems.

Distribution-Free Pretraining of Classification Losses via Evolutionary Dynamics

We propose Evolutionary Dynamic Loss (EDL), a framework that learns a transferable classification loss in the probability space using unlimited synthetic prediction-label pairs, without accessing real samples during the main loss pretraining stage. EDL parameterizes the loss as a lightweight network and is trained with a semantics-free ranking-consistency objective that assigns larger penalties for more erroneous predictions. To robustly explore the space of loss functions, we optimize EDL via an evolutionary strategy and introduce chaotic mutation to improve exploration under noisy fitness evaluations. Experiments on CIFAR-10 with ResNet backbones show that EDL can serve as a drop-in replacement for cross-entropy and achieves competitive or improved accuracy, while ablation studies confirm that chaotic mutation yields faster convergence and better synthetic pretraining metrics than standard Gaussian mutation.

GARA: A novel approach to Improve Genetic Algorithms' Accuracy and Efficiency by Utilizing Relationships among Genes

Genetic algorithms have played an important role in engineering optimization. Traditional GAs treat each gene separately. However, biophysical studies of gene regulatory networks revealed direct associations between different genes. It inspires us to propose an improvement to GA in this paper, Gene Regulatory Genetic Algorithm (GRGA), which, to our best knowledge, is the first time to utilize relationships among genes for improving GA's accuracy and efficiency. We design a directed multipartite graph encapsulating the solution space, called RGGR, where each node corresponds to a gene in the solution and the edge represents the relationship between adjacent nodes. The edge's weight reflects the relationship degree and is updated based on the idea that the edges' weights in a complete chain as candidate solution with acceptable or unacceptable performance should be strengthened or reduced, respectively. The obtained RGGR is then employed to determine appropriate loci of crossover and mutation operators, thereby directing the evolutionary process toward faster and better convergence. We analyze and validate our proposed GRGA approach in a single-objective multimodal optimization problem, and further test it on three types of applications, including feature selection, text summarization, and dimensionality reduction. Results illustrate that our GARA is effective and promising.