mk:his11

Summary

A GRATIS Theorem for Relational Optimization. Mario Köppen, Kaori Yoshida and Kei Ohnishi. In Proc. 11th International Conference on Hybrid Intelligent Systems (HIS 2011), pages 674-679, Melaka, Malaysia, December 2011.

Abstract

We are studying the NFL Theorems with regard to relational optimization. In relational optimization, we represent the optimization problem by a formal relation, and the solution by the set of maximal (or non-dominated) elements of this relation. This appears to be a natural extension of standard optimization, and covers other notions of optimality as well. It will be shown that in this case, the NFL Theorems do not hold and that there are pairs of algorithms and a performance measure, where one always outperforms the other with regard to this performance measure if averaged over all possible relations. More specifically, the outperforming algorithm is an algorithm, where elements are checked one by one if they are dominated by any other element, while the outperformed algorithm is an algorithm, where elements are checked one by one if they dominate any other element. The proof is accompanied by a complete analysis of a special case, where also other performance measures are shown to be better when using the former algorithm.

Bibtex entry

@INPROCEEDINGS { mk:his11,
    ABSTRACT = { We are studying the NFL Theorems with regard to relational optimization. In relational optimization, we represent the optimization problem by a formal relation, and the solution by the set of maximal (or non-dominated) elements of this relation. This appears to be a natural extension of standard optimization, and covers other notions of optimality as well. It will be shown that in this case, the NFL Theorems do not hold and that there are pairs of algorithms and a performance measure, where one always outperforms the other with regard to this performance measure if averaged over all possible relations. More specifically, the outperforming algorithm is an algorithm, where elements are checked one by one if they are dominated by any other element, while the outperformed algorithm is an algorithm, where elements are checked one by one if they dominate any other element. The proof is accompanied by a complete analysis of a special case, where also other performance measures are shown to be better when using the former algorithm. },
    ADDRESS = { Melaka, Malaysia },
    AUTHOR = { Mario Köppen and Kaori Yoshida and Kei Ohnishi },
    BOOKTITLE = { Proc. 11th International Conference on Hybrid Intelligent Systems (HIS 2011) },
    ADDED = { 2011-12-14 14:42:30 +0900 },
    MODIFIED = { 2011-12-14 14:46:45 +0900 },
    MONTH = { December },
    PAGES = { 674-679 },
    PDF = { his11.pdf },
    TITLE = { A GRATIS Theorem for Relational Optimization },
    YEAR = { 2011 },
}