IRIA: The Information Research Intelligent Assistant

The explosion of information in the modern environment demands the ability to collect, organize, manage, and search large amounts of information across a wide variety of real-world applications. The primary tools available for such tasks are large-scale database systems and keyword-based document search techniques. However, such tools are rapidly proving inadequate: traditional database systems do not enable ready access to relevant knowledge, prompting a market of add-ons and existing search techniques are insufficiently precise or selective to support such tasks, leading to consumer exasperation. In the end users are left unsatisfied, confronted with a sea of unorganized and unhelpful data. A new approach is needed.

The Information Research Intelligent Assistant (IRIA) is an integrated information retrieval architecture that addresses this problem. IRIA enables a user or workgroup to build a personalized map of the relevant information available in a database, intranet, or internet, and the ability to find, add, and use information quickly and easily. An IRIA-based intelligent information management system acts as an autonomous assistant to a user working on a task, working unobtrusively in the background to learn both the user’s interests and the resources available to satisfy those interests. This approach enables “reminding engines” which monitor a user’s work to proactively find and recommend useful information as well as “workgroup memories” which learn from a user’s behavior to build a comprehensive knowledge map of a particular area of interest.

In empirical tests, IRIA has demonstrated the ability to monitor a user’s progress on a task (specifically, web search) and proactively find and recommend information relevant to that task based on the context and history of the user’s interactions with the system. IRIA further demonstrated that it could provide collaborative facilities to the workgroup and that it could learn and improve its knowledge map over time.

Read the paper:

IRIA: The Information Research Intelligent Assistant

by Anthony Francis, Mark Devaney, Ashwin Ram

International Conference on Artificial Intelligence (ICAI-00), Las Vegas, Nevada
www.dresan.com/research/publications/icai-2000.html

Context-Sensitive Asynchronous Memory

Retrieving useful answers from large knowledge bases given under-specified questions is an important problem in the construction of general intelligent agents. The core of this problem is how to get the information an agent needs when it doesn’t know how to ask the right question and doesn’t have the time to exhaustively search all available information.

Context-sensitive asynchronous memory is a model of memory retrieval that solves this problem. The context-sensitive asynchronous memory approach exploits feedback from the task and environment to guide and constrain memory search by interleaving memory retrieval and problem solving. To achieve this behavior, a context-sensitive asynchronous memory uses an asynchronous retrieval system to manage a context- sensitive search process operating over a content-addressable knowledge base. Solutions based on this approach provide useful answers to vague questions efficiently, based on information naturally available during the performance of a task.

The core claims of this approach are:
•  Claim 1: An efficient, domain-independent solution to the problem of retrieving useful answers from large knowledge bases given under-specified queries is to interleave memory retrieval with task performance and use feedback from the task or environment to guide the search of memory.
•  Claim 2: Interleaving memory retrieval with and exploiting feedback from task performance can be achieved in a domain-independent way using a context- sensitive, asynchronous memory retrieval process.
•  Claim 3: A rich, reified, grounded semantic network representation enables context-sensitive memory retrieval processes to retrieve useful information in a domain-independent way for a wide variety of tasks.
•  Claim 4: To effectively use a context-sensitive asynchronous memory to retrieve useful answers, a task must be able to work in parallel with a memory process, communicate with it, provide feedback to it, and must possess integration mechanisms to incorporate asynchronous retrievals provided by the memory.

The context-sensitive asynchronous memory approach is applicable to tasks and domains which exhibit the following criteria: problems are difficult to solve, questions are difficult to formulate, a large knowledge base is available yet contains only a small selection of relevant information, and, most importantly, the environment is regular, in that solutions in the knowledge base occur in patterns and relationships similar to those found in situations in which the solutions are likely to be applicable in the future. This approach is domain independent: it is applicable to a wide variety of tasks and problems from simple search applications to complex cognitive agents.

To exploit context-sensitive asynchronous memory, reasoners need certain properties. Experience-based agency is an agent architecture which provides an outline of how to construct complete intelligent agents which use a context-sensitive asynchronous memory to support a reasoning system performing a real task. The experience-based agent architecture combines a context-sensitive asynchronous memory retrieval process with a global store of experience used by all agent processes, a global working memory to provide a uniform way to collect feedback, and a global task controller which orchestrates reasoning and memory. The experience-based agent architecture also provides principles for constructing integration mechanisms that enable reasoning tasks to work with the context-sensitive asynchronous memory.

Furthermore, to help determine when these approaches should be used, this research also contributes theoretical analyses that predict the classes of tasks and situations in which the context-sensitive asynchronous memory and experience-based agent approaches will provide the greatest benefit.

To evaluate the approach, the experience-based agent architecture has been implemented in the Nicole system. Nicole is a large Common Lisp program providing global long-term and working memory stores represented as a rich, reified, grounded semantic network, a context-sensitive asynchronous memory process based on a novel model of context-directed spreading activation, a control system for orchestrating reasoning and memory, and a task language to implement reasoning tasks. Nicole enables the context-sensitive asynchronous memory approach to be applied to real problems, including information retrieval in Nicole-IRIA, a information management application that uses context to recommend useful information (Francis et al. 2000), planning in Nicole-MPA, a case-based least-commitment planner that adapts multiple plans (Ram & Francis 1995) and language understanding in ISAAC (Moorman 1997), a story understanding system which uses Nicole’s retrieval system as part of its creative understanding process. Nicole and her children thus provide a testbed to evaluate the context-sensitive asynchronous memory approach.

Experiments with Nicole support the claims of the approach. Experiments with Nicole-IRIA demonstrate that a context-sensitive asynchronous memory can use feedback from browsing to improve the quality of memory retrieval, while experiments with Nicole-MPA demonstrate how information derived from reasoning can improve the quantity of retrieval. The use of Nicole’s memory in the ISAAC system demonstrates the generality of the context-sensitive asynchronous memory approach. Other experiments with Nicole-MPA demonstrate the importance of representation as a source of power for context-sensitive asynchronous memory, and further demonstrate that the core features of the experience-based agent architecture are crucial sources of power necessary to enable a reasoning task to work with and exploit a context-sensitive asynchronous memory.

In sum, these evaluations demonstrate that the context-sensitive asynchronous memory approach is a general approach to memory retrieval which can provide concrete benefits to real problems.

Read the thesis:

Context-Sensitive Asynchronous Memory

by Anthony Francis

PhD Thesis, College of Computing, Georgia Institute of Technology, Atlanta, GA, 2000
www.cc.gatech.edu/faculty/ashwin/papers/git-cc-00-01.pdf

Introspective Multistrategy Learning: On the Construction of Learning Strategies

A central problem in multistrategy learning systems is the selection and sequencing of machine learning algorithms for particular situations. This is typically done by the system designer who analyzes the learning task and implements the appropriate algorithm or sequence of algorithms for that task. We propose a solution to this problem which enables an AI system with a library of machine learning algorithms to select and sequence appropriate algorithms autonomously. Furthermore, instead of relying on the system designer or user to provide a learning goal or target concept to the learning system, our method enables the system to determine its learning goals based on analysis of its successes and failures at the performance task.

The method involves three steps: Given a performance failure, the learner examines a trace of its reasoning prior to the failure to diagnose what went wrong (blame assignment); given the resultant explanation of the reasoning failure, the learner posts explicitly represented learning goals to change its background knowledge (deciding what to learn); and given a set of learning goals, the learner uses nonlinear planning techniques to assemble a sequence of machine learning algorithms, represented as planning operators, to achieve the learning goals (learning-strategy construction). In support of these operations, we define the types of reasoning failures, a taxonomy of failure causes, a second-order formalism to represent reasoning traces, a taxonomy of learning goals that specify desired change to the background knowledge of a system, and a declarative task-formalism representation of learning algorithms.

We present the Meta-AQUA system, an implemented multistrategy learner that operates in the domain of story understanding. Extensive empirical evaluations of Meta-AQUA show that it performs significantly better in a deliberative, planful mode than in a reflexive mode in which learning goals are ablated and, furthermore, that the arbitrary ordering of learning algorithms can lead to worse performance than no learning at all. We conclude that explicit representation and sequencing of learning goals is necessary for avoiding negative interactions between learning algorithms that can lead to less effective learning.

Read the paper:

Introspective Multistrategy Learning: On the Construction of Learning Strategies

by Mike Cox, Ashwin Ram

Artificial Intelligence, 112:1-55, 1999
www.cc.gatech.edu/faculty/ashwin/papers/er-99-01.pdf

Understanding Language Understanding: Computional Models of Reading

This book highlights cutting-edge research relevant to the building of a computational model of reading comprehension, as in the processing and understanding of a natural language text or story. A distinguishing feature of the book is its emphasis on “real” understanding of “real” narrative texts rather than on syntactic parsing of single sentences taken out of context or on limited understanding of small, researcher-constructed stories.

The book takes an interdisciplinary approach to the study of reading, with contributions from computer science, psychology, and philosophy. Contributors cover the theoretical and psychological foundations of the research in discussions of what it means to understand a text, how one builds a computational model, and related issues in knowledge representation and reasoning. The book also addresses some of the broader issues that a natural language system must deal with, such as reading in context, linguistic novelty, and information extraction.

Contributors:
Dorrit Billman, Michael T. Cox, Eric Domeshek, Kurt Eiselt, Charles R. Fletcher, Richard Gerrig, Jennifer Holbrook, Eric Jones, Trent Lange, Mark Langston, Joe Magliano, Kavi Mahesh, Bonnie J. F. Meyer, Justin Peterson, William J. Rapaport, Ellen Riloff, Stuart C. Shapiro, Tom Trabasso, Charles M. Wharton.

Find the book:

Understanding Language Understanding: Computional Models of Reading

edited by Ashwin Ram, Kenneth Moorman

MIT Press, Cambridge, MA, 1999, ISBN 978-0-262-18192-1
mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=3953

Preview the book: books.google.com/books?id=sL9Lsy3bDecC

Table of Contents

About the Editors

About the Authors
Foreword
Chapter 1 (Introduction) Toward a Theory of Reading and Understanding, Ram, Moorman
Chapter 2 (Foundations) Cognition and Fiction, Rapaport, Shapiro
Chapter 3 (Sentence Processing) Sentence Processing in Understanding: Interaction and Integration of Knowledge Sources, Mahesh, Eiselt, Holbrook
Chapter 4 (Knowledge Representation) Capturing the Contents of Complex Narratives, Domeshek, Jones, Ram
Chapter 5 (Memory and Inference) Retrieval from Episodic Memory by Inferencing and Disambiguation, Lange, Wharton
Chapter 6 (Inference and Comprehension) A Connectionist Model of Narrative Comprehension, Langston, Trabasso, Magliano
Chapter 7 (Contextualization: Text Structure) Importance of Text Structure in Everyday Reading, Meyer
Chapter 8 (Contextualization: Goals) A Theory of Questions and Question Asking, Ram
Chapter 9 (Linguistic Novelty) Semantic Correspondence Theory, Peterson, Billman
Chapter 10 (Conceptual Novelty) Creativity in Reading: Understanding Novel Concepts, Moorman, Ram
Chapter 11 (Meta-Reasoning and Learning) On the Intersection of Story Understanding and Learning, Cox, Ram
Chapter 12 (Alternative Approaches) Information Extraction as a Stepping Stone toward Story Understanding, Riloff
Chapter 13 (Foundations Revisited) Text Processing and Narrative Worlds, Gerrig
Chapter 14 (Commentary) Computational Models of Reading and Understanding: What Good Are They?, Fletcher
Index

PML: Representing Procedural Domains for Multimedia Presentations

A central issue in the development of multimedia systems is the presentation of the information to the user of the system and how to best represent that information to the designer of the system. Typically, the designers create a system in which content and presentation are inseparably linked; specific presentations and navigational aids are chosen for each piece of content and hard-coded into the system.

We argue that the representation of content should be decoupled from the design of the presentation and navigational structure, both to facilitate modular system design and to permit the construction of dynamic multimedia systems that can determine appropriate presentations in a given situation on the fly. We propose a new markup language called PML (Procedural Markup Language) which allows the content to be represented in a flexible manner by specifying the knowledge structures, the underlying physical media, and the relationships between them using cognitive media roles. The PML description can then be translated into different presentations depending on such factors as the context, goals, presentation preferences, and expertise of the user.

Read the paper:

PML: Representing Procedural Domains for Multimedia Presentations

by Ashwin Ram, Rich Catrambone, Mark Guzdial, Colleen Kehoe, Scott McCrickard, John Stasko

IEEE Multimedia, 6(2):40-52, 1999
www.cc.gatech.edu/faculty/ashwin/papers/git-gvu-98-20.pdf

Needles in a Haystack: Plan Recognition in Large Spatial Domains Involving Multiple Agents

While plan recognition research has been applied to a wide variety of problems, it has largely made identical assumptions about the number of agents participating in the plan, the observability of the plan execution process, and the scale of the domain. We describe a method for plan recognition in a real-world domain involving large numbers of agents performing spatial maneuvers in concert under conditions of limited observability. These assumptions differ radically from those traditionally made in plan recognition and produce a problem which combines aspects of the fields of plan recognition, pattern recognition, and object tracking. We describe our initial solution which borrows and builds upon research from each of these areas, employing a pattern-directed approach to recognize individual movements and generalizing these to produce inferences of large-scale behavior.

Read the paper:

Needles in a Haystack: Plan Recognition in Large Spatial Domains Involving Multiple Agents

by Mark Devaney, Ashwin Ram

15th National Conference on Artificial Intelligence (AAAI-98), Madison, Wisconsin, July 1998
www.cc.gatech.edu/faculty/ashwin/papers/er-98-03.pdf

Integrating Robotic Technologies with JavaBots

Mobile robotics research advances through developments in theory, and implementation in hardware and software. While theory is important, this article is primarily concerned with hardware and software technologies. It is our view that significant strides can be made just be combining existing hardware and software tools. Thus the focus of this paper is answering the question: how can we more easily integrate robotic technologies?

We argue that the most effective approach is through standardized interfaces (APIs) to robotic hardware and software technologies (e.g., path planning toolkits). JavaBots is an example framework that provides this kind of integration in simulation and on robot ahrdware. A high-level common interface to sensors and actuators allows control systems to run on multiple simulated and real hardware platforms. Conversely, JavaBots supports the evaluation of competing control systems on the same hardware. In this article, we describe JavaBots and provide examples of robot systems built using it.

Read the paper:

Integrating Robotic Technologies with JavaBots

by Tucker Balch, Ashwin Ram

AAAI Spring Symposium on Integrating Robotic Research: Taking the Next Leap, Stanford, CA, March 1998
www.cc.gatech.edu/faculty/ashwin/papers/er-98-01.pdf

Cognitive Media and Hypermedia Learning Environment Design: A GOMS Model Analysis

In our research, we have been developing a design framework for educational multimedia, based on the cognitive aspects of the users of that information. Design based on “cognitive media” appeals to the particular cognitive aspects of learners, whereas design based on types of “physical media” appeals to particular sensory modalities. This framework informed the design of AlgoNet, a computer science educational hypermedia system that used cognitive media as its basic building blocks.

In this paper, we describe a model of student usage and learning with AlgoNet. This model, using the GOMS methodology, provided a useful description of the procedural knowledge required to interact with the AlgoNet system. In addition, our implemented simulations provided estimates of learning and execution times for several instances of the model. Together, the parameters in the simulations and their resulting estimates help clarify the impact of system design, and hence our design framework, on students’ browsing and learning strategies.

Read the paper:

Cognitive Media and Hypermedia Learning Environment Design: A GOMS Model Analysis

by Terry Shikano, Mimi Recker, Ashwin Ram

International Journal of Artificial Intelligence and Education, 9(1):1-17.
www.cc.gatech.edu/faculty/ashwin/papers/er-98-04.doc

Experiments with Reinforcement Learning in Problems with Continuous State and Action Spaces

A key element in the solution of reinforcement learning problems is the value function. The purpose of this function is to measure the long-term utility or value of any given state. The function is important because an agent can use this measure to decide what to do next. A common problem in reinforcement learning when applied to systems having continuous states and action spaces is that the value function must operate with a domain consisting of real-valued variables, which means that it should be able to represent the value of infinitely many state and action pairs. For this reason, function approximators are used to represent the value function when a close-form solution of the optimal policy is not available.

In this paper, we extend a previously proposed reinforcement learning algorithm so that it can be used with function approximators that generalize the value of individual experiences across both, state and action spaces. In particular, we discuss the benefits of using sparse coarse-coded function approximators to represent value functions and describe in detail three implementations: CMAC, instance-based, and case-based. Additionally, we discuss how function approximators having different degrees of resolution in different regions of the state and action spaces may influence the performance and learning efficiency of the agent.

We propose a simple and modular technique that can be used to implement function approximators with non-uniform degrees of resolution so that it can represent the value function with higher accuracy in important regions of the state and action spaces. We performed extensive experiments in the double integrator and pendulum swing up systems to demonstrate the proposed ideas.

Read the paper:

Experiments with Reinforcement Learning in Problems with Continuous State and Action Spaces

by Juan Santamaria, Rich Sutton, Ashwin Ram

Adaptive Behavior, 6(2):163-217, 1997
www.cc.gatech.edu/faculty/ashwin/papers/er-98-02.pdf

Invention as an Opportunistic Enterprise

This paper identifies goal handling processes that begin to account for the kind of processes involved in invention. We identify new kinds of goals with special properties and mechanisms for processing such goals, as well as means of integrating opportunism, deliberation, and social interaction into goal/plan processes. We focus on invention goals, which address significant enterprises associated with an inventor. Invention goals represent “seed” goals of an expert, around which the whole knowledge of an expert gets reorganized and grows more or less opportunistically. Invention goals reflect the idiosyncrasy of thematic goals among experts. They constantly increase the sensitivity of individuals for particular events that might contribute to their satisfaction.

Our exploration is based on a well-documented example: the invention of the telephone by Alexander Graham Bell. We propose mechanisms to explain: (1) how Bell’s early thematic goals gave rise to the new goals to invent the multiple telegraph and the telephone, and (2) how the new goals interacted opportunistically. Finally, we describe our computational model, ALEC, that accounts for the role of goals in invention.

Invention as an Opportunistic Enterprise

by Marin Simina, Janet Kolodner, Ashwin Ram, Michael Gorman

19th Annual Conference of the Cognitive Science Society, Stanford, CA, August 1997
www.cc.gatech.edu/faculty/ashwin/papers/git-cs-97-04.pdf