Why Local Search Excels in Expression Simplification

Simplifying expressions is important to make numerical integration of large expressions from High Energy Physics tractable. To this end, Horner's method can be used. Finding suitable Horner schemes is assumed to be hard, due to the lack of local heuristics. Recently, MCTS was reported to be able to find near optimal schemes. However, several parameters had to be fine-tuned manually. In this work, we investigate the state space properties of Horner schemes and find that the domain is relatively flat and contains only a few local minima. As a result, the Horner space is appropriate to be explored by Stochastic Local Search (SLS), which has only two parameters: the number of iterations (computation time) and the neighborhood structure. We found a suitable neighborhood structure, leaving only the allowed computation time as a parameter. We performed a range of experiments. The results obtained by SLS are similar or better than those obtained by MCTS. Furthermore, we show that SLS obtains the good results at least 10 times faster. Using SLS, we can speed up numerical integration of many real-world large expressions by at least a factor of 24. For High Energy Physics this means that numerical integrations that took weeks can now be done in hours.

[1]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[2]  Simon M. Lucas,et al.  A Survey of Monte Carlo Tree Search Methods , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[3]  H. Jaap van den Herik,et al.  HEPGAME and the Simplification of Expressions , 2014, ArXiv.

[4]  Rémi Coulom,et al.  Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.

[5]  Vladik Kreinovich,et al.  Greedy algorithms for optimizing multivariate Horner schemes , 2004, SIGS.

[6]  Marc Moreno Maza,et al.  Efficient Evaluation of Large Polynomials , 2010, ICMS.

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

[8]  Jian Ma,et al.  Theory and Methodology Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property : An investigation of generation mechanism , 1997 .

[9]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[10]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[11]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[12]  Tomoyuki Hiroyasu,et al.  Adaptive Simulated Annealing for maximum temperature , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[13]  H. Jaap van den Herik,et al.  Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification , 2013, ICAART.

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

[15]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[16]  Walid Ben-Ameur,et al.  Computing the Initial Temperature of Simulated Annealing , 2004, Comput. Optim. Appl..

[17]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[18]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[19]  Vladimir L. Arlazarov,et al.  Algorithms for games , 1987 .

[20]  W. G. Horner,et al.  A new method of solving numerical equations of all orders, by continuous approximation , 1815 .

[21]  H. Jaap van den Herik,et al.  Improving multivariate Horner schemes with Monte Carlo tree search , 2012, Comput. Phys. Commun..

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

[23]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.