Expert Systems
Testing the effectiveness of saliency-based explainability in NLP using randomized survey-based experiments
It is only becoming more vital as in sensitive areas like Political Profiling, Review of Essays in AI gains foothold in making critical - and in some cases, Education, etc. proliferate, there is a great need for increasing fatal - decisions in sensitive areas like Healthcare, Finance, transparency in NLP models to build trust with stakeholders Automated Driving, and such-like [8] [9] [10]. The true potential and identify biases. A lot of work in Explainable AI has aimed to devise explanation methods that give humans insights into of these recent advancements in AI can only be realised the workings and predictions of NLP models. While these if the various stakeholders manage to discern the working of methods distill predictions from complex models like Neural AI models and how their predictions are produced, as that is Networks into consumable explanations, how humans understand necessary to incorporate trust. For example, 83% of people these explanations is still widely unexplored. Innate do not understand automated decision-making systems in the human tendencies and biases can handicap the understanding of these explanations in humans, and can also lead to them criminal justice system, and subsequently, 60% oppose its use misjudging models and predictions as a result. We designed in the domain [11]. But besides securing the buy-in of endusers a randomized survey-based experiment to understand the effectiveness and developers through building trust, AI explainability of saliency-based Post-hoc explainability methods also has the potential of identifying AI inaccuracies prior in Natural Language Processing.
Inductive Learning of Complex Knowledge from Raw Data
One of the ultimate goals of Artificial Intelligence is to learn generalised and human interpretable knowledge from raw data. Existing neuro-symbolic approaches partly tackle this problem by using manually engineered symbolic knowledge to improve the training of a neural network. In the few cases where symbolic knowledge is learned from raw data, this knowledge lacks the expressivity required to solve complex problems. In this paper, we introduce Neuro-Symbolic Inductive Learner (NSIL), an approach that trains a neural network to extract latent concepts from raw data, whilst learning symbolic knowledge that solves complex problems, defined in terms of these latent concepts. The novelty of our approach is a method for biasing a symbolic learner to learn improved knowledge, based on the in-training performance of both neural and symbolic components. We evaluate NSIL on two problem domains that require learning knowledge with different levels of complexity. Our experimental results demonstrate that NSIL learns knowledge of increased expressivity than what can be learned by the closest neuro-symbolic baseline systems, whilst outperforming them and other pure differentiable baseline models in terms of accuracy and data efficiency.
Big Earth Data and Machine Learning for Sustainable and Resilient Agriculture
Big streams of Earth images from satellites or other platforms (e.g., drones and mobile phones) are becoming increasingly available at low or no cost and with enhanced spatial and temporal resolution. This thesis recognizes the unprecedented opportunities offered by the high quality and open access Earth observation data of our times and introduces novel machine learning and big data methods to properly exploit them towards developing applications for sustainable and resilient agriculture. The thesis addresses three distinct thematic areas, i.e., the monitoring of the Common Agricultural Policy (CAP), the monitoring of food security and applications for smart and resilient agriculture. The methodological innovations of the developments related to the three thematic areas address the following issues: i) the processing of big Earth Observation (EO) data, ii) the scarcity of annotated data for machine learning model training and iii) the gap between machine learning outputs and actionable advice. This thesis demonstrated how big data technologies such as data cubes, distributed learning, linked open data and semantic enrichment can be used to exploit the data deluge and extract knowledge to address real user needs. Furthermore, this thesis argues for the importance of semi-supervised and unsupervised machine learning models that circumvent the ever-present challenge of scarce annotations and thus allow for model generalization in space and time. Specifically, it is shown how merely few ground truth data are needed to generate high quality crop type maps and crop phenology estimations. Finally, this thesis argues there is considerable distance in value between model inferences and decision making in real-world scenarios and thereby showcases the power of causal and interpretable machine learning in bridging this gap.
Intelligent Computing: The Latest Advances, Challenges and Future
Zhu, Shiqiang, Yu, Ting, Xu, Tao, Chen, Hongyang, Dustdar, Schahram, Gigan, Sylvain, Gunduz, Deniz, Hossain, Ekram, Jin, Yaochu, Lin, Feng, Liu, Bo, Wan, Zhiguo, Zhang, Ji, Zhao, Zhifeng, Zhu, Wentao, Chen, Zuoning, Durrani, Tariq, Wang, Huaimin, Wu, Jiangxing, Zhang, Tongyi, Pan, Yunhe
Computing is a critical driving force in the development of human civilization. In recent years, we have witnessed the emergence of intelligent computing, a new computing paradigm that is reshaping traditional computing and promoting digital revolution in the era of big data, artificial intelligence and internet-of-things with new computing theories, architectures, methods, systems, and applications. Intelligent computing has greatly broadened the scope of computing, extending it from traditional computing on data to increasingly diverse computing paradigms such as perceptual intelligence, cognitive intelligence, autonomous intelligence, and human-computer fusion intelligence. Intelligence and computing have undergone paths of different evolution and development for a long time but have become increasingly intertwined in recent years: intelligent computing is not only intelligence-oriented but also intelligence-driven. Such cross-fertilization has prompted the emergence and rapid advancement of intelligent computing. Intelligent computing is still in its infancy and an abundance of innovations in the theories, systems, and applications of intelligent computing are expected to occur soon. We present the first comprehensive survey of literature on intelligent computing, covering its theory fundamentals, the technological fusion of intelligence and computing, important applications, challenges, and future perspectives. We believe that this survey is highly timely and will provide a comprehensive reference and cast valuable insights into intelligent computing for academic and industrial researchers and practitioners.
Unsupervised Explanation Generation via Correct Instantiations
Cheng, Sijie, Wu, Zhiyong, Chen, Jiangjie, Li, Zhixing, Liu, Yang, Kong, Lingpeng
While large pre-trained language models (PLM) have shown their great skills at solving discriminative tasks, a significant gap remains when compared with humans for explanation-related tasks. Among them, explaining the reason why a statement is wrong (e.g., against commonsense) is incredibly challenging. The major difficulty is finding the conflict point, where the statement contradicts our real world. This paper proposes Neon, a two-phrase, unsupervised explanation generation framework. Neon first generates corrected instantiations of the statement (phase I), then uses them to prompt large PLMs to find the conflict point and complete the explanation (phase II). We conduct extensive experiments on two standard explanation benchmarks, i.e., ComVE and e-SNLI. According to both automatic and human evaluations, Neon outperforms baselines, even for those with human-annotated instantiations. In addition to explaining a negative prediction, we further demonstrate that Neon remains effective when generalizing to different scenarios.
Prolog-based agnostic explanation module for structured pattern classification
Nรกpoles, Gonzalo, Hoitsma, Fabian, Knoben, Andreas, Jastrzebska, Agnieszka, Espinosa, Maikel Leon
This paper presents a Prolog-based reasoning module to generate counterfactual explanations given the predictions computed by a black-box classifier. The proposed symbolic reasoning module can also resolve what-if queries using the ground-truth labels instead of the predicted ones. Overall, our approach comprises four well-defined stages that can be applied to any structured pattern classification problem. Firstly, we pre-process the given dataset by imputing missing values and normalizing the numerical features. Secondly, we transform numerical features into symbolic ones using fuzzy clustering such that extracted fuzzy clusters are mapped to an ordered set of predefined symbols. Thirdly, we encode instances as a Prolog rule using the nominal values, the predefined symbols, the decision classes, and the confidence values. Fourthly, we compute the overall confidence of each Prolog rule using fuzzy-rough set theory to handle the uncertainty caused by transforming numerical quantities into symbols. This step comes with an additional theoretical contribution to a new similarity function to compare the previously defined Prolog rules involving confidence values. Finally, we implement a chatbot as a proxy between human beings and the Prolog-based reasoning module to resolve natural language queries and generate counterfactual explanations. During the numerical simulations using synthetic datasets, we study the performance of our system when using different fuzzy operators and similarity functions. Towards the end, we illustrate how our reasoning module works using different use cases.
Machine Learning for Software Engineering: A Tertiary Study
Kotti, Zoe, Galanopoulou, Rafaila, Spinellis, Diomidis
Through ML we can address SE problems that cannot be completely algorithmically modeled, or for which existing solutions do not provide satisfactory results yet (e.g., defect/fault detection [16, 165, 180]). In addition, ML finds application in SE tasks where data cannot be easily analyzed with other algorithms (e.g., software requirements, code comments, code reviews, issues [9, 91, 174]). Another important aspect of ML is that it can significantly reduce manual effort in common SE tasks (e.g., automatic program repair [157], code suggestion [61], defect prediction [19], malware detection [147], feature location [40]) with great accuracy results [146, 164]. In fields such as health informatics ML and SE are considered complementary disciplines, since the growing scale and complexity of healthcare datasets have posed a challenge for clinical practice and medical research, requiring new engineering approaches from both fields [38]. In the early nineties, Huff and Selfridge [68] recognized the need for creating software systems that partially take some responsibility for their own evolution, offering the ability to implement, measure, and assess changes easily. These changes should also contribute to the overall improvement of the corresponding systems [142].
Not Cheating on the Turing Test: Towards Grounded Language Learning in Artificial Intelligence
Recent hype surrounding the increasing sophistication of language processing models has renewed optimism regarding machines achieving a human-like command of natural language. Research in the area of natural language understanding (NLU) in artificial intelligence claims to have been making great strides in this area, however, the lack of conceptual clarity/consistency in how 'understanding' is used in this and other disciplines makes it difficult to discern how close we actually are. In this interdisciplinary research thesis, I integrate insights from cognitive science/psychology, philosophy of mind, and cognitive linguistics, and evaluate it against a critical review of current approaches in NLU to explore the basic requirements--and remaining challenges--for developing artificially intelligent systems with human-like capacities for language use and comprehension.
Explainable, Domain-Adaptive, and Federated Artificial Intelligence in Medicine
Chaddad, Ahmad, lu, Qizong, Li, Jiali, Katib, Yousef, Kateb, Reem, Tanougast, Camel, Bouridane, Ahmed, Abdulkadir, Ahmed
Artificial intelligence (AI) continues to transform data analysis in many domains. Progress in each domain is driven by a growing body of annotated data, increased computational resources, and technological innovations. In medicine, the sensitivity of the data, the complexity of the tasks, the potentially high stakes, and a requirement of accountability give rise to a particular set of challenges. In this review, we focus on three key methodological approaches that address some of the particular challenges in AI-driven medical decision making. (1) Explainable AI aims to produce a human-interpretable justification for each output. Such models increase confidence if the results appear plausible and match the clinicians expectations. However, the absence of a plausible explanation does not imply an inaccurate model. Especially in highly non-linear, complex models that are tuned to maximize accuracy, such interpretable representations only reflect a small portion of the justification. (2) Domain adaptation and transfer learning enable AI models to be trained and applied across multiple domains. For example, a classification task based on images acquired on different acquisition hardware. (3) Federated learning enables learning large-scale models without exposing sensitive personal health information. Unlike centralized AI learning, where the centralized learning machine has access to the entire training data, the federated learning process iteratively updates models across multiple sites by exchanging only parameter updates, not personal health data. This narrative review covers the basic concepts, highlights relevant corner-stone and state-of-the-art research in the field, and discusses perspectives.
Speeding Up Recommender Systems Using Association Rules
Kannout, Eyad, Nguyen, Hung Son, Grzegorowski, Marek
Recommender systems are considered one of the most rapidly growing branches of Artificial Intelligence. The demand for finding more efficient techniques to generate recommendations becomes urgent. However, many recommendations become useless if there is a delay in generating and showing them to the user. Therefore, we focus on improving the speed of recommendation systems without impacting the accuracy. In this paper, we suggest a novel recommender system based on Factorization Machines and Association Rules (FMAR). We introduce an approach to generate association rules using two algorithms: (i) apriori and (ii) frequent pattern (FP) growth. These association rules will be utilized to reduce the number of items passed to the factorization machines recommendation model. We show that FMAR has significantly decreased the number of new items that the recommender system has to predict and hence, decreased the required time for generating the recommendations. On the other hand, while building the FMAR tool, we concentrate on making a balance between prediction time and accuracy of generated recommendations to ensure that the accuracy is not significantly impacted compared to the accuracy of using factorization machines without association rules.