Alert button
Picture for David W. Aha

David W. Aha

Alert button

Interpretable ML for Imbalanced Data

Dec 15, 2022
Damien A. Dablain, Colin Bellinger, Bartosz Krawczyk, David W. Aha, Nitesh V. Chawla

Figure 1 for Interpretable ML for Imbalanced Data
Figure 2 for Interpretable ML for Imbalanced Data
Figure 3 for Interpretable ML for Imbalanced Data
Figure 4 for Interpretable ML for Imbalanced Data

Deep learning models are being increasingly applied to imbalanced data in high stakes fields such as medicine, autonomous driving, and intelligence analysis. Imbalanced data compounds the black-box nature of deep networks because the relationships between classes may be highly skewed and unclear. This can reduce trust by model users and hamper the progress of developers of imbalanced learning algorithms. Existing methods that investigate imbalanced data complexity are geared toward binary classification, shallow learning models and low dimensional data. In addition, current eXplainable Artificial Intelligence (XAI) techniques mainly focus on converting opaque deep learning models into simpler models (e.g., decision trees) or mapping predictions for specific instances to inputs, instead of examining global data properties and complexities. Therefore, there is a need for a framework that is tailored to modern deep networks, that incorporates large, high dimensional, multi-class datasets, and uncovers data complexities commonly found in imbalanced data (e.g., class overlap, sub-concepts, and outlier instances). We propose a set of techniques that can be used by both deep learning model users to identify, visualize and understand class prototypes, sub-concepts and outlier instances; and by imbalanced learning algorithm developers to detect features and class exemplars that are key to model performance. Our framework also identifies instances that reside on the border of class decision boundaries, which can carry highly discriminative information. Unlike many existing XAI techniques which map model decisions to gray-scale pixel locations, we use saliency through back-propagation to identify and aggregate image color bands across entire classes. Our framework is publicly available at \url{https://github.com/dd1github/XAI_for_Imbalanced_Learning}

Viaarxiv icon

Self-directed Learning of Action Models using Exploratory Planning

Mar 07, 2022
Dustin Dannenhauer, Matthew Molineaux, Michael W. Floyd, Noah Reifsnyder, David W. Aha

Figure 1 for Self-directed Learning of Action Models using Exploratory Planning
Figure 2 for Self-directed Learning of Action Models using Exploratory Planning
Figure 3 for Self-directed Learning of Action Models using Exploratory Planning
Figure 4 for Self-directed Learning of Action Models using Exploratory Planning

Complex, real-world domains may not be fully modeled for an agent, especially if the agent has never operated in the domain before. The agent's ability to effectively plan and act in such a domain is influenced by its knowledge of when it can perform specific actions and the effects of those actions. We describe a novel exploratory planning agent that is capable of learning action preconditions and effects without expert traces or a given goal. The agent's architecture allows it to perform both exploratory actions as well as goal-directed actions, which opens up important considerations for how exploratory planning and goal planning should be controlled, as well as how the agent's behavior should be explained to any teammates it may have. The contributions of this work include a new representation for contexts called Lifted Linked Clauses, a novel exploration action selection approach using these clauses, an exploration planner that uses lifted linked clauses as goals in order to reach new states, and an empirical evaluation in a scenario from an exploration-focused video game demonstrating that lifted linked clauses improve exploration and action model learning against non-planning baseline agents.

* Presented at The Ninth Advances in Cognitive Systems (ACS) Conference 2021 (arXiv:2201.06134) 
Viaarxiv icon

Dungeon Crawl Stone Soup as an Evaluation Domain for Artificial Intelligence

Feb 05, 2019
Dustin Dannenhauer, Michael W. Floyd, Jonathan Decker, David W. Aha

Figure 1 for Dungeon Crawl Stone Soup as an Evaluation Domain for Artificial Intelligence
Figure 2 for Dungeon Crawl Stone Soup as an Evaluation Domain for Artificial Intelligence

Dungeon Crawl Stone Soup is a popular, single-player, free and open-source rogue-like video game with a sufficiently complex decision space that makes it an ideal testbed for research in cognitive systems and, more generally, artificial intelligence. This paper describes the properties of Dungeon Crawl Stone Soup that are conducive to evaluating new approaches of AI systems. We also highlight an ongoing effort to build an API for AI researchers in the spirit of recent game APIs such as MALMO, ELF, and the Starcraft II API. Dungeon Crawl Stone Soup's complexity offers significant opportunities for evaluating AI and cognitive systems, including human user studies. In this paper we provide (1) a description of the state space of Dungeon Crawl Stone Soup, (2) a description of the components for our API, and (3) the potential benefits of evaluating AI agents in the Dungeon Crawl Stone Soup video game.

* AAAI-19 Workshop on Games and Simulations for Artificial Intelligence 
Viaarxiv icon

Cost-Optimal Algorithms for Planning with Procedural Control Knowledge

Jul 07, 2016
Vikas Shivashankar, Ron Alford, Mark Roberts, David W. Aha

Figure 1 for Cost-Optimal Algorithms for Planning with Procedural Control Knowledge
Figure 2 for Cost-Optimal Algorithms for Planning with Procedural Control Knowledge
Figure 3 for Cost-Optimal Algorithms for Planning with Procedural Control Knowledge
Figure 4 for Cost-Optimal Algorithms for Planning with Procedural Control Knowledge

There is an impressive body of work on developing heuristics and other reasoning algorithms to guide search in optimal and anytime planning algorithms for classical planning. However, very little effort has been directed towards developing analogous techniques to guide search towards high-quality solutions in hierarchical planning formalisms like HTN planning, which allows using additional domain-specific procedural control knowledge. In lieu of such techniques, this control knowledge often needs to provide the necessary search guidance to the planning algorithm, which imposes a substantial burden on the domain author and can yield brittle or error-prone domain models. We address this gap by extending recent work on a new hierarchical goal-based planning formalism called Hierarchical Goal Network (HGN) Planning to develop the Hierarchically-Optimal Goal Decomposition Planner (HOpGDP), an HGN planning algorithm that computes hierarchically-optimal plans. HOpGDP is guided by $h_{HL}$, a new HGN planning heuristic that extends existing admissible landmark-based heuristics from classical planning to compute admissible cost estimates for HGN planning problems. Our experimental evaluation across three benchmark planning domains shows that HOpGDP compares favorably to both optimal classical planners due to its ability to use domain-specific procedural knowledge, and a blind-search version of HOpGDP due to the search guidance provided by $h_{HL}$.

* To appear in the Proc. of ECAI 2016 
Viaarxiv icon

Keypoint Density-based Region Proposal for Fine-Grained Object Detection and Classification using Regions with Convolutional Neural Network Features

Mar 01, 2016
JT Turner, Kalyan Gupta, Brendan Morris, David W. Aha

Figure 1 for Keypoint Density-based Region Proposal for Fine-Grained Object Detection and Classification using Regions with Convolutional Neural Network Features
Figure 2 for Keypoint Density-based Region Proposal for Fine-Grained Object Detection and Classification using Regions with Convolutional Neural Network Features
Figure 3 for Keypoint Density-based Region Proposal for Fine-Grained Object Detection and Classification using Regions with Convolutional Neural Network Features
Figure 4 for Keypoint Density-based Region Proposal for Fine-Grained Object Detection and Classification using Regions with Convolutional Neural Network Features

Although recent advances in regional Convolutional Neural Networks (CNNs) enable them to outperform conventional techniques on standard object detection and classification tasks, their response time is still slow for real-time performance. To address this issue, we propose a method for region proposal as an alternative to selective search, which is used in current state-of-the art object detection algorithms. We evaluate our Keypoint Density-based Region Proposal (KDRP) approach and show that it speeds up detection and classification on fine-grained tasks by 100% versus the existing selective search region proposal technique without compromising classification accuracy. KDRP makes the application of CNNs to real-time detection and classification feasible.

* 9 pages, 5 figures, 3 tables 
Viaarxiv icon

Spontaneous Analogy by Piggybacking on a Perceptual System

Oct 10, 2013
Marc Pickett, David W. Aha

Figure 1 for Spontaneous Analogy by Piggybacking on a Perceptual System
Figure 2 for Spontaneous Analogy by Piggybacking on a Perceptual System
Figure 3 for Spontaneous Analogy by Piggybacking on a Perceptual System
Figure 4 for Spontaneous Analogy by Piggybacking on a Perceptual System

Most computational models of analogy assume they are given a delineated source domain and often a specified target domain. These systems do not address how analogs can be isolated from large domains and spontaneously retrieved from long-term memory, a process we call spontaneous analogy. We present a system that represents relational structures as feature bags. Using this representation, our system leverages perceptual algorithms to automatically create an ontology of relational structures and to efficiently retrieve analogs for new relational structures from long-term memory. We provide a demonstration of our approach that takes a set of unsegmented stories, constructs an ontology of analogical schemas (corresponding to plot devices), and uses this ontology to efficiently find analogs within new stories, yielding significant time-savings over linear analog retrieval at a small accuracy cost.

* Proceedings of the 35th Meeting of the Cognitive Science Society, 2013 
Viaarxiv icon

Transforming Graph Representations for Statistical Relational Learning

Mar 30, 2012
Ryan A. Rossi, Luke K. McDowell, David W. Aha, Jennifer Neville

Figure 1 for Transforming Graph Representations for Statistical Relational Learning
Figure 2 for Transforming Graph Representations for Statistical Relational Learning
Figure 3 for Transforming Graph Representations for Statistical Relational Learning
Figure 4 for Transforming Graph Representations for Statistical Relational Learning

Relational data representations have become an increasingly important topic due to the recent proliferation of network datasets (e.g., social, biological, information networks) and a corresponding increase in the application of statistical relational learning (SRL) algorithms to these domains. In this article, we examine a range of representation issues for graph-based relational data. Since the choice of relational data representation for the nodes, links, and features can dramatically affect the capabilities of SRL algorithms, we survey approaches and opportunities for relational representation transformation designed to improve the performance of these algorithms. This leads us to introduce an intuitive taxonomy for data representation transformations in relational domains that incorporates link transformation and node transformation as symmetric representation tasks. In particular, the transformation tasks for both nodes and links include (i) predicting their existence, (ii) predicting their label or type, (iii) estimating their weight or importance, and (iv) systematically constructing their relevant features. We motivate our taxonomy through detailed examples and use it to survey and compare competing approaches for each of these tasks. We also discuss general conditions for transforming links, nodes, and features. Finally, we highlight challenges that remain to be addressed.

Viaarxiv icon