paper-with-me

홈 › Papers

Maximal Divergence Sequential Autoencoder for Binary Software Vulnerability Detection

2019-05-01 · ICLR 2019 5 · Tue Le, Tuan Nguyen, Trung Le, Dinh Phung, Paul Montague, Olivier De Vel, Lizhen Qu

Due to the sharp increase in the severity of the threat imposed by software vulnerabilities, the detection of vulnerabilities in binary code has become an important concern in the software industry, such as the embedded systems industry, and in the field of computer security. However, most of the work in binary code vulnerability detection has relied on handcrafted features which are manually chosen by a select few, knowledgeable domain experts. In this paper, we attempt to alleviate this severe binary vulnerability detection bottleneck by leveraging recent advances in deep learning representations and propose the Maximal Divergence Sequential Auto-Encoder. In particular, latent codes representing vulnerable and non-vulnerable binaries are encouraged to be maximally divergent, while still being able to maintain crucial information from the original binaries. We conducted extensive experiments to compare and contrast our proposed methods with the baselines, and the results show that our proposed methods outperform the baselines in all performance measures of interest.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Computer SecurityVulnerability Detection

Similar Papers 제목 키워드 기반

Martingale Methods for Sequential Estimation of Convex Functionals and Divergences

2021-03-16 · Tudor Manole, Aaditya Ramdas

We present a unified technique for sequential estimation of convex divergences between distributions, including integral probability metrics like the kernel maximum mean discrepancy, $\varphi$-divergences like the Kullba…

valid

Binary autoencoder with random binary weights

2020-04-30 · Viacheslav Osaulenko

Here is presented an analysis of an autoencoder with binary activations $\{0, 1\}$ and binary $\{0, 1\}$ random weights. Such set up puts this model at the intersection of different fields: neuroscience, information theo…

Estimating the Arc Length of the Optimal ROC Curve and Lower Bounding the Maximal AUC

2021-10-18 · Song Liu

In this paper, we show the arc length of the optimal ROC curve is an $f$-divergence. By leveraging this result, we express the arc length using a variational objective and estimate it accurately using positive and negati…

ARCBinary Classification

Projection onto A Nonnegative Max-Heap

2011-12-01 · NeurIPS 2011 12 · Jun Liu, Liang Sun, Jieping Ye

We consider the problem of computing the Euclidean projection of a vector of length $p$ onto a non-negative max-heap---an ordered tree where the values of the nodes are all nonnegative and the value of any parent node is…

regression

Combining Sentiment Lexica with a Multi-View Variational Autoencoder

2019-04-05 · NAACL 2019 6 · Alexander Hoyle, Lawrence Wolf-Sonkin, Hanna Wallach, Ryan Cotterell 외

When assigning quantitative labels to a dataset, different methodologies may rely on different scales. In particular, when assigning polarities to words in a sentiment lexicon, annotators may use binary, categorical, or …

General ClassificationSentiment Analysistext-classificationText Classification