A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Learning the Ideal Evaluation Function
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A question is to what extent such automatic evaluation can be adequate. We define the notion of an ideal evaluation function. It is shown that coevolution can in principle achieve ideal evaluation. ...
Moreover, progress towards ideal evaluation can be measured. This observation leads to an algorithm for coevolution. The algorithm makes stable progress on several challenging abstract test problems. ...
EdJ gratefully acknowledges a talent fellowship from the Netherlands Organization for Scientific Research (NWO). ...
doi:10.1007/3-540-45105-6_34
fatcat:6hkhhtq4d5hmff7mrvk327pxcy
The MaxSolve algorithm for coevolution
2005
Proceedings of the 2005 conference on Genetic and evolutionary computation - GECCO '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Coevolution can be used to adaptively choose the tests used for evaluating candidate solutions. A long-standing question is how this dynamic setup may be organized to yield reliable search methods. ...
Recently, monotonic coevolution algorithms have been proposed for several solution concepts. ...
Since it cannot always be known whether an ideal evaluation set has already been reached, the delphi algorithm can only approximate ideal evaluation. ...
doi:10.1145/1068009.1068091
dblp:conf/gecco/Jong05
fatcat:vbwzkxbcrbfgronbormcjdywwe
Coevolution of neural networks using a layered pareto archive
2006
Proceedings of the 8th annual conference on Genetic and evolutionary computation - GECCO '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The technique is shown to keep the total number of evaluations in the order of those required by NEAT, making it applicable to complex domains. ...
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress in coevolution. ...
The second branch comes from the theoretical analysis of coevolution seen as multi-objective optimization: implementing an ideal CM. ...
doi:10.1145/1143997.1144058
dblp:conf/gecco/MonroySM06
fatcat:ftmaybnwrzhtbbwfelhc6aq73y
Study on Promoting Intelligent Manufacturing Path Choice of Manufacturing Enterprises Based on Coevolution Strategy
2021
Discrete Dynamics in Nature and Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The paper constructs an evaluation system for manufacturing enterprises to promote the selection of intelligent manufacturing path with 25 evaluation indexes and establishes the three-dimensional model ...
Based on the coevolution strategy, considering the time and space structure, this paper determines that the path of manufacturing enterprises to promote intelligent manufacturing is adaptive, visionary ...
4 represents emergent strategic path) to the ideal solution P, S 1i , and the distance from the negative ideal solution Q, S 2i , As shown in Figure 2 , the formulas are as follows: (15) At this point ...
doi:10.1155/2021/3552911
fatcat:2wwepu4dbrdkpmoukfbywaeqxa
Visualizing Coevolution with CIAO Plots
2006
Artificial Life
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
One of these techniques involves evaluating the performance of an individual from the current population in a series of trials against opponents from all previous generations, and visualizing the results ...
Use of all of these was demonstrated on real data from our experiments exploring the coevolution of sensory morphologies and continuous-time recurrent neural-network controllers for autonomous agents that ...
coevolution of simple linguistic interactions [5] . ...
doi:10.1162/106454606776073341
pmid:16539763
fatcat:b5g42ypvo5a45dyxb3a4o7qoge
Visualizing Coevolution with CIAO Plots
2006
Artificial Life
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
One of these techniques involves evaluating the performance of an individual from the current population in a series of trials against opponents from all previous generations, and visualizing the results ...
Use of all of these was demonstrated on real data from our experiments exploring the coevolution of sensory morphologies and continuous-time recurrent neural-network controllers for autonomous agents that ...
coevolution of simple linguistic interactions [5] . ...
doi:10.1162/artl.2006.12.2.199
pmid:16539763
fatcat:4wiobqwcjffyhh6bz5s7sfwl6y
A comparison of evaluation methods in coevolution
2007
Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this research, we compare four different evaluation methods in coevolution on the Majority Function problem. ...
The results of our experiments suggest that a combination of average score and weighted informativeness may provide a more accurate evaluation in coevolution. ...
Since each distinction a test makes contributes to its informativeness, and since the set of all possible distinctions is sufficient to provide ideal evaluation [5] , we measure the informativeness of ...
doi:10.1145/1276958.1277060
dblp:conf/gecco/YoJ07
fatcat:spwnzmbb7vh2hg237tqbc7smzi
A Sensitivity Analysis of a Cooperative Coevolutionary Algorithm Biased for Optimization
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Such explanations have led to adopting specific and constructive strategies for improving CCEA optimization performance by biasing the algorithm toward ideal collaboration. ...
Our next step is to investigate tractable methods for learning estimations of ideal partners. ...
Our hope is that a biased CCEA will help focus the power of cooperative coevolution more appropriately for optimization tasks. ...
doi:10.1007/978-3-540-24854-5_59
fatcat:mflpqmjcwzcohknl6yhv3lptyq
Advanced tutorial on coevolution
2007
Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation - GECCO '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Complete
Knowledge
Global
Solution
Possible in coevolution when
used to solve game of strategy?
Evaluation increasingly comprehensive
. .
.
. .
. ...
Evaluation never fully complete
New strategy may radically shift evaluations
. .
.
. .
.
Monotonicity
A
B
C
D
E
c 2007 by Sevan G. Ficici and Anthony Bucci ...
doi:10.1145/1274000.1274110
dblp:conf/gecco/FiciciB07
fatcat:bhirjz4h5jexza27b5suzykije
Intransitivity in Coevolution
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We review and investigate the current status of intransitivity as a potential obstacle in coevolution. ...
Pareto-Coevolution avoids intransitivity by translating any standard superiority relation into a transitive Pareto-dominance relation. Even for transitive problems though, cycling is possible. ...
Recently, it has been shown that coevolution can in principle approximate ideal evaluation [11] , i.e. equivalence to evaluation on the space of all tests. ...
doi:10.1007/978-3-540-30217-9_85
fatcat:qalqmgooqzgthgg4qergiv2zo4
A Visual Demonstration of Convergence Properties of Cooperative Coevolution
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
with partners chosen at random from the other population. ...
coevolutionary algorithms (CCEAs) using partial mixing, which allows us to compute the expected long-run convergence of such algorithms when individuals' fitness is based on the maximum payoff of some N evaluations ...
To combat noise in the evaluation process due to choice of partners, multiple evaluations may be performed. Aside from evaluation, the populations are evolved independently. ...
doi:10.1007/978-3-540-30217-9_90
fatcat:ydg7upqlmfe6rjbgkam2hbfokq
Automatic system identification based on coevolution of models and tests
2009
2009 IEEE Congress on Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
This paper deals with such an approach that is based on coevolution of models and tests. ...
Nevertheless, when no accurate model is available, controller transfer from simulation to reality means potential performance loss. It is the reality gap problem. ...
In this Pareto-Coevolution context, it is then proved that a minimal set of tests that distinguishes at most between the models' interaction values is an ideal evaluation set and leads the learners to ...
doi:10.1109/cec.2009.4982995
dblp:conf/cec/KoosMD09
fatcat:6hkixao5nzbxtaewynodiqqfgy
Coevolution of Second-order-mutant
2018
International Journal of Electrical and Computer Engineering (IJECE)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This research found that coevolution is better suited for multi-problem optimization than other single population methods (i.e. ...
In this research, we try to tackle both of optimizing mutant and optimizing test-case simultaneously using a coevolution optimization method. ...
Coevolution Using Laboratory and Real World Cases The coevolution evaluation fitness evaluation is only a relative quality of the solution (test case and mutant), to have a more accurate evaluation it ...
doi:10.11591/ijece.v8i5.pp3238-3249
fatcat:5ja4opsjdjf7zmo32j4svt5bju
The Incremental Pareto-Coevolution Archive
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Coevolution can in principle provide progress for problems where no accurate evaluation function is available. ...
The Incremental Pareto-Coevolution Archive is demonstrated in experiments. ...
Based on Ficici's notion of distinctions [9] , it has been shown that coevolution can in principle provide ideal evaluation [6, 7] . ...
doi:10.1007/978-3-540-24854-5_55
fatcat:7rvplsxxivegjpybjolkpxdk3y
Representation Development from Pareto-Coevolution
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An open question is how modules in such coevolutionary setups should be evaluated. Recently, Pareto-coevolution has provided a theoretical basis for evaluation in coevolution. ...
We define a notion of functional modularity, and objectives for module evaluation based on Pareto-Coevolution. It is shown that optimization of these objectives maximizes functional modularity. ...
A talent-fellowship from the Netherlands Organisation for Scientific Research (nwo) is gratefully acknowledged. ...
doi:10.1007/3-540-45105-6_33
fatcat:7ojfif476vgrbn6ijnxdl2ruve
« Previous
Showing results 1 — 15 out of 5,529 results