{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T15:07:09Z","timestamp":1779030429108,"version":"3.51.4"},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T00:00:00Z","timestamp":1778544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Cyber-Phys. Syst."],"published-print":{"date-parts":[[2026,7,31]]},"abstract":"<jats:p>\n                    Bayesian Optimization (BO) is a widely used technique for optimizing black-box functions, whose mathematical form is unknown and can only be evaluated through costly simulations. In this work, we focus on optimizing functions that are the\n                    <jats:inline-formula content-type=\"math\/tex\">\n                      <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(\\min\/\\max\\)<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    of several components, where each component is typically a non-linear, non-convex black-box function. Traditional BO approaches may suffer from the\n                    <jats:italic toggle=\"yes\">masking effect<\/jats:italic>\n                    , where components with lower mean values are sampled more, even if they do not contain the global optimum. In our prior work, Minimum Bayesian Optimization (\n                    <jats:sc>minBO<\/jats:sc>\n                    ) addressed this issue by proposing a sampling approach that uses a surrogate for each component and samples based on predicted improvement across all components. While effective,\n                    <jats:sc>minBO<\/jats:sc>\n                    treats each component independently and does not capture potential dependencies between components. Additionally, estimating surrogates for each component can limit the scalability of the approach. We introduce Conjunctive Bayesian Optimization (\n                    <jats:sc>conBO<\/jats:sc>\n                    ), a novel approach that overcomes these limitations. We propose a paired sampling algorithm (\n                    <jats:sc>conBO-PS<\/jats:sc>\n                    ) that considers dependencies between components by analyzing all pairs of functions and estimating the distribution of the minimum of two functions. While\n                    <jats:sc>conBO-PS<\/jats:sc>\n                    accounts for dependencies, it is computationally expensive. To improve efficiency, we introduce\n                    <jats:sc>conBO<\/jats:sc>\n                    large-scale (\n                    <jats:sc>conBO-LS<\/jats:sc>\n                    ), which adapts\n                    <jats:sc>conBO-PS<\/jats:sc>\n                    by considering a subset of components chosen based on their potential impact, allowing users to control computational effort. We evaluate the performance of these algorithms on non-linear synthetic functions and also compare them to state-of-the-art methods in the context of falsifying conjunctive safety requirements for Cyber-Physical Systems (CPS). A conjunctive safety requirement refers to a set of safety conditions (requirements) tested together, where if at-least one condition is falsified, the entire conjunctive requirement is considered falsified. In fact, in such context the function to be minimized is the minimum of several sub-components. Results show that\n                    <jats:sc>conBO-PS<\/jats:sc>\n                    and\n                    <jats:sc>conBO-LS<\/jats:sc>\n                    outperform existing approaches, offering better solution quality and computational efficiency. In the CPS application, the proposed approaches achieve faster falsification and improved falsification rates across all benchmarks.\n                  <\/jats:p>","DOI":"10.1145\/3799710","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:17:51Z","timestamp":1773778671000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Conjunctive Bayesian Optimization (\n                    <scp>conBO<\/scp>\n                    ): An Application to Cyber-Physical Systems Verification with Conjunctive Requirements"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7099-149X","authenticated-orcid":false,"given":"Surdeep","family":"Chotaliya","sequence":"first","affiliation":[{"name":"School of Computing and Augments Intelligence, Arizona State University, Tempe, Arizona, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5029-5607","authenticated-orcid":false,"given":"Tanmay","family":"Khandait","sequence":"additional","affiliation":[{"name":"School of Computing and Augments Intelligence, Arizona State University, Tempe, Arizona, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6726-9790","authenticated-orcid":false,"given":"Giulia","family":"Pedrielli","sequence":"additional","affiliation":[{"name":"School of Computing and Augments Intelligence, Arizona State University, Tempe, Arizona, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,5,12]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2465787.2465797"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25945-1_12"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46982-9_27"},{"key":"e_1_3_2_5_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"36","author":"Ament Sebastian","year":"2024","unstructured":"Sebastian Ament, Samuel Daulton, David Eriksson, Maximilian Balandat, and Eytan Bakshy. 2024. Unexpected improvements to expected improvement for Bayesian optimization. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 36."},{"key":"e_1_3_2_6_2","first-page":"354","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Astudillo Raul","year":"2019","unstructured":"Raul Astudillo and Peter Frazier. 2019. Bayesian optimization of composite functions. In Proceedings of the International Conference on Machine Learning. PMLR, 354\u2013363."},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/WSC52266.2021.9715343"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-023-04640-7"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908869"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.5802\/aif.53"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016090421852"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0263-6_7"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1080\/10556780500140227"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3126521"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/EMSOFT.2015.7318257"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3501710.3519521"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32079-9_3"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/SBST.2015.8"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1080.0314"},{"key":"e_1_3_2_20_2","unstructured":"Peter I. Frazier. 2018. A tutorial on Bayesian optimization. arXiv:1807.02811. Retrieved from https:\/\/arxiv.org\/abs\/1807.02811"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321872"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2022.108110"},{"issue":"6","key":"e_1_3_2_23_2","first-page":"1809","article-title":"Entropy search for information-efficient global optimization","volume":"13","author":"Hennig Philipp","year":"2012","unstructured":"Philipp Hennig and Christian J. Schuler. 2012. Entropy search for information-efficient global optimization. Journal of Machine Learning Research 13, 6 (2012), 1809\u20131837.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46430-1_16"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/WSC60868.2023.10408654"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2016.2602089"},{"key":"e_1_3_2_28_2","first-page":"122","volume-title":"Proceedings of the 11th International Workshop on Applied Verification of Continuous and Hybrid Systems (ARCH)","volume":"103","author":"Khandait Tanmay","year":"2024","unstructured":"Tanmay Khandait, Federico Formica, Paolo Arcaini, Surdeep Chotaliya, Georgios Fainekos, Abdelrahman Hekal, Atanu Kundu, Ethan Lew, Michele Loreti, Claudio Menghi, et al. 2024. ARCH-COMP 2024 category report: Falsification. In Proceedings of the 11th International Workshop on Applied Verification of Continuous and Hybrid Systems (ARCH), Vol. 103, 122\u2013144."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.24096"},{"key":"e_1_3_2_30_2","doi-asserted-by":"crossref","unstructured":"Harold J. Kushner. 1964. A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise. Journal of Basic Engineering 86 1 (1964) 97\u2013106.","DOI":"10.1115\/1.3653121"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISORC.2008.25"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/OJCS.2021.3097540"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2023.10.1639"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-44505-7_28"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/CASE49439.2021.9551474"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-020-00937-5"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2023.3257982"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2007.912191"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59152-6_34"},{"key":"e_1_3_2_40_2","unstructured":"Giulia Pedrielli Tanmay Khandait Surdeep Chotaliya Quinn Thibeault Hao Huang Mauricio Castillo-Effen and Georgios Fainekos. 2021. Part-X: A family of stochastic algorithms for search-based test generation with probabilistic guarantees. arXiv:2110.10729. Retrieved from https:\/\/arxiv.org\/abs\/2110.10729"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW55395.2022.00018"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-013-0919-4"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3474054"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2021.04.040"},{"key":"e_1_3_2_45_2","volume-title":"The Design and Analysis of Computer Experiments","author":"Santner Thomas J.","year":"2013","unstructured":"Thomas J. Santner, Brian J. Williams, and William I. Notz. 2013. The Design and Analysis of Computer Experiments. Springer Science & Business Media."},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3023250"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66845-1_1"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jctc.1c00301"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1021\/acs.accounts.0c00713"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41524-018-0090-y"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85248-1_15"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/CASE56687.2023.10260576"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528716"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725497"},{"key":"e_1_3_2_55_2","first-page":"2661","volume-title":"Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics","author":"Uhrenholt Anders Kirk","year":"2019","unstructured":"Anders Kirk Uhrenholt and Bj\u00f8ern Sand Jensen. 2019. Efficient Bayesian optimization for target vector estimation. In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. PMLR, 2661\u20132670."},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCPS54341.2022.00040"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2017.8122656"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00184"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2020.2969178"},{"key":"e_1_3_2_60_2","unstructured":"Gen Zhang Pengfei Wang Tai Yue Xiangdong Kong Shan Huang Xu Zhou and Kai Lu. 2024. MobFuzz: Adaptive multi-objective optimization in gray-box fuzzing. arXiv:2401.15956. Retrieved from https:\/\/arxiv.org\/abs\/2401.15956"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-25540-4_23"}],"container-title":["ACM Transactions on Cyber-Physical Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3799710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T14:36:54Z","timestamp":1779028614000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3799710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,12]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,7,31]]}},"alternative-id":["10.1145\/3799710"],"URL":"https:\/\/doi.org\/10.1145\/3799710","relation":{},"ISSN":["2378-962X","2378-9638"],"issn-type":[{"value":"2378-962X","type":"print"},{"value":"2378-9638","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,12]]},"assertion":[{"value":"2025-05-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-16","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-05-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}