Skip to main content

Enhancing Evolutionary Optimization Performance Under Byzantine Fault Conditions

  • Conference paper
  • First Online:
Hybrid Artificial Intelligent Systems (HAIS 2023)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 14001))

Included in the following conference series:

Abstract

We evaluate the performance of panmictic evolutionary algorithms (EAs) in Byzantine environments, where fitness values are unreliable due to the potential presence of malicious agents. We investigate the impact of this phenomenon on the performance of the algorithm considering two different models of malicious behavior of different severity, taking the unreliability rate of the environment as a control parameter. We observe how there can be a significant toll in the quality of the results as the prevalence of cheating behavior increases, even for simple functions. Subsequently, we endow the EA with mechanisms based on redundant computation to cope with this issue, and examine their effectiveness. Our findings indicate that while a mechanism based on statistical averaging can be an effective approach under a relatively benign fault model, more hostile environments are better tackled via an approach based on majority voting.

This work is supported by Spanish Ministry of Science and Innovation under project Bio4Res (PID2021-125184NB-I00 – http://bio4res.lcc.uma.es) and by Universidad de Málaga, Campus de Excelencia Internacional Andalucía Tech.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Camacho, D., et al.: From ephemeral computing to deep bioinspired algorithms: new trends and applications. Futur. Gener. Comput. Syst. 88, 735–746 (2018)

    Article  Google Scholar 

  2. Cantú-Paz, E.: Master-slave parallel genetic algorithms. In: Efficient and Accurate Parallel Genetic Algorithms. Genetic Algorithms and Evolutionary Computation, vol. 1, pp. 33–48. Springer, Boston (2001). https://doi.org/10.1007/978-1-4615-4369-5_3

  3. Cotta, C.: On the performance of evolutionary algorithms with unreliable fitness information. In: Mora, A.M. (ed.) EvoStar 2023 Late Breaking Abstracts. Czech Republic, Brno (2023)

    Google Scholar 

  4. Cotta, C.: Tackling adversarial faults in panmictic evolutionary algorithms. In: Genetic and Evolutionary Computation Conference Companion (GECCO 2023 Companion), p. 2. ACM Press, New York, NY (2023). In press

    Google Scholar 

  5. Cotta, C., Olague, G.: Resilient bioinspired algorithms: a computer system design perspective. In: Jiménez Laredo, J.L., Hidalgo, J.I., Babaagba, K.O. (eds.) EvoApplications 2022. LNCS, vol. 13224, pp. 619–631. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-02462-7_39

    Chapter  Google Scholar 

  6. Deb, K., Goldberg, D.: Analyzing deception in trap functions. In: Whitley, L. (ed.) Second Workshop on Foundations of Genetic Algorithms, pp. 93–108. Morgan Kaufmann Publishers, Vail (1993)

    Google Scholar 

  7. Vega, F.F.: Evolutionary algorithms: perspectives on the evolution of parallel models. In: Novais, P., Camacho, D., Analide, C., El Fallah Seghrouchni, A., Badica, C. (eds.) Intelligent Distributed Computing IX. SCI, vol. 616, pp. 13–22. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-25017-5_2

    Chapter  Google Scholar 

  8. Goldberg, D., Deb, K., Horn, J.: Massive multimodality, deception and genetic algorithms. In: Männer, R., Manderick, B. (eds.) Parallel Problem Solving from Nature - PPSN II, pp. 37–48. Elsevier Science Inc., New York (1992)

    Google Scholar 

  9. Jin, Y., Branke, J.: Evolutionary optimization in uncertain environments - a survey. IEEE Trans. Evol. Comput. 9(3), 303–317 (2005)

    Article  Google Scholar 

  10. Lavoie, E., Hendren, L.: Personal volunteer computing. In: Proceedings of the 16th ACM International Conference on Computing Frontiers, pp. 240–246. ACM, New York (2019)

    Google Scholar 

  11. Mengistu, T.M., Che, D.: Survey and taxonomy of volunteer computing. ACM Computing Surveys 52(3), 1–35 (2019)

    Article  Google Scholar 

  12. Muszynski, J.: Cheating-tolerance of parallel and distributed evolutionary algorithms in desktop grids and volunteer computing systems. Ph.D. thesis, University of Luxembourg (2015)

    Google Scholar 

  13. Muszyński, J., Varrette, S., Bouvry, P., Seredyński, F., Khan, S.U.: Convergence analysis of evolutionary algorithms in the presence of crash-faults and cheaters. Comput. Math. Appl. 64(12), 3805–3819 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  14. Muszyński, J., Varrette, S., Dorronsoro, B., Bouvry, P.: Distributed cellular evolutionary algorithms in a byzantine environment. In: 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, pp. 307–313. IEEE Press, Hyderabad, India (2015)

    Google Scholar 

  15. Nogueras, R., Cotta, C.: Self-healing strategies for memetic algorithms in unstable and ephemeral computational environments. Nat. Comput. 16(2), 189–200 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  16. Nogueras, R., Cotta, C.: Analyzing self-\(\star \) island-based memetic algorithms in heterogeneous unstable environments. Int. J. High Perform. Comput. Appl. 32(5), 676–692 (2018)

    Article  Google Scholar 

  17. Rakshit, P., Konar, A., Das, S.: Noisy evolutionary optimization algorithms - a comprehensive survey. Swarm Evol. Comput. 33, 18–45 (2017)

    Article  Google Scholar 

  18. Rudolph, G.: Convergence properties of evolutionary algorithms. Verlag Dr. Kovač (1997)

    Google Scholar 

  19. Sarmenta, L.F.: Sabotage-tolerance mechanisms for volunteer computing systems. Futur. Gener. Comput. Syst. 18(4), 561–572 (2002)

    Article  MATH  Google Scholar 

  20. Varrette, S., Tantar, E., Bouvry, P.: On the resilience of [distributed] EAs against cheaters in global computing platforms. In: 25th IEEE International Symposium on Parallel and Distributed Processing Workshop Proceedings, pp. 409–417. IEEE, Anchorage AK (2011)

    Google Scholar 

  21. Xiong, N., Molina, D., Ortiz, M.L., Herrera, F.: A walk into metaheuristics for engineering optimization: principles, methods and recent trends. Int. J. Comput. Intell. Syst. 8, 606–636 (2015)

    Article  Google Scholar 

Download references

Acknowledgments

The author thanks Daan van den Berg (VU Amsterdam) for interesting discussions arising from a previous work [3].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carlos Cotta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cotta, C. (2023). Enhancing Evolutionary Optimization Performance Under Byzantine Fault Conditions. In: García Bringas, P., et al. Hybrid Artificial Intelligent Systems. HAIS 2023. Lecture Notes in Computer Science(), vol 14001. Springer, Cham. https://doi.org/10.1007/978-3-031-40725-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-40725-3_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-40724-6

  • Online ISBN: 978-3-031-40725-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics