{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:28:27Z","timestamp":1648974507517},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T00:00:00Z","timestamp":1605052800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T00:00:00Z","timestamp":1605052800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s42979-020-00385-8","type":"journal-article","created":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T14:03:08Z","timestamp":1605103388000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Sequential Random Embedding Bayesian Optimization"],"prefix":"10.1007","volume":"2","author":[{"given":"Noriko","family":"Yokoyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Kohjima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsushi","family":"Matsubayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Toda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,11]]},"reference":[{"key":"385_CR1","unstructured":"Snoek J, Larochelle H, Adams RP. Practical Bayesian optimization of machine learning algorithms. In: Advances in Neural Information Processing Systems (NIPS), 2012. Curran Associates Inc. pp. 2951\u20132959."},{"key":"385_CR2","doi-asserted-by":"crossref","unstructured":"Kiyotake H, Kohjima M, Matsubayashi T, Toda H. Multi Agent Flow Estimation Based on Bayesian Optimization with Time Delay and Low Dimensional Parameter Conversion. In: Principles and Practice of Multi-Agent Systems (PRIMA), 2018. pp. 53\u201369.","DOI":"10.1007\/978-3-030-03098-8_4"},{"key":"385_CR3","unstructured":"Brochu E, Cora VM, de Freitas N. A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning 2010. http:\/\/arXiv.org\/abs\/1012.2599"},{"issue":"4","key":"385_CR4","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"D Jones","year":"1998","unstructured":"Jones D, Schonlau M, Welch W. Efficient global optimization of expensive black-box functions. J Glob Optimiz. 1998;13(4):455\u201392.","journal-title":"J Glob Optimiz"},{"key":"385_CR5","volume-title":"Gaussian process for machine learning","author":"CE Rasmussen","year":"2006","unstructured":"Rasmussen CE, Williams CK. Gaussian process for machine learning. Cambridge: MIT Press; 2006."},{"key":"385_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1613\/jair.4806","volume":"55","author":"Z Wang","year":"2016","unstructured":"Wang Z, Hutter F, Zoghi M, Matheson D, de Freitas N. Bayesian optimization in a billion dimensions via random embeddings. JAIR. 2016;55:361\u201387.","journal-title":"JAIR."},{"key":"385_CR7","doi-asserted-by":"crossref","unstructured":"Yokoyama N, Kohjima M, Matsubayashi T, Toda H. Efficient Bayesian optimization based on parallel sequential random embeddings. In: Asian Conference on Pattern Recognition (ACPR), 2019. pp. 453\u2013466.","DOI":"10.1007\/978-3-030-41404-7_32"},{"key":"385_CR8","unstructured":"Kandasamy K, Krishnamurthy A, Schneider J, Poczos B. Parallelised bayesian optimisation via thompson sampling. In: Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics (AISTATS), vol. 84, 2018. pp. 133\u2013142. PMLR."},{"key":"385_CR9","unstructured":"Kandasamy K, Schneider J, Poczos B. High dimensional bayesian optimisation and bandits via additive models. In: Proceedings of the 32nd International Conference on Machine Learning (ICML), vol. 37, 2015. pp. 295\u2013304."},{"key":"385_CR10","unstructured":"Rolland P, Scarlett J, Bogunovic I, Cevher V. High dimensional Bayesian optimization via additive models with overlapping groups. In: International Conference on Artificial Intelligence and Statistics (AISTATS), 2018. pp. 298\u2013307."},{"key":"385_CR11","unstructured":"Qian H, Hu Y, Yu Y. Derivative-free optimization of high-dimensional non-convex functions by sequential random embeddings. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI), 2016. AAAI Press, New York. pp. 1946\u20131952."},{"key":"385_CR12","first-page":"2879","volume":"12","author":"AD Bull","year":"2011","unstructured":"Bull AD. Convergence rates of efficient global optimization algorithms. J Mach Learn Res. 2011;12:2879\u2013904.","journal-title":"J Mach Learn Res."},{"issue":"11","key":"385_CR13","doi-asserted-by":"publisher","first-page":"3088","DOI":"10.1016\/j.jspi.2010.04.018","volume":"140","author":"E Vazquez","year":"2010","unstructured":"Vazquez E, Bect J. Convergence properties of the expected improvement algorithm with fixed mean and covariance functions. J Stat Plan Inference. 2010;140(11):3088\u201395.","journal-title":"J Stat Plan Inference"},{"key":"385_CR14","volume-title":"Bayesian approach to global optimization: theory and applications","author":"J Mockus","year":"2012","unstructured":"Mockus J. Bayesian approach to global optimization: theory and applications, vol. 37. Berlin: Springer Science & Business Media; 2012."},{"key":"385_CR15","volume-title":"Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L. Handbook of genetic algorithms. New York: Van Nostrand Reinhold; 1991."},{"issue":"1","key":"385_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N Hansen","year":"2003","unstructured":"Hansen N, Muller SD, Koumoutsakos P. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evolut Comput. 2003;11(1):1\u201318.","journal-title":"Evolut Comput"},{"key":"385_CR17","doi-asserted-by":"crossref","unstructured":"Hansen N, Auger A, Ros R, Finck S, Posik P. Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009. In: Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO), 2010. ACM, New York. pp. 1689\u20131696.","DOI":"10.1145\/1830761.1830790"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00385-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42979-020-00385-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00385-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T20:53:27Z","timestamp":1612904007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42979-020-00385-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,11]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["385"],"URL":"https:\/\/doi.org\/10.1007\/s42979-020-00385-8","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,11]]},"assertion":[{"value":"31 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"3"}}