A two-stage algorithm in evolutionary product unit neural networks for
classification
- URL: http://arxiv.org/abs/2402.06622v1
- Date: Fri, 9 Feb 2024 18:56:07 GMT
- Title: A two-stage algorithm in evolutionary product unit neural networks for
classification
- Authors: Antonio J. Tall\'on-Ballesteros and C\'esar Herv\'as-Mart\'inez
- Abstract summary: This paper presents a procedure to add broader diversity at the beginning of the evolutionary process.
It consists of creating two initial populations with different parameter settings, evolving them for a small number of generations, selecting the best individuals from each population in the same proportion and combining them to constitute a new initial population.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper presents a procedure to add broader diversity at the beginning of
the evolutionary process. It consists of creating two initial populations with
different parameter settings, evolving them for a small number of generations,
selecting the best individuals from each population in the same proportion and
combining them to constitute a new initial population. At this point the main
loop of an evolutionary algorithm is applied to the new population. The results
show that our proposal considerably improves both the efficiency of previous
methodologies and also, significantly, their efficacy in most of the data sets.
We have carried out our experimentation on twelve data sets from the UCI
repository and two complex real-world problems which differ in their number of
instances, features and classes.
Related papers
- Weighted Diversified Sampling for Efficient Data-Driven Single-Cell Gene-Gene Interaction Discovery [56.622854875204645]
We present an innovative approach utilizing data-driven computational tools, leveraging an advanced Transformer model, to unearth gene-gene interactions.
A novel weighted diversified sampling algorithm computes the diversity score of each data sample in just two passes of the dataset.
arXiv Detail & Related papers (2024-10-21T03:35:23Z) - Enhancing Diversity in Multi-objective Feature Selection [1.6602942962521352]
This paper introduces an augmentation to the diversity of the population in the well-established multi-objective scheme of the genetic algorithm, NSGA-II.
The proposed multi-objective feature selection method undergoes testing on twelve real-world classification problems, with the number of features ranging from 2,400 to nearly 50,000.
arXiv Detail & Related papers (2024-07-25T06:09:44Z) - A Two-stage Evolutionary Framework For Multi-objective Optimization [8.253379910879795]
Two-stage Evolutionary Framework For Multi-objective Optimization (TEMOF)
One classic MOEA and two state-of-the-art MOEAs are integrated into the framework to form three new algorithms.
Winner among three new algorithms is compared with several existing MOEAs and shows better results.
arXiv Detail & Related papers (2024-07-09T04:14:59Z) - New Pathways in Coevolutionary Computation [2.402878726843412]
We present two new forms of coevolutionary algorithms.
One is a cooperative coevolutionary algorithm that discovers both a representation and an encoding for solving a particular problem of interest.
The other is a commensalistic coevolutionary algorithm that maintains two coevolving populations.
arXiv Detail & Related papers (2024-01-19T06:11:33Z) - On the Convergence of Distributed Stochastic Bilevel Optimization
Algorithms over a Network [55.56019538079826]
Bilevel optimization has been applied to a wide variety of machine learning models.
Most existing algorithms restrict their single-machine setting so that they are incapable of handling distributed data.
We develop novel decentralized bilevel optimization algorithms based on a gradient tracking communication mechanism and two different gradients.
arXiv Detail & Related papers (2022-06-30T05:29:52Z) - Gated recurrent units and temporal convolutional network for multilabel
classification [122.84638446560663]
This work proposes a new ensemble method for managing multilabel classification.
The core of the proposed approach combines a set of gated recurrent units and temporal convolutional neural networks trained with variants of the Adam gradients optimization approach.
arXiv Detail & Related papers (2021-10-09T00:00:16Z) - Harnessing Heterogeneity: Learning from Decomposed Feedback in Bayesian
Modeling [68.69431580852535]
We introduce a novel GP regression to incorporate the subgroup feedback.
Our modified regression has provably lower variance -- and thus a more accurate posterior -- compared to previous approaches.
We execute our algorithm on two disparate social problems.
arXiv Detail & Related papers (2021-07-07T03:57:22Z) - cMLSGA: A Co-Evolutionary Multi-Level Selection Genetic Algorithm for
Multi-Objective Optimization [0.0]
Multi-Level Selection Genetic Algorithm (MLSGA) already shows good performance on range of problems.
This paper proposes a distinct set of co-evolutionary mechanisms, which defines co-evolution as competition between collectives rather than individuals.
arXiv Detail & Related papers (2021-04-22T13:52:21Z) - Epigenetic evolution of deep convolutional models [81.21462458089142]
We build upon a previously proposed neuroevolution framework to evolve deep convolutional models.
We propose a convolutional layer layout which allows kernels of different shapes and sizes to coexist within the same layer.
The proposed layout enables the size and shape of individual kernels within a convolutional layer to be evolved with a corresponding new mutation operator.
arXiv Detail & Related papers (2021-04-12T12:45:16Z) - Few-Shot Named Entity Recognition: A Comprehensive Study [92.40991050806544]
We investigate three schemes to improve the model generalization ability for few-shot settings.
We perform empirical comparisons on 10 public NER datasets with various proportions of labeled data.
We create new state-of-the-art results on both few-shot and training-free settings.
arXiv Detail & Related papers (2020-12-29T23:43:16Z) - Differential Evolution with Reversible Linear Transformations [8.873449722727026]
We propose to generate new candidate solutions by utilizing reversible linear transformation applied to a triplet of solutions from the population.
In other words, the population is enlarged by using newly generated individuals without evaluating their fitness.
arXiv Detail & Related papers (2020-02-07T16:05:54Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.