Kolmogorov complexity, optimization and hardness

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 112-119

  Borenstein, Yossi ^a   Poli, Riccardo ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; OPTIMIZATION; PROBLEM SOLVING;

BLACK BOX SCENARIO; FITNESS FUNCTIONS; KOLMOGOROV COMPLEXITY (KC); PROBLEM DIFFICULTY;

COMPUTATIONAL METHODS;

EID: 34547264921     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv., 35(3):268-308, 2003.
2. Y. Borenstein and R. Poli. Information landscapes. In GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation, pages 1515-1522, New York, NY, USA, 2005. ACM Press.
3. E. Cantú-Paz, J. A. Foster, K. Deb, L. Davis, R. Roy, U.-M. O'Reilly, H.-G. Beyer, R. K. Standish, G. Kendall, S. W. Wilson, M. Harman, J. Wegener, D. Dasgupta, M. A. Potter, A. C. Schultz, K. A. Dowsland, N. Jonoska, and J. F. Miller, editors, volume 2724 of Lecture Notes in Computer Science. Springer, 2003.
4. S. Droste, T. Jansen, and I. Wegener. Optimization with, randomized search heuristics - the (a)nfl theorem, realistic scenarios, and difficult functions. Theor. Comput. Sci., 287(1): 131-144, 2002.
5. S. Droste, T. Jansen, and I. Wegener. Upper and lower bounds for randomized search heuristics in black-box optimization. Electronic Colloquium on Computational Complexity (ECCC), (048), 2003.
6. T. M. English. Optimization is easy and learning is hard in the typical. function. In A. Zalzala, C. Fonseca, J.-H. Kim, and A. Smith, editors, Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), pages 924-931. IEEE Press, 2000.
7. T. M. English. Practical implications of new results in conservation of optimizer performance. In M. Schoenauer et al. editors, Parallel Problem Solving from Nature - PPSN VI, 6th International Conference, Paris, France, September 18-20, 2000, Proceedings, volume 1917 of Lecture Notes in Computer Science, pages 69-78. Springer, 2000.
8. L. Fortnow. Kolmogorov complexity and computational complexity, 2004.
9. O. Goldreich. Pseudorandomness. In Automata, Languages and Programming, pages 687-704, 2000.
10. O. Goldreich. Foundations of cryptography a primer. Foundations and Trends in Theoretical Computer Science, 1(1), 2005.
11. P. Grünwald. A tutorial introduction to the minimum description length principle. CoRR, math.ST/0406077, 2004.
12. P. Grunwald and P. Vitanyi. Shannon information and kolmogorov complexity. IEEE Transactions on Information Theory, 2004. In Review.
13. P. Grunwald and P. Vitanyi. Algorithmic information theory. In Handbook on the Philosophy of Information. Elsevier, to appear.
14. H. Guo and W. H. Hsu. GA-hardness revisited. In Canú-Paz et al. [3], pages 1584-1585.
15. L. Lovsz. Information, and complexity (how to measure them?). In The Emergence of Complexity in Mathematics, Physics, Chemistry, and Biology, pages 65-80. Princeton University Press, 1996.
16. P. Orponen, K. i Ko, U. Schöning, and O. Watanabe. Instance complexity. J. ACM, 41(1):96-121, 1994.
17. P. M. Pardalos and M. G. C. Resende, editors. Handbook of Applied Optimization. Oxford University Press, 2002.
18. C. Schumacher, M. D. Vose, and L. D. Whitley. The no free lunch and problem description length. In L. Spector et al. editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 565-570, San Francisco, California, USA, 7-11 July 2001. Morgan Kaufmann.
19. M. J. Streeter. Two broad classes of functions for which a no free lunch result does not hold. In Cantú-Paz et al. [3], pages 1418-1430.
20. N. K. Vereshchagin and P. M. B. Vitányi. Kolmogorov's structure functions and model selection. IEEE Transactions on Information Theory, 50(12):3265-3290, 2004.
21. I. Wegener. Towards a theory of randomized search, heuristics. In B. Rovan and P. Vojtás, editors, MFCS, volume 2747 of Lecture Notes in Computer Science, pages 125-141. Springer, 2003.
22. D. Wolpert and W. G. Macready. No free lunch theorems for optimization. IEEE Trans. Evolutionary Computation, 1(1):67-82, 1997.
23. D. P. Y.C. Ho. Simple explanation of the no-free-lunch theorem and its implications. Journal of Optimization Theory and Applications, 115(3):549-570, 2002.