Why Local Search Excels in Expression Simplification

09/18/2014
by   Ben Ruijl, et al.
0

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.

READ FULL TEXT
research
05/25/2014

HEPGAME and the Simplification of Expressions

Advances in high energy physics have created the need to increase comput...
research
09/19/2015

Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs

The Minimum Vertex Cover (MinVC) problem is a well-known NP-hard problem...
research
01/10/2018

Instance Scale, Numerical Properties and Design of Metaheuristics: A Study for the Facility Location Problem

Metaheuristics are known to be strong in solving large-scale instances o...
research
03/12/2016

Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm

We consider a multi-neighborhood local search algorithm with a large num...
research
07/17/2009

The Single Machine Total Weighted Tardiness Problem - Is it (for Metaheuristics) a Solved Problem ?

The article presents a study of rather simple local search heuristics fo...
research
03/27/2019

Local Search for Fast Matrix Multiplication

Laderman discovered a scheme for computing the product of two 3x3 matric...
research
09/03/2018

A Local Lemma for Focused Stochastic Algorithms

We develop a framework for the rigorous analysis of focused stochastic l...

Please sign up or login with your details

Forgot password? Click here to reset