{"title":"Selective Classification of Sequential Data Using Inductive Conformal Prediction","authors":"Dimitrios Boursinos, X. Koutsoukos","doi":"10.1109/ICAA52185.2022.00015","DOIUrl":"https://doi.org/10.1109/ICAA52185.2022.00015","url":null,"abstract":"Cyber-Physical Systems (CPS) operate in dynamic and uncertain environments where the use of deep neural networks (DNN) for perception can be advantageous. However, DNN integration in CPS is not straightforward. Perception outputs must be complemented with assurance metrics that represent if they can be trusted or not. Further, the inputs to DNNs are typically sequential capturing time-correlated data that can affect the accuracy of the predictions since machine learning models require inputs to be independent and identically distributed. In this paper, we propose a selective classification approach that rejects predictions that are not trustworthy. We quantify the credibility and confidence of each prediction by computing aggregate p-values from multiple subsequent inputs. We examine different multiple hypothesis testing approaches for combining p-values computed using Inductive Conformal Prediction (ICP) focusing on their ability to produce valid p-values for sequential data. Empirical evaluation results using the German Traffic Sign Recognition Benchmark demonstrate that ICP validity can be recovered when p-values from sequential inputs are combined and selective classification based on aggregate p-values produces predictions with less risk.","PeriodicalId":206047,"journal":{"name":"2022 IEEE International Conference on Assured Autonomy (ICAA)","volume":"35 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114013723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. Bhowmick, Mudassir Shabbir, W. Abbas, X. Koutsoukos
{"title":"Resilient Multi-agent Reinforcement Learning Using Medoid and Soft-medoid Based Aggregation","authors":"C. Bhowmick, Mudassir Shabbir, W. Abbas, X. Koutsoukos","doi":"10.1109/ICAA52185.2022.00014","DOIUrl":"https://doi.org/10.1109/ICAA52185.2022.00014","url":null,"abstract":"A network of reinforcement learning (RL) agents that cooperate with each other by sharing information can improve learning performance of control and coordination tasks when compared to non-cooperative agents. However, networked Multi-agent Reinforcement Learning (MARL) is vulnerable to adversarial agents that can compromise some agents and send malicious information to the network. In this paper, we consider the problem of resilient MARL in the presence of adversarial agents that aim to compromise the learning algorithm. First, the paper presents an attack model which aims to degrade the performance of a target agent by modifying the parameters shared by an attacked agent. In order to improve the resilience, the paper presents aggregation methods using medoid and soft-medoid. Our analysis shows that the medoid-based MARL algorithms converge to an optimal solution given standard assumptions, and improve the overall learning performance and robustness. Simulation results show the effectiveness of the aggregation methods compared with average and median-based aggregation.","PeriodicalId":206047,"journal":{"name":"2022 IEEE International Conference on Assured Autonomy (ICAA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131282208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nathaniel P. Hamilton, Patrick Musau, Diego Manzanas Lopez, Taylor T. Johnson
{"title":"Zero-Shot Policy Transfer in Autonomous Racing: Reinforcement Learning vs Imitation Learning","authors":"Nathaniel P. Hamilton, Patrick Musau, Diego Manzanas Lopez, Taylor T. Johnson","doi":"10.1109/ICAA52185.2022.00011","DOIUrl":"https://doi.org/10.1109/ICAA52185.2022.00011","url":null,"abstract":"There are few technologies that hold as much promise in achieving safe, accessible, and convenient transportation as autonomous vehicles. However, as recent years have demonstrated, safety and reliability remain the most obstinate challenges, especially in complex domains. Autonomous racing has demonstrated unique benefits in that researchers can conduct research in controlled environments, allowing for experimentation with approaches that are too risky to evaluate on public roads. In this work, we compare two leading methods for training neural network controllers, Reinforcement Learning and Imitation Learning, for the autonomous racing task. We compare their viability by analyzing their performance and safety when deployed in novel scenarios outside their training via zero-shot policy transfer. Our evaluation is made up of a large number of experiments in simulation and on our real-world hardware platform that analyze whether these algorithms remain effective when transferred to the real-world. Our results show reinforcement learning outperforms imitation learning in most scenarios. However, the increased performance comes at the cost of reduced safety. Thus, both methods are effective under different criteria.","PeriodicalId":206047,"journal":{"name":"2022 IEEE International Conference on Assured Autonomy (ICAA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134270130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Samuel Lefcourt, Nathaniel G. Gordon, Hanting Wong, Gregory Falco
{"title":"Robustness Assurance Quotient: Demonstrating Context Matters for AI Performance and ML Security","authors":"Samuel Lefcourt, Nathaniel G. Gordon, Hanting Wong, Gregory Falco","doi":"10.1109/ICAA52185.2022.00012","DOIUrl":"https://doi.org/10.1109/ICAA52185.2022.00012","url":null,"abstract":"We present a novel approach to developing robust AI in light of context-varying situations. This methodology harnesses a suite of indicators to establish a Robustness Assurance Quotient (RAQ) tailored to address environmentally noisy data while maintaining parity with current standards, namely the Fréchet Inception Distance (FID) metric. While the FID metric successfully indicates the closeness of highly structured data, it is less successful measuring closeness of inherently noisy data. A score for ascertaining the closeness between Generative Adversarial Network (GAN)-simulated, inherently noisy radiofrequnecy data and original GAN signals are proposed by focusing on the subject and context of the image. The RAQ demonstrably improved our GAN’s generated content similarity to original waterfall images of radiofrequency signal. We believe our Robustness Assurance Quotient can have a profound impact on improving the robustness of various AI models, in diverse application domains ultimately reducing the negative impact of noisy data.","PeriodicalId":206047,"journal":{"name":"2022 IEEE International Conference on Assured Autonomy (ICAA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115850113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hedin Beattie, Lanier A Watkins, William H. Robinson, A. Rubin, Shari Watkins
{"title":"Measuring and Mitigating Bias in AI-Chatbots","authors":"Hedin Beattie, Lanier A Watkins, William H. Robinson, A. Rubin, Shari Watkins","doi":"10.1109/ICAA52185.2022.00023","DOIUrl":"https://doi.org/10.1109/ICAA52185.2022.00023","url":null,"abstract":"The use of artificial intelligence (AI) to train conversational chatbots in the nuances of human interactions raises the concern of whether chatbots will demonstrate prejudice similar to that of humans, and thus require bias training. Ideally, a chatbot is void of racism, sexism, or any other offensive speech, however several well-known public instances indicate otherwise (e.g., Microsoft Taybot).In this paper, we explore the mechanisms of how open source conversational chatbots can learn bias, and we investigate potential solutions to mitigate this learned bias. To this end, we developed the Chatbot Bias Assessment Framework to measure bias in conversational chatbots, and then we devised an approach based on counter-stereotypic imagining to reduce this bias. This approach is non-intrusive to the chatbot, since it does not require altering any AI code or deleting any data from the original training dataset.","PeriodicalId":206047,"journal":{"name":"2022 IEEE International Conference on Assured Autonomy (ICAA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130353534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Shreyas Ramakrishna, Baiting Luo, Yogesh D. Barve, G. Karsai, A. Dubey
{"title":"Risk-Aware Scene Sampling for Dynamic Assurance of Autonomous Systems","authors":"Shreyas Ramakrishna, Baiting Luo, Yogesh D. Barve, G. Karsai, A. Dubey","doi":"10.1109/ICAA52185.2022.00022","DOIUrl":"https://doi.org/10.1109/ICAA52185.2022.00022","url":null,"abstract":"Autonomous Cyber-Physical Systems must often operate under uncertainties like sensor degradation and shifts in the operating conditions, which increases its operational risk. Dynamic Assurance of these systems requires designing runtime safety components like Out-of-Distribution detectors and risk estimators, which require labeled data from different operating modes of the system that belong to scenes with adverse operating conditions, sensors, and actuator faults. Collecting real-world data of these scenes can be expensive and sometimes not feasible. So, scenario description languages with samplers like random and grid search are available to generate synthetic data from simulators, replicating these real-world scenes. However, we point out three limitations in using these conventional samplers. First, they are passive samplers, which do not use the feedback of previous results in the sampling process. Second, the variables to be sampled may have constraints that are often not included. Third, they do not balance the tradeoff between exploration and exploitation, which we hypothesize is necessary for better search space coverage. We present a scene generation approach with two samplers called Random Neighborhood Search (RNS) and Guided Bayesian Optimization (GBO), which extend the conventional random search and Bayesian Optimization search to include the limitations. Also, to facilitate the samplers, we use a risk-based metric that evaluates how risky the scene was for the system. We demonstrate our approach using an Autonomous Vehicle example in CARLA simulation. To evaluate our samplers, we compared them against the baselines of random search, grid search, and Halton sequence search. Our samplers of RNS and GBO sampled a higher percentage of high-risk scenes of 83% and 92%, compared to 56% 66% and 71% of the grid, random and Halton samplers, respectively.","PeriodicalId":206047,"journal":{"name":"2022 IEEE International Conference on Assured Autonomy (ICAA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127293251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}