Energy-bounded Learning for Robust Models of Code
Nghi D. Q. Bui, Yijun Yu

TL;DR
This paper introduces an energy-bounded learning approach to improve the robustness of code models by effectively detecting out-of-distribution samples and resisting adversarial attacks, outperforming existing methods.
Contribution
It proposes a novel energy-bounded training method that enhances code model robustness by better recognizing out-of-distribution data and adversarial samples.
Findings
Enhanced OOD detection accuracy over existing scores
Increased robustness against adversarial attacks
Outperforms softmax, Mahalanobis, and ODIN scores in detection tasks
Abstract
In programming, learning code representations has a variety of applications, including code classification, code search, comment generation, bug prediction, and so on. Various representations of code in terms of tokens, syntax trees, dependency graphs, code navigation paths, or a combination of their variants have been proposed, however, existing vanilla learning techniques have a major limitation in robustness, i.e., it is easy for the models to make incorrect predictions when the inputs are altered in a subtle way. To enhance the robustness, existing approaches focus on recognizing adversarial samples rather than on the valid samples that fall outside a given distribution, which we refer to as out-of-distribution (OOD) samples. Recognizing such OOD samples is the novel problem investigated in this paper. To this end, we propose to first augment the in=distribution datasets with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Malware Detection Techniques · Software Engineering Research · Web Application Security Vulnerabilities
MethodsSoftmax
