Free lunches for neural network search

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 1291-1298

  Poli, Riccardo ^a   Graff, Mario ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Evolutionary algorithms; Neural networks; No free lunch

Indexed keywords

ARTIFICIAL NEURAL NETWORK; PERFORMANCE MEASURE; SEARCH ALGORITHMS;

LEARNING ALGORITHMS; NEURAL NETWORKS;

EVOLUTIONARY ALGORITHMS;

EID: 72749091465     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1570074     Document Type: Conference Paper

References (29)

1. A. Floares. Genetic programming and neural networks feedback linearization for modeling and controlling complex pharmacogenomic systems. In I. Bloch, A. Petrosino, and A. Tettamanzi, editors, Fuzzy Logic and Applications, 6th International Workshop, WILF 2005, Revised Selected Papers, volume 3849 of Lecture Notes in Computer Science, pages 178-187, Crema, Italy, Sept. 15-17 2005. Springer.
2. D. B. Fogel, L. J. Fogel, and V. W. Porto. Evolving neural networks. Biological Cybernetics, 63(6):487-493, 1990.
3. F. Gruau. Cellular encoding of genetic neural networks. Technical report 92-21, Laboratoire de l'Informatique du Parallilisme. Ecole Normale Supirieure de Lyon, France, 1992.
4. F. Gruau, D. Whitley, and L. Pyeatt. A comparison between cellular encoding and direct encoding for genetic neural networks. In J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, page 81, Stanford University, CA, USA, 28-31 July 1996. MIT Press.
5. C. Igel and M. Toussaint. On classes of functions for which no free lunch results hold. Information Processing Letters, 86(6):317-321, 2003.
6. C. Igel and M. Toussaint. A no-free-lunch theorem for non-uniform distributions of target functions. Journal of Mathematical Modelling and Algorithms, 3:313-322, 2004.
7. U. Johansson, T. Lofstrom, R. Konig, and L. Niklasson. Building neural network ensembles using genetic programming. In G. G. Yen, L. Wang, P. Bonissone, and S. M. Lucas, editors, Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pages 2239-2244, Vancouver, 6-21 July 2006. IEEE Press.
8. W. Kirchherr, M. Li, and P. Vitanyi. The miraculous universal distribution. Mathematical Intelligencer, 19:7-15, 1997.
9. H. Kitano. Designing neural networks using genetic algorithms with graph generation system. Complex Systems, 4(4):461-476, Aug. 1990.
10. J. R. Koza. Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
11. W. B. Langdon, S. J. Barrett, and B. F. Buxton. Genetic programming for combining neural networks for drug discovery. In R. Roy, M. Köppen, S. Ovaska, T. Furuhashi, and F. Hoffmann, editors, Soft Computing and Industry Recent Applications, pages 597-608. Springer-Verlag, 10-24 Sept. 2001. Published 2002.
12. W. B. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag, 2002.
13. J. L. McClelland and D. E. Rumelhart. Explorations in Parallel Distributed Processing. The MIT Press, Cambridge, Massachusetts, 1988.
14. D. J. Montana and L. Davis. Training feedforward neural networks using genetic algorithms. In N. S. Sridharan, editor, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence IJCAI-89, volume 1, pages 762-767, Detroit, MI, 20-25 Aug. 1989. Morgan Kaufmann, Palo Alto, CA.
15. D. E. Moriarty and R. Miikkulainen. Hierarchical evolution of neural networks. In Proceedings of the 1998 IEEE World Congress on Computational Intelligence, pages 428-433, Anchorage, Alaska, USA, 5-9 May 1998. IEEE Press.
16. R. Poli, M. Graff, and N. F. McPhee. Free lunches for function and program induction. In Foundations of Genetic Algorithms (FOGA) 10, 2009. forthcoming.
17. R. Poli, W. B. Langdon, and N. F. McPhee. A field guide to genetic programming. Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk, 2008. (With contributions by J. R. Koza).
18. J. C. F. Pujol and R. Poli. Evolution of the topology and the weights of neural networks using genetic programming with a dual representation. Applied Intelligence, 8:73-84, 1998.
19. J. C. F. Pujol and R. Poli. Evolution of neural networks using a two-dimensional aproach. In L. C. Jain, editor, Evolution of Engineering and Information Systems and Their Applications, CSC Press international series on computational intelligence. CRC Press, Boca Raton, Florida, USA, 1999.
20. C. Schumacher, M. D. Vose, and L. D. Whitley. The no free lunch and problem description length. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 565-570. Morgan Kaufmann, 2001.
21. M. J. Streeter. Two broad classes of functions for which a no free lunch result does not hold. In Proc. Genetic and Evolutionary Computation Conference GECCO-2003, pages 1418-1430. Morgan Kaufmann, 2003.
22. A. Tsakonas, V. Aggelis, I. Karkazis, and G. Dounias. An evolutionary system for neural logic networks using genetic programming and indirect encoding. Journal of Applied Logic, 2(3):349-379, 2004.
23. D. Whitley and J. Rowe. Focused no free lunch theorems. In GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pages 811-818, New York, NY, USA, 2008. ACM.
24. D. Whitley, T. Starkweather, and C. Bogart. Genetic algorithms and neural networks - optimizing connections and connectivity. Parallel Computing, 14(3):347-361, Aug. 1990.
25. D. Whitley and J. P. Watson. Complexity theory and the no free lunch theorem. In E. K. Burke and G. Kendall, editors, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, chapter 11, pages 317-339. Springer US, 2005.
26. B. Widrow and R. Winter. Neural nets for adaptive filtering and adaptive pattern recognition. IEEE Computer, pages 25-39, 1988.
27. D. Wolpert and W. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82, April 1997.
28. J. R. Woodward and J. R. Neil. No free lunch, program induction and combinatorial problems. In C. Ryan, T. Soule, M. Keijzer, E. P. K. Tsang, R. Poli, and E. Costa, editors, Genetic Programming, Proceedings of EuroGP'2003, volume 2610 of LNCS, pages 475-484, Essex, 14-16 Apr. 2003. Springer-Verlag.
29. B.-T. Zhang and H. Mühlenbein. Evolving optimal neural networks using genetic algorithms with Occam's razor. Complex Systems, 7:199-220, 1993.