{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T13:06:37Z","timestamp":1755695197769,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T00:00:00Z","timestamp":1656547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2022,6,30]]},"abstract":"<jats:p>\n            PARyOpt\n            <jats:xref ref-type=\"fn\">\n              <jats:sup>1<\/jats:sup>\n            <\/jats:xref>\n            is a Python based implementation of the Bayesian optimization routine designed for remote and asynchronous function evaluations. Bayesian optimization is especially attractive for computational optimization due to its\n            <jats:italic>low cost function footprint<\/jats:italic>\n            as well as the ability to account for uncertainties in data. A key challenge to efficiently deploy any optimization strategy on distributed computing systems is the synchronization step, where data from multiple function calls is assimilated to identify the next campaign of function calls. Bayesian optimization provides an elegant approach to overcome this issue via asynchronous updates. We formulate, develop and implement a parallel, asynchronous variant of Bayesian optimization. The framework is robust and resilient to external failures. We show how such asynchronous evaluations help reduce the total optimization wall clock time for a suite of test problems. Additionally, we show how the software design of the framework allows easy extension to response surface reconstruction (Kriging), providing a high performance software for autonomous exploration. The software is available on PyPI, with examples and documentation.\n          <\/jats:p>","DOI":"10.1145\/3529517","type":"journal-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T13:50:20Z","timestamp":1658238620000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithm\u00a01025: PARyOpt: A Software for\n            <u>P<\/u>\n            arallel\n            <u>A<\/u>\n            synchronous\n            <u>R<\/u>\n            emote Ba\n            <u>y<\/u>\n            esian\n            <u>Opt<\/u>\n            imization"],"prefix":"10.1145","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5816-0184","authenticated-orcid":false,"given":"Balaji Sesha Sarath","family":"Pokuri","sequence":"first","affiliation":[{"name":"Department of Mechanical Engineering, Iowa State University, Ames, Iowa, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9004-061X","authenticated-orcid":false,"given":"Alec","family":"Lofquist","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Iowa State University, Ames, Iowa, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9838-5233","authenticated-orcid":false,"given":"Chad","family":"Risko","sequence":"additional","affiliation":[{"name":"Department of Chemistry, University of Kentucky, Lexington, Kentucky, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8931-4852","authenticated-orcid":false,"given":"Baskar","family":"Ganapathysubramanian","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, Iowa State University, Ames, Iowa, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_13"},{"key":"e_1_3_3_3_2","unstructured":"E. Brochu V. M. Cora and N. De Freitas. 2010. A tutorial on Bayesian optimization of expensive cost functions with application to active user modeling and hierarchical reinforcement learning. (2010) 49 pages."},{"key":"e_1_3_3_4_2","first-page":"2879","article-title":"Convergence rates of efficient global optimization algorithms","volume":"12","author":"Bull Adam D.","year":"2011","unstructured":"Adam D. Bull. 2011. Convergence rates of efficient global optimization algorithms. Journal of Machine Learning Research 12(Oct.2011), 2879\u20132904.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129065704001899"},{"key":"e_1_3_3_6_2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-642-10701-6_6","volume-title":"Computational Intelligence in Expensive Optimization Problems","author":"Ginsbourger David","year":"2010","unstructured":"David Ginsbourger, Rodolphe Le Riche, and Laurent Carraro. 2010. Kriging is well-suited to parallelize optimization. In Computational Intelligence in Expensive Optimization Problems. Springer, 131\u2013162."},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_37"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"e_1_3_3_9_2","first-page":"133","volume-title":"Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research)","volume":"84","author":"Kandasamy Kirthevasan","year":"2018","unstructured":"Kirthevasan Kandasamy, Akshay Krishnamurthy, Jeff Schneider, and Barnabas Poczos. 2018. Parallelised Bayesian optimisation via Thompson sampling. In Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research), Amos Storkey and Fernando Perez-Cruz (Eds.), Vol. 84. PMLR, Playa Blanca, Lanzarote, Canary Islands, 133\u2013142. http:\/\/proceedings.mlr.press\/v84\/kandasamy18a.html."},{"key":"e_1_3_3_10_2","unstructured":"Aditya Kommajosula Daniel Stoecklein Dino Di Carlo and Baskar Ganapathysubramanian. 2019. Shape-design for stabilizing micro-particles in inertial microfluidic flows. (2019) 29 pages. https:\/\/arxiv.org\/pdf\/1902.05935.pdf."},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jcim.9b01113"},{"key":"e_1_3_3_12_2","first-page":"49","volume-title":"Proceedings of National Institute of Sciences","volume":"2","author":"Mahalanobis Prasanta Chandra","year":"1936","unstructured":"Prasanta Chandra Mahalanobis. 1936. On the generalized distance in statistics. In Proceedings of National Institute of Sciences, Vol. 2. National Institute of Science of India, 49\u201355."},{"key":"e_1_3_3_13_2","volume-title":"An Optimization and Uncertainty Quantification Framework for Patient-specific Cardiac modeling","author":"Mineroff Joshua","year":"2018","unstructured":"Joshua Mineroff. 2018. An Optimization and Uncertainty Quantification Framework for Patient-specific Cardiac modeling. Ph.D. Dissertation. Iowa State University."},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/11S010840"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.md.2018.06.002"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1002\/aenm.201701269"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.3182\/20130626-3-AU-2035.00027"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.040"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1080\/03052150211751"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"e_1_3_3_21_2","unstructured":"Jialei Wang Scott C. Clark Eric Liu and Peter I. Frazier. 2016. Parallel Bayesian Global Optimization of Expensive Functions. (2016). arxiv:1602.05149http:\/\/arxiv.org\/abs\/1602.05149."},{"key":"e_1_3_3_22_2","unstructured":"Ziyu Wang and Nando de Freitas. 2014. Theoretical Analysis of Bayesian Optimisation with Unknown Gaussian Process Hyper-Parameters. (2014). http:\/\/arxiv.org\/abs\/1406.7758."},{"key":"e_1_3_3_23_2","first-page":"29","article-title":"Scattered data approximation, volume 17 of Cambridge monographs on applied and computational mathematics","volume":"28","author":"Wendland Holger","year":"2005","unstructured":"Holger Wendland. 2005. Scattered data approximation, volume 17 of Cambridge monographs on applied and computational mathematics. Cambridge University Press, Cambridge 28 (2005), 29.","journal-title":"Cambridge University Press, Cambridge"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.commatsci.2011.12.012"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1002\/adfm.201503943"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529517","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3529517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:24Z","timestamp":1750183764000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,30]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6,30]]}},"alternative-id":["10.1145\/3529517"],"URL":"https:\/\/doi.org\/10.1145\/3529517","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"type":"print","value":"0098-3500"},{"type":"electronic","value":"1557-7295"}],"subject":[],"published":{"date-parts":[[2022,6,30]]},"assertion":[{"value":"2018-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}