English
Related papers

Related papers: On the Dynamics of Mating Preferences in Genetic P…

200 papers

Incorporating feature selection into a classification or regression method often carries a number of advantages. In this paper we formalize feature selection specifically from a discriminative perspective of improving…

Machine Learning · Computer Science 2013-01-18 Tony S. Jebara , Tommi S. Jaakkola

Optimal Mixing (OM) is a variation operator that integrates local search with genetic recombination. EAs with OM are capable of state-of-the-art optimization in discrete spaces, offering significant advantages over classic…

Neural and Evolutionary Computing · Computer Science 2025-06-19 Anton Bouter , Dirk Thierens , Peter A. N. Bosman

Precision medicine is accelerating rapidly in the field of health research. This includes fitting predictive models for individual patients based on patient similarity in an attempt to improve model performance. We propose an algorithm…

Methodology · Statistics 2025-02-07 Tatiana Krikella , Joel A. Dubin

Several studies question the adaptive value of female preferences for older males. Theory and evidence show that older males carry more deleterious mutations in their sperm than younger males carry. These mutations are not visible to…

Populations and Evolution · Quantitative Biology 2013-12-12 Joel James Adamson

Optimization problems find widespread use in both single-objective and multi-objective scenarios. In practical applications, users aspire for solutions that converge to the region of interest (ROI) along the Pareto front (PF). While the…

Artificial Intelligence · Computer Science 2025-03-10 Tian Huang , Shengbo Wang , Ke Li

Genetic algorithms, computer programs that simulate natural evolution, are increasingly applied across many disciplines. They have been used to solve various optimisation problems from neural network architecture search to strategic games,…

Neural and Evolutionary Computing · Computer Science 2021-09-14 Aymeric Vie , Alissa M. Kleinnijenhuis , Doyne J. Farmer

Mixup is a highly successful technique to improve generalization of neural networks by augmenting the training data with combinations of random pairs. Selective mixup is a family of methods that apply mixup to specific pairs, e.g. only…

Machine Learning · Computer Science 2023-06-06 Damien Teney , Jindong Wang , Ehsan Abbasnejad

In subdivided populations, migration acts together with selection and genetic drift and determines their evolution. Building up on a recently proposed method, which hinges on the emergence of a time scale separation between local and global…

Populations and Evolution · Quantitative Biology 2015-03-24 Pierangelo Lombardo , Andrea Gambassi , Luca Dall'Asta

We demonstrate how a genetic algorithm solves the problem of minimizing the resources used for network coding, subject to a throughput constraint, in a multicast scenario. A genetic algorithm avoids the computational complexity that makes…

Neural and Evolutionary Computing · Computer Science 2007-05-23 Minkyu Kim , Varun Aggarwal , Una-May O'Reilly , Muriel Medard , Wonsik Kim

Background: Speciation corresponds to the progressive establishment of reproductive barriers between groups of individuals derived from an ancestral stock. Since Darwin did not believe that reproductive barriers could be selected for, he…

Populations and Evolution · Quantitative Biology 2011-12-12 Etienne Joly

Divergence between populations for a given trait can be driven by natural or sexual selection, interacting with migration behaviour. Mating preference for different phenotypes can lead to the emergence and persistence of differentiated…

Populations and Evolution · Quantitative Biology 2018-01-25 Charline Smadi , Helene Leman , Violaine Llaurens

A genetic algorithm (GA) is a search method that optimises a population of solutions by simulating natural evolution. Good solutions reproduce together to create better candidates. The standard GA assumes that any two solutions can mate.…

Neural and Evolutionary Computing · Computer Science 2021-04-12 Aymeric Vie

Genetic Programming (GP) is an evolutionary algorithm commonly used for machine learning tasks. In this paper we present a method that allows GP to transform the representation of a large-scale machine learning dataset into a more compact…

Neural and Evolutionary Computing · Computer Science 2018-02-21 Lino Rodriguez-Coayahuitl , Alicia Morales-Reyes , Hugo Jair Escalante

A key challenge in the application of evolutionary algorithms in practice is the selection of an algorithm instance that best suits the problem at hand. What complicates this decision further is that different algorithms may be best suited…

Neural and Evolutionary Computing · Computer Science 2021-02-15 Furong Ye , Carola Doerr , Thomas Bäck

Parent selection methods are widely used in evolutionary computation to accelerate the optimization process, yet their theoretical benefits are still poorly understood. In this paper, we address this gap by proposing a parent selection…

Neural and Evolutionary Computing · Computer Science 2026-04-10 Andre Opris , Denis Antipov

Optimal subset selection is an important task that has numerous algorithms designed for it and has many application areas. STPGA contains a special genetic algorithm supplemented with a tabu memory property (that keeps track of previously…

Methodology · Statistics 2017-02-28 Deniz Akdemir

Recent advances in large language models (LLMs) have significantly improved the alignment of models with general human preferences. However, a major challenge remains in adapting LLMs to individual preferences, which are not only diverse…

Computation and Language · Computer Science 2026-04-15 Shanyong Wang , Shuhang Lin , Yining Zhao , Xi Zhu , Yongfeng Zhang

Optical focusing through scattering media has important implications for optical applications in medicine, communications, and detection. In recent years, many wavefront shaping methods have been successfully applied to the field, among…

A hybrid evolutionary algorithm with importance sampling method is proposed for multi-dimensional optimization problems in this paper. In order to make use of the information provided in the search process, a set of visited solutions is…

Neural and Evolutionary Computing · Computer Science 2013-08-26 Guanghui Huang , Zhifeng Pan

We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices.…

Optimization and Control · Mathematics 2007-05-23 Pavel Chebotarev , Elena Shamis