Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Information flow and Laplacian dynamics on local optima networks (2401.09229v1)

Published 17 Jan 2024 in cs.NE

Abstract: We propose a new way of looking at local optima networks (LONs). LONs represent fitness landscapes; the nodes are local optima, and the edges are search transitions between them. Many metrics computed on LONs have been proposed and shown to be linked to metaheuristic search difficulty. These have typically considered LONs as describing static structures. In contrast to this, Laplacian dynamics (LD) is an approach to consider the information flow across a network as a dynamical process. We adapt and apply LD to the context of LONs. As a testbed, we consider instances from the quadratic assignment problem (QAP) library. Metrics related to LD are proposed and these are compared with existing LON metrics. The results show that certain LD metrics are strong predictors of metaheuristic performance for iterated local search and tabu search.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (29)
  1. G. Ochoa, M. Tomassini, S. Vérel, and C. Darabos, “A study of NK landscapes’ basins and local optima networks,” in Proc. Conference on Genetic and Evolutionary Computation, 2008, pp. 555–562.
  2. S. Verel, G. Ochoa, and M. Tomassini, “Local optima networks of NK landscapes with neutrality,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 6, pp. 783–797, 2010.
  3. G. Ochoa, N. Veerapen, F. Daolio, and M. Tomassini, “Understanding phase transitions with local optima networks: number partitioning as a case study,” in Evolutionary Computation in Combinatorial Optimization, (EVOCOP).   Springer, 2017, pp. 233–248.
  4. G. Ochoa, S. Verel, F. Daolio, and M. Tomassini, “Local optima networks: A new model of combinatorial fitness landscapes,” in Recent Advances in the Theory and Application of Fitness Landscapes, H. Richter and A. P. Engelbrecht, Eds.   Berlin, Heidelberg: Springer, 2014, pp. 233–262.
  5. M. Tomassini, “A local optima network view of real function fitness landscapes,” Entropy, vol. 24, no. 5, p. 703, 2022.
  6. P. Mitchell, G. Ochoa, and R. Chassagne, “Local optima networks of the black box optimisation benchmark functions,” in Proc. Companion Genetic and Evolutionary Computation Conference, 2023, pp. 2072–2080.
  7. G. Ochoa, N. Veerapen, F. Daolio, and M. Tomassini, “Understanding phase transitions with local optima networks: Number partitioning as a case study,” in Evolutionary Computation in Combinatorial Optimization, (EVOCOP).   Springer, 2017, pp. 233–248.
  8. G. Ochoa, F. Chicano, and M. Tomassini, “Global landscape structure and the random MAX-SAT phase transition,” in International Conference on Parallel Problem Solving from Nature.   Springer, 2020, pp. 125–138.
  9. W. Mostert, K. M. Malan, G. Ochoa, and A. P. Engelbrecht, “Insights into the feature selection problem using local optima networks,” in Evolutionary Computation in Combinatorial Optimization, (EVOCOP).   Springer, 2019, pp. 147–162.
  10. C. W. Cleghorn and G. Ochoa, “Understanding parameter spaces using local optima networks: a case study on particle swarm optimization,” in Proc. Companion Genetic and Evolutionary Computation Conference, 2021, pp. 1657–1664.
  11. S. L. Thomson, G. Ochoa, F. Daolio, and N. Veerapen, “The effect of landscape funnels in QAPLIB instances,” in Proc. Companion Genetic and Evolutionary Computation Conference, 2017, pp. 1495–1500.
  12. S. L. Thomson, N. Veerapen, G. Ochoa, and D. van den Berg, “Randomness in local optima network sampling,” in Proc. Genetic and Evolutionary Computation Conference Companion, 2023, pp. 2099–2107.
  13. G. Ochoa, S. Verel, F. Daolio, and M. Tomassini, “Clustering of local optima in combinatorial fitness landscapes,” in International Conference on Learning and Intelligent Optimization.   Springer, 2011, pp. 454–457.
  14. S. L. Thomson, F. Daolio, and G. Ochoa, “Comparing communities of optima with funnels in combinatorial fitness landscapes,” in Proc. Genetic and Evolutionary Computation Conference, 2017, pp. 377–384.
  15. S. Herrmann, G. Ochoa, and F. Rothlauf, “Communities of local optima as funnels in fitness landscapes,” in Proc. Genetic and Evolutionary Computation Conference 2016, 2016, pp. 325–331.
  16. S. L. Thomson and G. Ochoa, “On funnel depths and acceptance criteria in stochastic local search,” in Proc. Genetic and Evolutionary Computation Conference, 2022, pp. 287–295.
  17. S. L. Thomson, G. Ochoa, and S. Verel, “Fractal dimension and perturbation strength: A local optima networks view,” in International Conference on Parallel Problem Solving from Nature.   Springer, 2022, pp. 562–574.
  18. F. Chicano, G. Ochoa, B. Derbel, and L. Canonne, “Local optima markov chain: A new tool for landscape-aware analysis of algorithm dynamics,” in Proc. Genetic and Evolutionary Computation Conference, 2023, pp. 284–292.
  19. S. Herrmann and F. Rothlauf, “Predicting heuristic search performance with pagerank centrality in local optima networks,” in Proc. Conference on Genetic and Evolutionary Computation, 2015, pp. 401–408.
  20. S. Herrmann, G. Ochoa, and F. Rothlauf, “Pagerank centrality for performance prediction: the impact of the local optima network model,” J. Heuristics, vol. 24, pp. 243–264, 2018.
  21. T. C. Koopmans and M. Beckmann, “Assignment problems and the location of economic activities,” Econometrica, pp. 53–76, 1957.
  22. R. E. Burkard, S. E. Karisch, and F. Rendl, “QAPLIB – a quadratic assignment problem library,” J. Global Optim., vol. 10, no. 4, pp. 391–403, 1997.
  23. E. Taillard, “Comparison of iterative searches for the quadratic assignment problem,” Location Science, vol. 3, no. 2, pp. 87–105, 1995.
  24. T. Stützle, “Iterated local search for the quadratic assignment problem,” Eur. J. Oper. Res., vol. 174, no. 3, pp. 1519–1539, 2006.
  25. J. J. P. Veerman and E. Kummel, “Diffusion and consensus on weakly connected directed graphs,” Linear Algebra Appl., vol. 578, pp. 184–206, 2019.
  26. N. Masuda and H. Kori, “Dynamics-based centrality for directed networks,” Phys. Rev. E, vol. 82.5, p. 056107, 2010.
  27. B. B. Mandelbrot, A. J. Fisher, and L. E. Calvet, “A multifractal model of asset returns,” Cowles Foundation Discussion Papers, 1412, 1997.
  28. É. Taillard, “Robust taboo search for the quadratic assignment problem,” Parallel Computing, vol. 17, no. 4-5, pp. 443–455, 1991.
  29. F. E. Harrell Jr, K. L. Lee, R. M. Califf, D. B. Pryor, and R. A. Rosati, “Regression modelling strategies for improved prognostic prediction,” Stat. Medicine, vol. 3, no. 2, pp. 143–152, 1984.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets