Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Despite the range of applications and successes of evolutionary algorithms, expensive fitness computations often form a critical performance bottleneck. A preferred method of reducing the computational overhead is to coevolve rank predictors, providing a coarse and lightight fitness approximation that has proven to drastically increase performance. Hover, the majority of previous work on rank predictor coevolution focused solely on improving the predictor heuristics while strategies to select the equally important trainer population is often an afterthought. Four different strategies are presented and benchmarked on a symbolic regression problem using hundreds of test problems with varying complexities. Of the four strategies, updating the trainer population with the solution of the highest rank variance is found to be significantly superior, resulting in a four to ten fold reduction in computational effort for similar convergence rates over the remaining strategies.
['Daniel Le Ly', 'Hod Lipson']
I am writing a research paper on a idea Trainer selection strategies for coevolving rank predictors
[{"from": "human", "value": "I am writing a research paper on a idea Trainer selection strategies for coevolving rank predictors"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Despite the range of applications and successes of evolutionary algorithms, expensive fitness computations often form a critical performance bottleneck. A preferred method of reducing the computational overhead is to coevolve rank predictors, providing a coarse and lightight fitness approximation that has proven to drastically increase performance. Hover, the majority of previous work on rank predictor coevolution focused solely on improving the predictor heuristics while strategies to select the equally important trainer population is often an afterthought. Four different strategies are presented and benchmarked on a symbolic regression problem using hundreds of test problems with varying complexities. Of the four strategies, updating the trainer population with the solution of the highest rank variance is found to be significantly superior, resulting in a four to ten fold reduction in computational effort for similar convergence rates over the remaining strategies."}]