Exploiting Problem Structure in Combinatorial Landscapes: A Case Study on Pure Mathematics Application

In this paper, we present a method using AI techniques to solve a case of pure mathematics applications for finding narrow admissible tuples. The original problem is formulated into a combinatorial optimization problem. In particular, we show how to exploit the local search structure to formulate the problem landscape for dramatic reductions in search space and for non-trivial elimination in search barriers, and then to realize intelligent search strategies for effectively escaping from local minima. Experimental results demonstrate that the proposed method is able to efficiently find best known solutions. This research sheds light on exploiting the local problem structure for an efficient search in combinatorial landscapes as an application of AI to a new problem domain.

[1]  Daniel M. Gordon,et al.  Dense Admissible Sets , 1998, ANTS.

[2]  T. Tao,et al.  Chains of large gaps between primes , 2015, 1511.04468.

[3]  Andrew M. Sutton,et al.  Directed Plateau Search for MAX-k-SAT , 2010, SOCS.

[4]  Toby Walsh,et al.  Backbones in Optimization and Approximation , 2001, IJCAI.

[5]  Nikolaj Bjørner,et al.  Maximum Satisfiability Using Cores and Correction Sets , 2015, IJCAI.

[6]  D. Polymath,et al.  Variants of the Selberg sieve, and bounded intervals containing many primes , 2014, 1407.4897.

[7]  Kevin Leyton-Brown,et al.  Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.

[8]  Jörg Hoffmann,et al.  Local Search Topology in Planning Benchmarks: An Empirical Analysis , 2001, IJCAI.

[9]  J. Maynard.  Small gaps between primes , 2013, 1311.4600.

[10]  Ian Richards,et al.  Primes in intervals , 1974 .

[11]  Carlos Ansótegui,et al.  Exploiting the Structure of Unsatisfiable Cores in MaxSAT , 2015, IJCAI.

[12]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[13]  New equidistribution estimates of Zhang type , 2014, 1402.0811.

[14]  C. Caldwell.  Mathematics of Computation , 1999 .

[15]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[16]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[17]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[18]  Subbarao Kambhampati,et al.  G-Value Plateaus: A Challenge for Planning , 2010, ICAPS.

[19]  Stephan Billinger,et al.  Search on Rugged Landscapes: An Experimental Study , 2013, Organ. Sci..

[20]  Gilles Dequen,et al.  A backbone-search heuristic for efficient solving of hard 3-SAT formulae , 2001, IJCAI.

[21]  M. Collins.  Finding needles in haystacks is harder with neutrality , 2005, GECCO '05.

[22]  Thomas Stützle,et al.  A review of metrics on permutations for search landscape analysis , 2007, Comput. Oper. Res..

[23]  Pedro M. Domingos,et al.  Recursive Decomposition for Nonconvex Optimization , 2015, ArXiv.

[24]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[25]  M. Collins.  Finding needles in haystacks is harder with neutrality , 2006, Genetic Programming and Evolvable Machines.

[26]  David A. Clark,et al.  Dense admissible sequences , 2001, Math. Comput..

[27]  Christian M. Reidys,et al.  Combinatorial Landscapes , 2002, SIAM Rev..

[28]  Jeremy Frank,et al.  When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..

[29]  Adam Prügel-Bennett,et al.  On the Landscape of Combinatorial Optimization Problems , 2014, IEEE Transactions on Evolutionary Computation.

[30]  Primes in tuples I , 2005, math/0508185.

[31]  Joseph C. Culberson,et al.  Frozen development in graph coloring , 2001, Theor. Comput. Sci..

[32]  Bart Selman,et al.  Algorithm portfolios , 2001, Artif. Intell..

[33]  L. Darrell Whitley,et al.  Problem difficulty for tabu search in job-shop scheduling , 2003, Artif. Intell..

[34]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[35]  Weixiong Zhang,et al.  Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem , 2011, J. Artif. Intell. Res..

[36]  Yitang Zhang.  Bounded gaps between primes , 2014 .

[37]  Christopher Mears,et al.  Towards Automatic Dominance Breaking for Constraint Optimization Problems , 2015, IJCAI.