{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T06:10:13Z","timestamp":1747894213290,"version":"3.41.0"},"reference-count":42,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,3,31]]},"DOI":"10.23919\/date64628.2025.10992738","type":"proceedings-article","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T17:36:35Z","timestamp":1747848995000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification"],"prefix":"10.23919","author":[{"given":"Kota","family":"Fukuda","sequence":"first","affiliation":[{"name":"Kyushu University,Fukuoka,Japan"}]},{"given":"Guanqin","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales,Sydney,Australia"}]},{"given":"Zhenya","family":"Zhang","sequence":"additional","affiliation":[{"name":"Kyushu University,Fukuoka,Japan"}]},{"given":"Yulei","family":"Sui","sequence":"additional","affiliation":[{"name":"Kyushu University,Fukuoka,Japan"}]},{"given":"Jianjun","family":"Zhao","sequence":"additional","affiliation":[{"name":"Kyushu University,Fukuoka,Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000035"},{"key":"ref2","article-title":"Explaining and harnessing adversarial examples","volume-title":"3rd Int. Conf. on Learning Representations (ICLR 15)","author":"Goodfellow","year":"2015"},{"volume-title":"3rd international verification of neural networks competition (VNN-COMP 2022): Summary and results","year":"2022","author":"M\u00fcller","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68167-2_18"},{"key":"ref5","article-title":"Evaluating robustness of neural networks with mixed integer programming","author":"Tjeng","year":"2018","journal-title":"Int. Conf. on Learning Representations"},{"key":"ref6","article-title":"Fast and effective robustness certification","volume":"31","author":"Singh","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3290354"},{"key":"ref8","article-title":"Efficient neural network robustness certification with general activation functions","volume":"31","author":"Zhang","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref9","first-page":"5286","article-title":"Provable defenses against adversarial examples via the convex outer adversarial polytope","author":"Wong","year":"2018","journal-title":"Int. Conf. on Machine Learning. PMLR"},{"issue":"2020","key":"ref10","article-title":"Branch and bound for piecewise linear neural network verification","volume":"21","author":"Bunel","year":"2020","journal-title":"Journal of Machine Learning Research"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3591299"},{"key":"ref13","first-page":"29909","article-title":"Beta-crown: Efficient bound propagation with per-neuron split constraints for neural network robustness verification","volume":"34","author":"Wang","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/351"},{"journal-title":"Improved branch and bound for neural network verification via lagrangian decomposition","year":"2021","author":"De Palma","key":"ref15"},{"key":"ref16","article-title":"Fast and effective robustness certification","volume":"31","author":"Singh","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2858463"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63387-9_5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68167-2_19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63387-9_1"},{"key":"ref21","article-title":"Neural network robustness verification on gpus","volume":"abs\/2007.10868","author":"M\u00fcller","year":"2020","journal-title":"CoRR"},{"key":"ref22","article-title":"Efficient formal safety analysis of neural networks","volume":"31","author":"Wang","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref23","first-page":"2350","article-title":"Efficiently computing local lipschitz constants of neural networks via bound propagation","volume":"35","author":"Shi","year":"2022","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref24","first-page":"1811","author":"Anderson","year":"2018","journal-title":"Strong convex relaxations and mixed-integer programming formulations for trained neural networks"},{"key":"ref25","first-page":"21 675","article-title":"The convex relaxation barrier, revisited: Tightened single-neuron relaxations for neural network verification","volume":"33","author":"Tjandraatmadja","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref26","article-title":"Beyond the single neuron convex barrier for neural network certification","volume":"32","author":"Singh","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3498704"},{"journal-title":"Precise multi-neuron abstractions for neural network certification","year":"2021","author":"M\u00fcller","key":"ref28"},{"key":"ref29","article-title":"Semidefinite relaxations for certifying robustness to adversarial examples","volume":"31","author":"Raghunathan","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72016-2_21"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19992-9_25"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22308-2_20"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_15"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-90643-5_17"},{"journal-title":"Neural network branching for neural network verification","year":"2019","author":"Lu","key":"ref35"},{"journal-title":"Complete verification via multi-neuron relaxation guided branch-and-bound","year":"2022","author":"Ferrari","key":"ref36"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132785"},{"key":"ref38","first-page":"4901","article-title":"Tensorfuzz: De-bugging neural networks with coverage-guided fuzzing","volume-title":"International Conference on Machine Learning. PMLR","author":"Odena","year":"2019"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58592-1_29"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00284"},{"key":"ref41","first-page":"26591","article-title":"A branch and bound framework for stronger adversarial attacks of relu networks","volume-title":"International Conference on Machine Learning","author":"Zhang","year":"2022"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.49"}],"event":{"name":"2025 Design, Automation & Test in Europe Conference (DATE)","start":{"date-parts":[[2025,3,31]]},"location":"Lyon, France","end":{"date-parts":[[2025,4,2]]}},"container-title":["2025 Design, Automation & Test in Europe Conference (DATE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10992638\/10992588\/10992738.pdf?arnumber=10992738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T05:32:44Z","timestamp":1747891964000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10992738\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,31]]},"references-count":42,"URL":"https:\/\/doi.org\/10.23919\/date64628.2025.10992738","relation":{},"subject":[],"published":{"date-parts":[[2025,3,31]]}}}