Formal Analysis, Hardness and Algorithms for Extracting Internal Structure of Test-Based Problems

by Wojciech Jaśkowski, Krzysztof Krawiec
Abstract:
Problems in which some elementary entities interact with each other are common in computational intelligence. This scenario, typical for co-evolving artificial-life agents, learning strategies for games, and machine learning from examples, can be formalized as a test-based problem and conveniently embedded in the common conceptual framework of coevolution. In test-based problems candidate solutions are evaluated on a number of test cases (agents, opponents, examples). It has been recently shown that every test of such problem can be regarded as a separate objective, and the whole problem as multi-objective optimization. Research on reducing the number of such objectives while preserving the relations between candidate solutions and tests led to the notions of underlying objectives and internal problem structure, which can be formalized as a coordinate system that spatially arranges candidate solutions and tests. The coordinate system that spans the minimal number of axes determines the so-called dimension of a problem and, being an inherent property of every problem, is of particular interest. In this study, we investigate in-depth the formalism of coordinate system and its properties, relate them to properties of partially ordered sets, and design an exact algorithm for finding a minimal coordinate system. We also prove that this problem is NP-hard and come up with a heuristic which is superior to the best algorithm proposed so far. Finally, we apply the algorithms to three abstract problems and demonstrate that the dimension of the problem is typically much lower than the number of tests, and for some problems converges to the intrinsic parameter of the problem — its a priori dimension.
Reference:
Formal Analysis, Hardness and Algorithms for Extracting Internal Structure of Test-Based Problems (Wojciech Jaśkowski, Krzysztof Krawiec), In Evolutionary Computation, volume 19, 2011.
Bibtex Entry:
@Article{Jaskowski2011formal,
  Title                    = {Formal Analysis, Hardness and Algorithms for Extracting Internal Structure of Test-Based Problems},
  Author                   = {Wojciech Jaśkowski and Krzysztof Krawiec},
  Journal                  = {Evolutionary Computation},
  Year                     = {2011},
  Number                   = {4},
  Pages                    = {639--671},
  Volume                   = {19},

  Abstract                 = {Problems in which some elementary entities interact with each other are common in computational intelligence. This scenario, typical for co-evolving artificial-life agents, learning strategies for games, and machine learning from examples, can be formalized as a test-based problem and conveniently embedded in the common conceptual framework of coevolution. In test-based problems candidate solutions are evaluated on a number of test cases (agents, opponents, examples). It has been recently shown that every test of such problem can be regarded as a separate objective, and the whole problem as multi-objective optimization. Research on reducing the number of such objectives while preserving the relations between candidate solutions and tests led to the notions of underlying objectives and internal problem structure, which can be formalized as a coordinate system that spatially arranges candidate solutions and tests. The coordinate system that spans the minimal number of axes determines the so-called dimension of a problem and, being an inherent property of every problem, is of particular interest. In this study, we investigate in-depth the formalism of coordinate system and its properties, relate them to properties of partially ordered sets, and design an exact algorithm for finding a minimal coordinate system. We also prove that this problem is NP-hard and come up with a heuristic which is superior to the best algorithm proposed so far. Finally, we apply the algorithms to three abstract problems and demonstrate that the dimension of the problem is typically much lower than the number of tests, and for some problems converges to the intrinsic parameter of the problem --- its a priori dimension.},
  Doi                      = {10.1162/EVCO_a_00046},
  Keywords                 = {coevolution, games, test-based problem, interactive domains, Pareto-coevolution, underlying objectives, NP-hardness, coevolutionary algorithm, co-optimization, underlying problem structure, internal problem structure, compare-on-one, compare-on-all},
  Url                      = {http://www.mitpressjournals.org/doi/abs/10.1162/EVCO_a_00046}
}

This entry was posted by . Bookmark the permalink.