SYOct 8, 2017
Artificial Bee Colony-based Adaptive Position Control of Electrohydraulic Servo Systems with Parameter UncertaintyBabajide O. Ayinde, Sami El-Ferik
In this paper, a robust adaptive backstepping-based controller is developed for positioning the spool valve of Electro-Hydraulic Servo System (EHSS) with parameter fluctuations. Artificial Bee Colony (ABC) algorithm is utilized to drive the parameters of the proposed controller to a good neighbourhood of the solution space. The optimization problem is formulated such that both the tracking error and control signal are minimized concurrently. The results show that the proposed controller guarantees the uniform ultimate boundedness of the tracking error and control signal. Moreover, illustrative simulations validate the potentials and robustness of the proposed schemes in the presence of uncertainties. The proposed controller is also compared with sliding mode control.
LGJan 30, 2019
On Correlation of Features Extracted by Deep Neural NetworksBabajide O. Ayinde, Tamer Inanc, Jacek M. Zurada
Redundancy in deep neural network (DNN) models has always been one of their most intriguing and important properties. DNNs have been shown to overparameterize, or extract a lot of redundant features. In this work, we explore the impact of size (both width and depth), activation function, and weight initialization on the susceptibility of deep neural network models to extract redundant features. To estimate the number of redundant features in each layer, all the features of a given layer are hierarchically clustered according to their relative cosine distances in feature space and a set threshold. It is shown that both network size and activation function are the two most important components that foster the tendency of DNNs to extract redundant features. The concept is illustrated using deep multilayer perceptron and convolutional neural networks on MNIST digits recognition and CIFAR-10 dataset, respectively.
LGJan 30, 2019
Diversity Regularized Adversarial LearningBabajide O. Ayinde, Keishin Nishihama, Jacek M. Zurada
The two key players in Generative Adversarial Networks (GANs), the discriminator and generator, are usually parameterized as deep neural networks (DNNs). On many generative tasks, GANs achieve state-of-the-art performance but are often unstable to train and sometimes miss modes. A typical failure mode is the collapse of the generator to a single parameter configuration where its outputs are identical. When this collapse occurs, the gradient of the discriminator may point in similar directions for many similar points. We hypothesize that some of these shortcomings are in part due to primitive and redundant features extracted by discriminator and this can easily make the training stuck. We present a novel approach for regularizing adversarial models by enforcing diverse feature learning. In order to do this, both generator and discriminator are regularized by penalizing both negatively and positively correlated features according to their differentiation and based on their relative cosine distances. In addition to the gradient information from the adversarial loss made available by the discriminator, diversity regularization also ensures that a more stable gradient is provided to update both the generator and discriminator. Results indicate our regularizer enforces diverse features, stabilizes training, and improves image synthesis.
CVFeb 21, 2018
Building Efficient ConvNets using Redundant Feature PruningBabajide O. Ayinde, Jacek M. Zurada
This paper presents an efficient technique to prune deep and/or wide convolutional neural network models by eliminating redundant features (or filters). Previous studies have shown that over-sized deep neural network models tend to produce a lot of redundant features that are either shifted version of one another or are very similar and show little or no variations; thus resulting in filtering redundancy. We propose to prune these redundant features along with their connecting feature maps according to their differentiation and based on their relative cosine distances in the feature space, thus yielding smaller network size with reduced inference costs and competitive performance. We empirically show on select models and CIFAR-10 dataset that inference costs can be reduced by 40% for VGG-16, 27% for ResNet-56, and 39% for ResNet-110.
LGJan 31, 2018
Deep Learning of Nonnegativity-Constrained Autoencoders for Enhanced Understanding of DataBabajide O. Ayinde, Jacek M. Zurada
Unsupervised feature extractors are known to perform an efficient and discriminative representation of data. Insight into the mappings they perform and human ability to understand them, however, remain very limited. This is especially prominent when multilayer deep learning architectures are used. This paper demonstrates how to remove these bottlenecks within the architecture of Nonnegativity Constrained Autoencoder (NCSAE). It is shown that by using both L1 and L2 regularization that induce nonnegativity of weights, most of the weights in the network become constrained to be nonnegative thereby resulting into a more understandable structure with minute deterioration in classification accuracy. Also, this proposed approach extracts features that are more sparse and produces additional output layer sparsification. The method is analyzed for accuracy and feature interpretation on the MNIST data, the NORB normalized uniform object data, and the Reuters text categorization dataset.