Point representation for local optimization

In the context of stochastic search, once regions of high performance are found, having the property that small changes in the candidate solution correspond to searching nearby neighborhoods provides the ability to perform effective local optimization. To achieve this, Gray Codes are often employed for encoding ordinal points or discretized real numbers. In this paper, we present a method to label similar and/or close points within arbitrary graphs with small Hamming distances. The resultant point labels can be viewed as an approximate high-dimensional variant of Gray Codes. The labeling procedure is useful for any task in which the solution requires the search algorithm to select a small subset of items out of many. A large number of empirical results using these encodings with a combination of genetic algorithms and hill-climbing are presented.

[1]  Philippe Preux,et al.  Climbing Up NP-Hard Hills , 1996, PPSN.

[2]  L. Darrell Whitley,et al.  Properties of Gray and Binary Representations , 2004, Evolutionary Computation.

[3]  Shumeet Baluja,et al.  Evolution-Based Methods for Selecting Point Data for Object Localization: Applications to Computer-Assisted Surgery , 2004, Applied Intelligence.

[4]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[5]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[6]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[7]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[8]  Carla Savage,et al.  A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..

[9]  David B. Skalak,et al.  Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms , 1994, ICML.

[10]  Jean-Michel Renders,et al.  Hybrid methods using genetic algorithms for global optimization , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[11]  Martin Wattenberg,et al.  Stochastic Hillclimbing as a Baseline Mathod for Evaluating Genetic Algorithms , 1995, NIPS.

[12]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[13]  Uday Kumar Chakraborty,et al.  An analysis of Gray versus binary encoding in genetic search , 2003, Inf. Sci..

[14]  Shankar Kumar,et al.  Video suggestion and discovery for youtube: taking random walks through the view graph , 2008, WWW.

[15]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[16]  Shumeet Baluja,et al.  Neighborhood Preserving Codes for Assigning Point Labels: Applications to Stochastic Search , 2013, ICCS.

[17]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[18]  Carlos García-Martínez,et al.  Local Search Based on Genetic Algorithms , 2008, Advances in Metaheuristics for Hard Optimization.

[19]  Zoubin Ghahramani,et al.  Learning from labeled and unlabeled data with label propagation , 2002 .

[20]  L. Darrell Whitley,et al.  Transforming the search space with Gray coding , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[21]  Franz Rothlauf,et al.  On the Locality of Representations , 2003, GECCO.

[22]  J. David Schaffer,et al.  Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms , 1988, ML.

[23]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[24]  Shigenobu Kobayashi,et al.  Hybridization of genetic algorithm and local search in multiobjective function optimization: recommendation of GA then LS , 2006, GECCO '06.

[25]  Colin R. Reeves,et al.  Genetic Algorithms and Neighbourhood Search , 1994, Evolutionary Computing, AISB Workshop.