LEARNABLE EVOLUTION MODEL: Evolutionary Processes Guided by Machine Learning
Machine Learning - Special issue on multistrategy learning
An updated survey of GA-based multiobjective optimization techniques
ACM Computing Surveys (CSUR)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Introduction to Connectionist Modelling of Cognitive Processes
Introduction to Connectionist Modelling of Cognitive Processes
Inducing Process Models from Continuous Data
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Developing reproducible and comprehensible computational models
Artificial Intelligence
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
Hi-index | 0.00 |
A non-dominated sorting genetic algorithm is used to evolve models of learning from different theories for multiple tasks. Correlation analysis is performed to identify parameters which affect performance on specific tasks; these are the predictive variables. Mutation is biased so that changes to parameter values tend to preserve values within the population's current range. Experimental results show that optimal models are evolved, and also that uncovering predictive variables is beneficial in improving the rate of convergence.