We present a case study on malware detection--a binary classification problem on byte sequences where classifier evasion is a well-established threat model.

Semantic segmentation has witnessed tremendous progress due to the proposal of various advanced network architectures.

We prove a Chernoff-type bound for sums of matrix-valued random variables sampled viaaregular (aperiodic and irreducible) finite Markovchain.