DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Changick | - |
dc.contributor.advisor | 김창익 | - |
dc.contributor.author | Go, Hyojun | - |
dc.date.accessioned | 2023-06-26T19:33:50Z | - |
dc.date.available | 2023-06-26T19:33:50Z | - |
dc.date.issued | 2022 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=997260&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/309870 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기및전자공학부, 2022.2,[iii, 37 p. :] | - |
dc.description.abstract | Adversarial examples which are imperceptibly crafted by adversarial attacks can fool neural networks. Defense methods for it have been proposed, but new and stronger attacks can threaten existing defenses. This possibility highlights the importance of certified defense methods that train deep neural networks with verifiably robust guarantees. Interval bound propagation (IBP)-based methods have been demonstrated to be most effective for certified defense, However, we observe that these methods are suffered from Low Epsilon Overfitting (LEO), a problem arising from their training schedule which increases the input perturbation bound ($\epsilon$). In this paper, we show that LEO can disturb the learning of a simple linear classifier in higher epsilon $(\epsilon)$ and investigate the evidence of LEO by experiments. Based on these observations, we propose a new training strategy, BatchMix, which mixes various $\epsilon$ in a mini-batch to alleviate LEO. Experimental results on MNIST and CIFAR-10 datasets show that BatchMix can improve the performance of IBP-based methods. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | Rethinking training schedules for verifiably robust neural networks | - |
dc.title.alternative | 검증 가능하게 강건한 뉴럴 네트워크를 위한 훈련 과정 재고 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :전기및전자공학부, | - |
dc.contributor.alternativeauthor | 고효준 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.