{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T01:54:28Z","timestamp":1770342868482,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T00:00:00Z","timestamp":1680652800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T00:00:00Z","timestamp":1680652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005721","name":"Universit\u00e4t Bielefeld","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005721","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In many real-world applications of interest, several related optimization tasks can be encountered, where each task is associated with a specific context or personalized information. Moreover, the amount of available data for each task may be highly limited due to the expensive cost involved. Although Bayesian optimization (BO) has emerged as a promising paradigm for handling black-box optimization problems, addressing such a sequence of optimization tasks can be intractable due to the cold start issues in BO. The key challenge is to speed up the optimization by leveraging the transferable information, while taking the personalization into consideration. In this paper, optimization problems with personalized variables are formally defined at first. Subsequently, a personalized evolutionary Bayesian algorithm is proposed to consider the personalized information and the measurement noise. Specifically, a contextual Gaussian process is used to jointly learn a surrogate model in different contexts with regard to the varying personalized parameter, and an evolutionary algorithm is tailored for optimizing an acquisition function for handling the presence of personalized information. Finally, we demonstrate the effectiveness of the proposed algorithm by testing it on widely used single- and multi-objective benchmark problems with personalized variables.<\/jats:p>","DOI":"10.1007\/s40747-023-01020-8","type":"journal-article","created":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T10:25:07Z","timestamp":1680690307000},"page":"5745-5760","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Personalized Bayesian optimization for noisy problems"],"prefix":"10.1007","volume":"9","author":[{"given":"Xilu","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1100-0631","authenticated-orcid":false,"given":"Yaochu","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,5]]},"reference":[{"key":"1020_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.3389\/fnhum.2013.00317","volume":"7","author":"A Antal","year":"2013","unstructured":"Antal A, Paulus W (2013) Transcranial alternating current stimulation (tACS). Front Hum Neurosci 7:317","journal-title":"Front Hum Neurosci"},{"issue":"5","key":"1020_CR2","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng R, Jin Y, Olhofer M, Sendhoff B (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(5):773\u2013791","journal-title":"IEEE Trans Evol Comput"},{"key":"1020_CR3","unstructured":"Dipankar D, Zbigniew M (2013) Evolutionary algorithms in engineering applications. Springer Science & Business Media"},{"issue":"2","key":"1020_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1162\/106365601750190406","volume":"9","author":"K Deb","year":"2001","unstructured":"Deb K, Beyer H-G (2001) Self-adaptive genetic algorithms with simulated binary crossover. Evol Comput 9(2):197\u2013221","journal-title":"Evol Comput"},{"issue":"1","key":"1020_CR5","first-page":"1","volume":"4","author":"Kalyanmoy Deb","year":"2014","unstructured":"Deb Kalyanmoy, Deb Debayan et al (2014) Analysing mutation schemes for real-parameter genetic algorithms. Int J Artif Intell Soft Comput 4(1):1\u201328","journal-title":"Int J Artif Intell Soft Comput"},{"key":"1020_CR6","doi-asserted-by":"crossref","unstructured":"Deb Kalyanmoy, Thiele Lothar, Laumanns Marco, Zitzler Eckart (2002) Scalable multi-objective optimization test problems. In Proceedings of the 2002 Congress on Evolutionary Computation. CEC\u201902 (Cat. No. 02TH8600), volume\u00a01, pages 825\u2013830. IEEE","DOI":"10.1109\/CEC.2002.1007032"},{"issue":"1","key":"1020_CR7","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/TBME.2014.2351376","volume":"62","author":"D\u00fcrichen Robert","year":"2014","unstructured":"Robert D\u00fcrichen, Pimentel Marco AF, Lei Clifton, Achim Schweikard, Clifton David A (2014) Multitask Gaussian processes for multivariate physiological time-series analysis. IEEE Trans Biomed Eng 62(1):314\u2013322","journal-title":"IEEE Trans Biomed Eng"},{"issue":"4","key":"1020_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1109\/TEVC.2005.859463","volume":"10","author":"TM Emmerich Michael","year":"2006","unstructured":"Emmerich Michael TM, Giannakoglou Kyriakos C, Boris Naujoks (2006) Single-and multiobjective evolutionary optimization assisted by gaussian random field metamodels. IEEE Trans Evol Comput 10(4):421\u2013439","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1020_CR9","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1137\/130949555","volume":"2","author":"David Ginsbourger","year":"2014","unstructured":"Ginsbourger David, Baccou Jean, Chevalier Cl\u00e9ment, Perales Fr\u00e9d\u00e9ric, Garland Nicolas, Monerie Yann (2014) Bayesian adaptive reconstruction of profile optima and optimizers. SIAM\/ASA J Uncertainty Quantification 2(1):490\u2013510","journal-title":"SIAM\/ASA J Uncertainty Quantification"},{"issue":"3","key":"1020_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s10898-005-2454-3","volume":"34","author":"Huang Deng","year":"2006","unstructured":"Deng Huang, Allen Theodore T, Notz William I, Ning Zeng (2006) Global optimization of stochastic black-box systems via sequential Kriging meta-models. J Global Opt 34(3):441\u2013466","journal-title":"J Global Opt"},{"issue":"4","key":"1020_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"R Jones Donald","year":"1998","unstructured":"Jones Donald R, Matthias Schonlau, Welch William J (1998) Efficient global optimization of expensive black-box functions. J Global Opt 13(4):455\u2013492","journal-title":"J Global Opt"},{"key":"1020_CR12","unstructured":"Krause Andreas, Ong Cheng Soon (2011) Contextual Gaussian process bandit optimization. In Nips, pages 2447\u20132455"},{"issue":"1","key":"1020_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/00401706.2000.10485979","volume":"42","author":"D McKay Michael","year":"2000","unstructured":"McKay Michael D, Beckman Richard J, Conover William J (2000) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 42(1):55\u201361","journal-title":"Technometrics"},{"key":"1020_CR14","doi-asserted-by":"crossref","unstructured":"Mo\u010dkus Jonas (1975) On Bayesian methods for seeking the extremum. In Optimization Techniques IFIP Technical Conference, pages 400\u2013404. Springer","DOI":"10.1007\/978-3-662-38527-2_55"},{"issue":"3","key":"1020_CR15","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s00158-013-0919-4","volume":"48","author":"Victor Picheny","year":"2013","unstructured":"Picheny Victor, Wagner Tobias, Ginsbourger David (2013) A benchmark of Kriging-based infill criteria for noisy optimization. Struct Multidisciplinary Opt 48(3):607\u2013626","journal-title":"Struct Multidisciplinary Opt"},{"key":"1020_CR16","doi-asserted-by":"crossref","unstructured":"Rasmussen Carl Edward (2003) Gaussian processes in machine learning. In Summer school on Machine Learning, pages 63\u201371. Springer","DOI":"10.1007\/978-3-540-28650-9_4"},{"key":"1020_CR17","doi-asserted-by":"crossref","unstructured":"Bobak Shahriari, Kevin Swersky, Ziyu Wang, Adams Ryan P, Nando De Freitas (2015) Taking the human out of the loop: a review of Bayesian optimization. Proc IEEE 104(1):148\u2013175","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"1020_CR18","unstructured":"Snoek Jasper, Larochelle Hugo, Adams Ryan P (2012) Practical Bayesian optimization of machine learning algorithms. Advances in neural information processing systems, 25"},{"key":"1020_CR19","unstructured":"Srinivas Niranjan, Krause Andreas, Kakade Sham M, Seeger Matthias (2010) Gaussian process optimization in the bandit setting: No regret and experimental design. pages 1015\u20131022"},{"key":"1020_CR20","unstructured":"Swersky Kevin, Snoek Jasper, Adams Ryan P (2013) Multi-task Bayesian optimization. Advances in neural information processing systems, 26"},{"issue":"4","key":"1020_CR21","first-page":"1","volume":"65","author":"Tran Anh","year":"2022","unstructured":"Anh Tran, Mike Eldred, Tim Wildey, Scott McCann, Jing Sun, Visintainer Robert J (2022) aphBO-2GP-3B: a budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture. Struct Multidisciplinary Opt 65(4):1\u201345","journal-title":"Struct Multidisciplinary Opt"},{"issue":"1","key":"1020_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","volume":"10","author":"Lyndon While","year":"2006","unstructured":"While Lyndon, Hingston Philip, Barone Luigi, Huband Simon (2006) A faster algorithm for calculating hypervolume. IEEE Trans Evol Comput 10(1):29\u201338","journal-title":"IEEE Trans Evol Comput"},{"key":"1020_CR23","unstructured":"Wilcoxon Frank, Katti SK, Wilcox Roberta A (1963) Critical values and probability levels for the Wilcoxon rank sum test and the Wilcoxon signed rank test, volume\u00a01. American Cyanamid Pearl River (NY)"},{"key":"1020_CR24","unstructured":"Williams Chris, Bonilla Edwin V, Chai Kian M (2007) Multi-task Gaussian process prediction. Advances in Neural Information Processing Systems, pages 153\u2013160"},{"issue":"3","key":"1020_CR25","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1109\/TEVC.2009.2033671","volume":"14","author":"Qingfu Zhang","year":"2009","unstructured":"Zhang Qingfu, Liu Wudong, Tsang Edward, Virginas Botond (2009) Expensive multiobjective optimization by MOEA\/D with Gaussian process model. IEEE Trans Evol Comput 14(3):456\u2013474","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01020-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01020-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01020-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T19:05:38Z","timestamp":1729191938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01020-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,5]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1020"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01020-8","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,5]]},"assertion":[{"value":"2 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that there are no financial and personal relationships with other people or organizations that could inappropriately influence (bias) our work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}