Xiyue Zhang, Benjie Wang, Marta Kwiatkowska, Huan Zhang
{"title":"PREMAP: A Unifying PREiMage APproximation Framework for Neural Networks","authors":"Xiyue Zhang, Benjie Wang, Marta Kwiatkowska, Huan Zhang","doi":"arxiv-2408.09262","DOIUrl":null,"url":null,"abstract":"Most methods for neural network verification focus on bounding the image,\ni.e., set of outputs for a given input set. This can be used to, for example,\ncheck the robustness of neural network predictions to bounded perturbations of\nan input. However, verifying properties concerning the preimage, i.e., the set\nof inputs satisfying an output property, requires abstractions in the input\nspace. We present a general framework for preimage abstraction that produces\nunder- and over-approximations of any polyhedral output set. Our framework\nemploys cheap parameterised linear relaxations of the neural network, together\nwith an anytime refinement procedure that iteratively partitions the input\nregion by splitting on input features and neurons. The effectiveness of our\napproach relies on carefully designed heuristics and optimization objectives to\nachieve rapid improvements in the approximation volume. We evaluate our method\non a range of tasks, demonstrating significant improvement in efficiency and\nscalability to high-input-dimensional image classification tasks compared to\nstate-of-the-art techniques. Further, we showcase the application to\nquantitative verification and robustness analysis, presenting a sound and\ncomplete algorithm for the former and providing sound quantitative results for\nthe latter.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"24 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.09262","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Most methods for neural network verification focus on bounding the image,
i.e., set of outputs for a given input set. This can be used to, for example,
check the robustness of neural network predictions to bounded perturbations of
an input. However, verifying properties concerning the preimage, i.e., the set
of inputs satisfying an output property, requires abstractions in the input
space. We present a general framework for preimage abstraction that produces
under- and over-approximations of any polyhedral output set. Our framework
employs cheap parameterised linear relaxations of the neural network, together
with an anytime refinement procedure that iteratively partitions the input
region by splitting on input features and neurons. The effectiveness of our
approach relies on carefully designed heuristics and optimization objectives to
achieve rapid improvements in the approximation volume. We evaluate our method
on a range of tasks, demonstrating significant improvement in efficiency and
scalability to high-input-dimensional image classification tasks compared to
state-of-the-art techniques. Further, we showcase the application to
quantitative verification and robustness analysis, presenting a sound and
complete algorithm for the former and providing sound quantitative results for
the latter.