Feature-level Malware Obfuscation in Deep Learning

We consider the problem of detecting malware with deep learning models, where the malware may be combined with significant amounts of benign code. Examples of this include piggybacking and trojan horse attacks on a system, where malicious behavior is hidden within a useful application. Such added flexibility in augmenting the malware enables significantly more code obfuscation. Hence we focus on the use of static features, particularly Intents, Permissions, and API calls, which we presume cannot be ultimately hidden from the Android system, but only augmented with yet more such features. We first train a deep neural network classifier for malware classification using features of benign and malware samples. Then we demonstrate a steep increase in false negative rate (ie, attacks succeed), simply by randomly adding features of a benign app to malware. Finally we test the use of data augmentation to harden the classifier against such attacks. We find that for API calls, it is possible to reject the vast majority of attacks, where using Intents or Permissions is less successful.


Quadratic Programming with Keras

This note describes how to implement and solve a quadratic programming optimization problem using a shallow neural network in Keras. A single linear layer is used with a custom one-sided loss to impose the inequality constraints. A custom kernel regularizer is used to impose the optimization objective, yielding a form of penalty method. This provides a useful exercise in augmenting the loss, metrics, and callbacks used in Keras. This also potentially allows the exploitation of the back-end implementations of Keras and Tensorflow on GPU’s and distributed storage. We demonstrate the method for large-scale computational image reconstruction with compressed sensing simulations.

www.keithdillon.com/papers_preprints/Quadratic Programming with Keras.pdf

Clustering Gaussian Graphical Models

We derive an efficient method to perform clustering of nodes in Gaussian graphical models directly from sample data. Nodes are clustered based on the similarity of their network neighborhoods, with edge weights defined by partial correlations. In the limited-data scenario, where the covariance matrix would be rank-deficient, we are able to make use of matrix factors, and never need to estimate the actual covariance or precision matrix. We demonstrate the method on functional MRI data from the Human Connectome Project. A matlab implementation of the algorithm is provided.


For Matlab code, read ‘more’


On the Computation and Applications of Large Dense Partial Correlation Networks

While sparse inverse covariance matrices are very popular for modeling network connectivity, the value of the dense solution is often overlooked. In fact the L2-regularized solution has deep connections to a number of important applications to spectral graph theory, dimensionality reduction, and uncertainty quantification. We derive an approach to directly compute the partial correlations based on concepts from inverse problem theory. This approach also leads to new insights on open problems such as model selection and data preprocessing, as well as new approaches which relate the above application areas.


Spectral Resolution Clustering for Brain Parcellation

We take an image science perspective on the problem of determining brain network connectivity given functional activity. But adapting the concept of image resolution to this problem, we provide a new perspective on network partitioning for individual brain parcellation. The typical goal here is to determine densely-interconnected subnetworks within a larger network by choosing the best edges to cut. We instead define these subnetworks as resolution cells, where highly-correlated activity within the cells makes edge weights difficult to determine from the data. Subdividing the resolution estimates into disjoint resolution cells via clustering yields a new variation, and new perspective, on spectral clustering. This provides insight and strategies for open questions such as the selection of model order and the optimal choice of preprocessing steps for functional imaging data. The approach is demonstrated using functional imaging data, where we find the proposed approach produces parcellations which are more predictive across multiple scans versus conventional methods, as well as versus alternative forms of spectral clustering.


A regularized clustering approach to brain parcellation from functional MRI data

We consider a data-driven approach for the subdivision of an individual subject’s functional Magnetic Resonance Imaging (fMRI) scan into regions of interest, i.e., brain parcellation. The approach is based on a computational technique for calculating resolution from inverse problem theory, which we apply to neighborhood selection for brain connectivity networks. This can be efficiently calculated even for very large images, and explicitly incorporates regularization in the form of spatial smoothing and a noise cutoff. We demonstrate the reproducibility of the method on multiple scans of the same subjects, as well as the variations between subjects.

Keith Dillon, Yu-Ping Wang, ” A regularized clustering approach to brain parcellation from functional MRI data“, Proc. SPIE 10394, Wavelets and Sparsity XVII, 103940E (2017/08/24); doi: 10.1117/12.2274846; http://dx.doi.org/10.1117/12.2274846

A robust sparse-modeling framework for estimating schizophrenia biomarkers from fMRI

Our goal is to identify the brain regions most relevant to mental illness using neuroimaging. State of the art machine learning methods commonly suffer from repeatability difficulties in this application, particularly when using large and heterogeneous populations for samples. We revisit both dimensionality reduction and sparse modeling, and recast them in a common optimization-based framework. This allows us to combine the benefits of both types of methods in an approach which we call unambiguous components. We use this to estimate the image component with a constrained variability, which is best correlated with the unknown disease mechanism.


Computational estimation of resolution in reconstruction techniques utilizing sparsity, total variation, and nonnegativity

Techniques which exploit properties such as sparsity and total variation have provided the ability to reconstruct images that surpass the conventional limits of imaging. This leads to difficulties in assessing the result, as conventional metrics for resolution are no longer valid. We develop a numerical approach to evaluating the second-order statistics of the estimate by relating a confidence interval on the solution to a confidence interval on a pixel value, and from this we formulate an approach to estimating the spatial resolution. With this estimate, we can calculate the resolution at each point subject to chosen bounds on the desired precision and confidence.


Imposing uniqueness to achieve sparsity

In this paper we take a novel approach to the regularization of underdetermined linear systems. Typically, a prior distribution is imposed on the unknown to hopefully force a sparse solution, which often relies on uniqueness of the regularized solution (something which is typically beyond our control) to work as desired. But here we take a direct approach, by imposing the requirement that the system takes on a unique solution. Then we seek a minimal residual for which this uniqueness requirement holds.