Adaptive Identification of SIS Models

Effective containment of spreading processes such as epidemics requires accurate knowledge of several key parameters that govern their dynamics. In this work, we first show that the problem of identifying the underlying parameters of epidemiological spreading processes is often ill-conditioned and lacks the persistence of excitation required for the convergence of adaptive learning schemes. To tackle this challenge, we leverage a relaxed property called initial excitation combined with a recursive least squares algorithm to design an online adaptive identifier to learn the parameters of the susceptible-infected-susceptible (SIS) epidemic model from the knowledge of its states. We prove that the iterates generated by the proposed algorithm minimize an auxiliary weighted least squares cost function. We illustrate the convergence of the error of the estimated epidemic parameters via several numerical case studies and compare it with results obtained using conventional approaches

Adaptiveness, Asynchrony, and Resource Efficiency in Parallel Stochastic Gradient Descent

Accelerated digitalization and sensor deployment in society in recent years poses critical challenges for associated data processing and analysis infrastructure to scale, and the field of big data, targeting methods for storing, processing, and revealing patterns in huge data sets, has surged. Artificial Intelligence (AI) models are used diligently in standard Big Data pipelines due to their tremendous success across various data analysis tasks, however exponential growth in Volume, Variety and Velocity of Big Data (known as its three V’s) in recent years require associated complexity in the AI models that analyze it, as well as the Machine Learning (ML) processes required to train them. In order to cope, parallelism in ML is standard nowadays, with the aim to better utilize contemporary computing infrastructure, whether it being shared-memory multi-core CPUs, or vast connected networks of IoT devices engaging in Federated Learning (FL).Stochastic Gradient Descent (SGD) serves as the backbone of many of the most popular ML methods, including in particular Deep Learning. However, SGD has inherently sequential semantics, and is not trivially parallelizable without imposing strict synchronization, with associated bottlenecks. Asynchronous SGD (AsyncSGD), which relaxes the original semantics, has gained significant interest in recent years due to promising results that show speedup in certain contexts. However, the relaxed semantics that asynchrony entails give rise to fundamental questions regarding AsyncSGD, relating particularly to its stability and convergence rate in practical applications.This thesis explores vital knowledge gaps of AsyncSGD, and contributes in particular to: Theoretical frameworks – Formalization of several key notions related to the impact of asynchrony on the convergence, guiding future development of AsyncSGD implementations; Analytical results – Asymptotic convergence bounds under realistic assumptions. Moreover, several technical solutions are proposed, targeting in particular: Stability – Reducing the number of non-converging executions and the associated wasted energy; Speedup – Improving convergence time and reliability with instance-based adaptiveness; Elasticity – Resource-efficiency by avoiding over-parallelism, and thereby improving stability and saving computing resources. The proposed methods are evaluated on several standard DL benchmarking applications and compared to relevant baselines from previous literature. Key results include: (i) persistent speedup compared to baselines, (ii) increased stability and reduced risk for non-converging executions, (iii) reduction in the overall memory footprint (up to 17%), as well as the consumed computing resources (up to 67%).In addition, along with this thesis, an open-source implementation is published, that connects high-level ML operations with asynchronous implementations with fine-grained memory operations, leveraging future research for efficient adaptation of AsyncSGD for practical applications

Detecting and Mitigating Adversarial Attack

Automating arrhythmia detection from ECG requires a robust and trusted system that retains high accuracy under electrical disturbances. Deep neural networks have become a popular technique for tracing ECG signals, outperforming human experts. Many approaches have reached human-level performance in classifying arrhythmia from ECGs. Even convolutional neural networks are susceptible to adversarial examples as well that can also misclassify ECG signals. Moreover, they do not generalize well on the out-of-distribution dataset. Adversarial attacks are small crafted perturbations injected in the original data which manifest the out-of-distribution shifts in signal to misclassify the correct class. However, these architectures are vulnerable to adversarial attacks as well. The GAN architecture has been employed in recent works to synthesize adversarial ECG signals to increase existing training data. However, they use a disjointed CNN-based classification architecture to detect arrhythmia. Till now, no versatile architecture has been proposed that can detect adversarial examples and classify arrhythmia simultaneously. In this work, we propose two novel conditional generative adversarial networks (GAN), ECG-Adv-GAN and ECG-ATK-GAN, to simultaneously generate ECG signals for different categories and detect cardiac abnormalities. The model is conditioned on class-specific ECG signals to synthesize realistic adversarial examples. Moreover, the ECG-ATK-GAN is robust against adversarial attacked ECG signals and retains high accuracy when exposed to various types of adversarial attacks while classifying arrhythmia. We benchmark our architecture on six different white and black-box attacks and compare them with other recently proposed arrhythmia classification models. When considering the defense strategy, the variation of the adversarial attacks, both targeted and non-targeted, can determine the perturbation by calculating the gradient. Novel defenses are being introduced to improve upon existing techniques to fend off each new attack. This back-and-forth game between attack and defense is persistently recurring, and it became significant to understand the pattern and behavior of the attacker to create a robust defense. One widespread tactic is applying a mathematically based model like Game theory. To analyze this circumstance, we propose a computational framework of game theory to analyze the CNN Classifier's vulnerability, strategy, and outcomes by forming a simultaneous two-player game. We represent the interaction in the Stackelberg Game in Kuhn tree to study players' possible behaviors and actions by applying our Classifier's actual predicted values in CAPTCHA dataset. Thus, we interpret potential attacks in deep learning applications while representing viable defense strategies from the Game theoretical perspective

Intelligent Sensing in Dynamic Environments Using Markov Decision Process

In a network of low-powered wireless sensors, it is essential to capture as many environmental events as possible while still preserving the battery life of the sensor node. This paper focuses on a real-time learning algorithm to extend the lifetime of a sensor node to sense and transmit environmental events. A common method that is generally adopted in ad-hoc sensor networks is to periodically put the sensor nodes to sleep. The purpose of the learning algorithm is to couple the sensor’s sleeping behavior to the natural statistics of the environment hence that it can be in optimal harmony with changes in the environment, the sensors can sleep when steady environment and stay awake when turbulent environment. This paper presents theoretical and experimental validation of a reward based learning algorithm that can be implemented on an embedded sensor. The key contribution of the proposed approach is the design and implementation of a reward function that satisfies a trade-off between the above two mutually contradicting objectives, and a linear critic function to approximate the discounted sum of future rewards in order to perform policy learning

Impact analysis of electric vehicle demand on demand profile, electricity charges and system emissions of Rochester Institute of Technology

In view of growing concerns of greenhouse gas emissions, electrification in the transportation fleet is expected to increase globally. To accommodate the incoming increase in energy demand from vehicle charging, the existing electrical network should be managed in a way that the load is operated with no electrical instability. Peak demand occurrences which could be measured daily, annually, weekly, monthly or annually should be avoided in order to maintain the health of the electrical network and reduce demand charges billed to the end energy user. Moreover, depending on the emissions factor of the fuel mix used in a region for energy generation the amount of emissions is influenced by the overall network’s demand through different times of the day. This thesis addresses the effects of increasing levels of electric vehicle demand on Rochester Institute of Technology’s circuit demand profile, electricity charges and system emissions. The thesis will inform the reader about the potential changes in peak demand behavior, peak months, peak times and peak days as electric vehicle usage increases across campus. In addition, the electric vehicle penetration levels and times at which changes in overall peak demand behavior, electricity charge trend and max emissions through the day occur, will be presented in this thesis paper. The results obtained through the impact analyses suggested that overall changes in circuit behavior start to become noticeable when electric vehicle users reach 50 times the current number of users on campus. In addition, impacts of electric vehicle demand on the overall circuit’s peak occurrences are observed to shift from afternoon to morning hours as fleet electrification increases on campus. Potential electric vehicle charging times to manage the increasing demand on campus and maintaining a leveled overall demand profile, reducing electricity charges and system emissions will be suggested in this paper