Papers
Topics
Authors
Recent
2000 character limit reached

Bayesian Inverse Transfer in Evolutionary Multiobjective Optimization (2312.14713v4)

Published 22 Dec 2023 in cs.NE

Abstract: Transfer optimization enables data-efficient optimization of a target task by leveraging experiential priors from related source tasks. This is especially useful in multiobjective optimization settings where a set of trade-off solutions is sought under tight evaluation budgets. In this paper, we introduce a novel concept of \textit{inverse transfer} in multiobjective optimization. Inverse transfer stands out by employing Bayesian inverse Gaussian process models to map performance vectors in the objective space to population search distributions in task-specific decision space, facilitating knowledge transfer through objective space unification. Building upon this idea, we introduce the first Inverse Transfer Evolutionary Multiobjective Optimizer (invTrEMO). A key highlight of invTrEMO is its ability to harness the common objective functions prevalent in many application areas, even when decision spaces do not precisely align between tasks. This allows invTrEMO to uniquely and effectively utilize information from heterogeneous source tasks as well. Furthermore, invTrEMO yields high-precision inverse models as a significant byproduct, enabling the generation of tailored solutions on-demand based on user preferences. Empirical studies on multi- and many-objective benchmark problems, as well as a practical case study, showcase the faster convergence rate and modelling accuracy of the invTrEMO relative to state-of-the-art evolutionary and Bayesian optimization algorithms. The source code of the invTrEMO is made available at https://github.com/LiuJ-2023/invTrEMO.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (77)
  1. Kernels for vector-valued functions: A review. Foundations and Trends® in Machine Learning 4, 3 (2012), 195–266.
  2. Genetic programming with knowledge transfer and guided search for uncertain capacitated arc routing problem. IEEE Transactions on Evolutionary Computation 26, 4 (2021), 765–779.
  3. Knowledge transfer genetic programming with auxiliary population for solving uncertain capacitated arc routing problem. IEEE Transactions on Evolutionary Computation 27, 2 (2022), 311–325.
  4. Transfer Learning for Bayesian Optimization: A Survey. arXiv preprint arXiv:2302.05927 (2023).
  5. BoTorch: A framework for efficient Monte-Carlo Bayesian optimization. Advances in neural information processing systems 33 (2020), 21524–21538.
  6. Linearized domain adaptation in evolutionary multitasking. In 2017 IEEE Congress on evolutionary computation (CEC). IEEE, 1295–1302.
  7. Mickael Binois and Nathan Wycoff. 2022. A survey on high-dimensional Gaussian process modeling with application to Bayesian optimization. ACM Transactions on Evolutionary Learning and Optimization 2, 2 (2022), 1–26.
  8. J. Blank and K. Deb. 2020. pymoo: Multi-Objective Optimization in Python. IEEE Access 8 (2020), 89497–89509.
  9. Generating Well-Spaced Points on a Unit Simplex for Evolutionary Many-Objective Optimization. IEEE Transactions on Evolutionary Computation (In press).
  10. Multi-task Gaussian process prediction. Advances in Neural Information Processing Systems 20 (2007).
  11. Jürgen Branke. 2008. Multiobjective optimization: Interactive and evolutionary approaches. Vol. 5252. Springer Science & Business Media.
  12. Adaptive transfer learning. In proceedings of the AAAI Conference on Artificial Intelligence, Vol. 24. 407–412.
  13. A multiobjective evolutionary algorithm using Gaussian process-based inverse modeling. IEEE Transactions on Evolutionary Computation 19, 6 (2015), 838–856.
  14. A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization. IEEE Transactions on Evolutionary Computation 22, 1 (2018), 129–142. https://doi.org/10.1109/TEVC.2016.2622301
  15. Carlos A Coello Coello. 2002. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Computer methods in applied mechanics and engineering 191, 11-12 (2002), 1245–1287.
  16. Carlos A Coello Coello. 2007. Evolutionary algorithms for solving multi-objective problems. Springer.
  17. Curbing negative influences online for seamless transfer evolutionary optimization. IEEE Transactions on Cybernetics 49, 12 (2018), 4365–4378.
  18. Parallel bayesian optimization of multiple noisy objectives with expected hypervolume improvement. Advances in Neural Information Processing Systems 34 (2021), 2187–2200.
  19. Greed is good: Exploration and exploitation trade-offs in Bayesian optimisation. ACM Transactions on Evolutionary Learning and Optimization 1, 1 (2021), 1–22.
  20. Kalyanmoy Deb. 2011. Multi-objective optimisation using evolutionary algorithms: an introduction. Springer.
  21. Learning to Predict Pareto-Optimal Solutions from Pseudo-weights. In International Conference on Evolutionary Multi-Criterion Optimization. Springer, 191–204.
  22. Kalyanmoy Deb and Himanshu Jain. 2013. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE transactions on evolutionary computation 18, 4 (2013), 577–601.
  23. Scalable test problems for evolutionary multiobjective optimization. In Evolutionary Multiobjective Optimization. Springer, 105–145.
  24. Matthias Ehrgott. 2005. Multicriteria optimization. Vol. 491. Springer Science & Business Media.
  25. Surrogate assisted evolutionary algorithm based on transfer learning for dynamic expensive multi-objective optimisation problems. In 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, 1–8.
  26. Autoencoding evolutionary search with learning across heterogeneous problems. IEEE Transactions on Evolutionary Computation 21, 5 (2017), 760–772.
  27. Learning transferable variation operators in a continuous genetic algorithm. In 2019 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, 2027–2033.
  28. Improving sampling in evolution strategies through mixture-based distributions built from past problem instances. In Parallel Problem Solving from Nature–PPSN XVI: 16th International Conference, PPSN 2020, Leiden, The Netherlands, September 5-9, 2020, Proceedings, Part I 16. Springer, 583–596.
  29. Representing experience in continuous evolutionary optimisation through problem-tailored search operators. In 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, 1–7.
  30. GPyTorch: Blackbox matrix-matrix gaussian process inference with GPU acceleration. Advances in Neural Information Processing Systems 31 (2018).
  31. Ioannis Giagkiozis and Peter J Fleming. 2014. Pareto front estimation for decision making. Evolutionary computation 22, 4 (2014), 651–678.
  32. A knowledge guided transfer strategy for evolutionary dynamic multiobjective optimization. IEEE Transactions on Evolutionary Computation (2022).
  33. Tightening Regret Bounds for Scalable Transfer Optimization with Gaussian Process Surrogates. In 2022 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, 1669–1674.
  34. Insights on transfer optimization: Because experience is the best teacher. IEEE Transactions on Emerging Topics in Computational Intelligence 2, 1 (2017), 51–64.
  35. The Blessing of Dimensionality in Many-Objective Search: An Inverse Machine Learning Insight. In 2019 IEEE International Conference on Big Data (Big Data). 3896–3902. https://doi.org/10.1109/BigData47090.2019.9005525
  36. Performance of decomposition-based many-objective algorithms strongly depends on Pareto front shapes. IEEE Transactions on Evolutionary Computation 21, 2 (2016), 169–190.
  37. Benefiting From Single-Objective Feature Selection to Multiobjective Feature Selection: A Multiform Approach. IEEE Transactions on Cybernetics (2022).
  38. J. Knowles. 2006. ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Transactions on Evolutionary Computation 10, 1 (2006), 50–66. https://doi.org/10.1109/TEVC.2005.851274
  39. Evolutionary Multi-Objective Bayesian Optimization Based on Multisource Online Transfer Learning. IEEE Transactions on Emerging Topics in Computational Intelligence (2023).
  40. Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions. Journal of Cleaner Production 181 (2018), 584–598.
  41. A data-driven evolutionary transfer optimization for expensive problems in dynamic environments. IEEE Transactions on Evolutionary Computation (2023).
  42. Multiobjective optimization for crash safety design of vehicles using stepwise regression model. Structural and multidisciplinary optimization 35 (2008), 561–569.
  43. Non-linear domain adaptation in transfer evolutionary optimization. Cognitive Computation 13 (2021), 290–307.
  44. Solution representation learning in multi-objective transfer evolutionary optimization. IEEE Access 9 (2021), 41844–41860.
  45. AMTEA-Based Multi-task Optimisation for Multi-objective Feature Selection in Classification. In International Conference on the Applications of Evolutionary Computation (Part of EvoStar). Springer, 623–639.
  46. Pareto set learning for expensive multi-objective optimization. Advances in Neural Information Processing Systems 35 (2022), 19231–19247.
  47. Lightweight design of carbon twill weave fabric composite body structure for electric vehicle. Composite Structures 97 (2013), 231–238.
  48. Sushil J Louis and John McDonnell. 2004. Learning with case-injected genetic algorithms. IEEE Transactions on Evolutionary Computation 8, 4 (2004), 316–328.
  49. Expensive Multiobjective Optimization Based on Information Transfer Surrogate. IEEE Transactions on Systems, Man, and Cybernetics: Systems (2022).
  50. A self-driving laboratory advances the Pareto front for material properties. Nature Communications 13, 1 (2022), 995.
  51. Generalizing transfer bayesian optimization to source-target heterogeneity. IEEE Transactions on Automation Science and Engineering 18, 4 (2020), 1754–1765.
  52. Multiproblem Surrogates: Transfer Evolutionary Multiobjective Optimization of Computationally Expensive Problems. IEEE Transactions on Evolutionary Computation 23, 1 (2019), 15–28. https://doi.org/10.1109/TEVC.2017.2783441
  53. A decade survey of transfer learning (2010–2020). IEEE Transactions on Artificial Intelligence 1, 2 (2020), 151–166.
  54. Evolutionary multitask optimization: a methodological overview, challenges, and future research directions. Cognitive Computation 14, 3 (2022), 927–954.
  55. Andrzej Osyczka. 1978. An approach to multicriterion optimization problems for engineering design. Computer Methods in Applied Mechanics and Engineering 15, 3 (1978), 309–333.
  56. A Classification-Based Surrogate-Assisted Evolutionary Algorithm for Expensive Many-Objective Optimization. IEEE Transactions on Evolutionary Computation 23, 1 (2019), 74–88. https://doi.org/10.1109/TEVC.2018.2802784
  57. Adham Salih and Amiram Moshaiov. 2022. Promoting Transfer of Robot Neuro-Motion-Controllers by Many-Objective Topology and Weight Evolution. IEEE Transactions on Evolutionary Computation 27, 2 (2022), 385–395.
  58. Eric O Scott and Kenneth A De Jong. 2023. First Complexity Results for Evolutionary Knowledge Transfer. In Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. 140–151.
  59. Scalable Transfer Evolutionary Optimization: Coping With Big Task Instances. IEEE Transactions on Cybernetics (2022).
  60. Approximation methods in multidisciplinary analysis and optimization: a panel discussion. Structural and multidisciplinary optimization 27 (2004), 302–313.
  61. Emilio Singh and Nelishia Pillay. 2022. A Study of Transfer Learning in an Ant-Based Generation Construction Hyper-Heuristic. In 2022 IEEE Congress on Evolutionary Computation (CEC). IEEE, 1–7.
  62. Information-theoretic regret bounds for Gaussian process optimization in the bandit setting. IEEE Transactions on Information Theory 58, 5 (2012), 3250–3265.
  63. Lightweight hybrid materials and structures for energy absorption: A state-of-the-art review and outlook. Thin-Walled Structures 172 (2022), 108760.
  64. Anirudh Suresh and Kalyanmoy Deb. 2023. Machine Learning Based Prediction of New Pareto-Optimal Solutions From Pseudo-Weights. IEEE Transactions on Evolutionary Computation (2023).
  65. Multi-task bayesian optimization. Advances in neural information processing systems 26 (2013).
  66. Pareto optimization with small data by learning across common objective spaces. Scientific Reports 13, 1 (2023), 7842.
  67. Evolutionary transfer optimization-a new frontier in evolutionary computation research. IEEE Computational Intelligence Magazine 16, 1 (2021), 22–33.
  68. PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective Optimization. IEEE Computational Intelligence Magazine 12, 4 (2017), 73–87. https://doi.org/10.1109/MCI.2017.2742868
  69. Transfer learning with gaussian processes for bayesian optimization. In International Conference on Artificial Intelligence and Statistics. PMLR, 6152–6181.
  70. Multi-objective approaches to portfolio optimization with market impact costs. Memetic Computing 14, 4 (2022), 411–421.
  71. Uncluttered domain sub-similarity modeling for transfer regression. In 2018 IEEE International Conference on Data Mining (ICDM). IEEE, 1314–1319.
  72. Scalable gaussian process-based transfer surrogates for hyperparameter optimization. Machine Learning 107, 1 (2018), 43–78.
  73. Affine transformation-enhanced multifactorial optimization for heterogeneous problems. IEEE Transactions on Cybernetics 52, 7 (2020), 6217–6231.
  74. Piggybacking on past problem for faster optimization in aluminum electrolysis process design. Engineering Applications of Artificial Intelligence 126 (2023), 106937.
  75. Qingfu Zhang and Hui Li. 2007. MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on evolutionary computation 11, 6 (2007), 712–731.
  76. Expensive Multiobjective Optimization by MOEA/D With Gaussian Process Model. IEEE Transactions on Evolutionary Computation 14, 3 (2010), 456–474. https://doi.org/10.1109/TEVC.2009.2033671
  77. Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Transactions on Mathematical Software (TOMS) 23, 4 (1997), 550–560.

Summary

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up
Github Logo Streamline Icon: https://streamlinehq.com

GitHub

  1. GitHub - LiuJ-2023/invTrEMO (1 star)