PARC
A Recap of the AAAI and IAAI 2018 Conferences and the EAAI Symposium
McIlraith, Sheila (University of Toronto) | Weinberger, Kilian (Cornell University) | Youngblood, G. Michael (PARC) | Myers, Karen (SRI International) | Eaton, Eric (University of Pennsylvania) | Wollowski, Michael (Rose-Hulman Institute of Technology)
The 2018 AAAI Conference on Artificial Intelligence, the 2018 Innovative Applications of Artificial Intelligence, and the 2018 Symposium on Educational Advances in Artificial Intelligence were held February 2–7, 2018 at the Hilton New Orleans Riverside, New Orleans, Louisiana, USA.  This report, based on the prefaces contained in the AAAI-18 proceedings and program, summarizes the events of the conference.
Learning Fast and Slow: Levels of Learning in General Autonomous Intelligent Agents
Laird, John E. (University of Michigan) | Mohan, Shiwali (PARC)
We propose two distinct levels of learning for general autonomous intelligent agents. Level 1 consists of fixed architectural learning mechanisms that are innate and automatic. Level 2 consists of deliberate learning strategies that are controlled by the agent's knowledge. We describe these levels and provide an example of their use in a task-learning agent. We also explore other potential levels and discuss the implications of this view of learning for the design of autonomous agents.
Stochastic Search In Changing Situations
Abdolmaleki, Abbas (University of Aveiro) | Simoes, David (University of Aveiro) | Lau, Nuno (University of Aveiro) | Reis, Luis Paulo (University of Minho) | Price, Bob (PARC) | Neumann, Gerhard (Technische Universität Darmstadt)
Stochastic search algorithms are black-box optimizer of an objective function. They have recently gained a lot of attention in operations research, machine learning and policy search of robot motor skills due to their ease of use and their generality. However, when the task or objective function slightly changes, many stochastic search algorithms require complete re-learning in order to adapt thesolution to the new objective function or the new context. As such, we consider the contextual stochastic search paradigm. Here, we want to find good parameter vectors for multiple related tasks, where each task is described by a continuous context vector. Hence, the objective function might change slightly for each parameter vector evaluation. In this paper, we investigate a contextual stochastic search algorithm known as Contextual Relative Entropy Policy Search (CREPS), an information-theoretic algorithm that can learn from multiple tasks simultaneously. We show the application of CREPS for simulated robotic tasks.
Introduction to the Special Issue on Innovative Applications of Artificial Intelligence 2015
Gunning, David (PARC) | Yeh, Peter Z. (Nuance Communications)
This issue features expanded versions of articles selected from the 2015 AAAI Conference on Innovative Applications of Artificial Intelligence held in Austin, Texas. We present a selection of four articles describing deployed applications plus two more articles that discuss work on emerging applications.
Introduction to the Special Issue on Innovative Applications of Artificial Intelligence 2015
Gunning, David (PARC) | Yeh, Peter Z. (Nuance Communications)
The 2015 conference continued the tradition with a selection of 6 deployed applications describing systems in use by their intended end users, 13 emerging applications describing works in progress, and three papers in a new category for challenge problems. In the first article, Activity Planning for a Lunar Orbital Mission, John Bresina describes a deployed application of current planning technology in the context of a NASA mission called LADEE (Lunar Atmospheric and Dust Environment Explorer). Bresina presents an approach taken to reduce the complexity of the activity-planning task in order to perform it effectively under the time pressures imposed by the mission requirements. One key aspect of this approach is the design of the activity-planning process based on principles of problem decomposition and planning abstraction levels. The second key aspect is the mixed-initiative system developed for this task, the LADEE activity scheduling system (LASS). The primary challenge for LASS was representing and managing the science constraints that were tied to key points in the spacecraft's orbit, given their dynamic nature due to the continually updated orbit determination solution. In our second article, Helping Novices Avoid the Hazards of Data: Leveraging Ontologies to Improve Model Generalization Automatically with Online Data Source, Sasin Janpuangtong and Dylan Shell describe an emerging application of an endto-end learning framework for large-scale data analytics that allows a novice to create models from data easily by helping structure the model-building process.
Agent Requirements for Effective and Efficient Task-Oriented Dialog
Mohan, Shiwali (PARC) | Kirk, James Roberts (The University of Michigan) | Mininger, Aaron (The University of Michigan) | Laird, John (The University of Michigan)
Dialog is a useful way for a robotic agent performing a task to communicate with a human collaborator, as it is a rich source of information for both the agent and the human. Such task-oriented dialog provides a medium for commanding, informing, teaching, and correcting a robot. Robotic agents engaging in dialog must be able to interpret a wide variety of sentences and supplement the dialog with information from its context, history, learned knowledge, and from non-linguistic interactions. We have identified a set of nine system-level requirements for such agents that help them support more effective, efficient, and general task-oriented dialog. This set is inspired by our research in Interactive Task Learning with a robotic agent named Rosie. This paper defines each requirement and gives examples of work we have done that illustrates them.
Qualitative Reasoning with Modelica Models
Klenk, Matthew Evans (PARC) | Kleer, Johan de (PARC) | Bobrow, Daniel (PARC) | Janssen, Bill (PARC)
Qualitative reasoning can play an important role in early stage design. Currently, engineers explore the design space using simulation models built in languages such as Modelica. To make qualitative reasoning useful to them, designs specified in their languages must be translated into a qualitative modeling language for analysis. The contribution of this paper is a sound and effective mapping between Modelica and qualitative reasoning. To achieve a sound mapping, we extend envisioning, the process of generating all relevant qualitative behaviors, to support Modelica's declarative events. For an effective mapping, we identify three classes of additional constraints that should be inferred from the Modelica representation thereby exponentially reducing the number of unrealizable trajectories. We support this contribution with examples and a case study.
The Annual Computer Poker Competition
Bard, Nolan (University of Alberta) | Hawkin, John (Verafin) | Rubin, Jonathan (PARC) | Zinkevich, Martin (Google)
Now entering its eighth year, the Annual Computer Poker Competition (ACPC) is the premier event within the field of computer poker. With both academic and nonacademic competitors from around the world, the competition provides an open and international venue for benchmarking computer poker agents. We describe the competition's origins and evolution, current events, and winning techniques.
The Annual Computer Poker Competition
Bard, Nolan (University of Alberta) | Hawkin, John (Verafin) | Rubin, Jonathan (PARC) | Zinkevich, Martin (Google)
Now entering its eighth year, the Annual Computer Poker Competition (ACPC) is the premier event within the field of computer poker. With both academic and nonacademic competitors from around the world, the competition provides an open and international venue for benchmarking computer poker agents. We describe the competition’s origins and evolution, current events, and winning techniques.
Design and Deployment of a Personalized News Service
Stefik, Mark (PARC) | Good, Lange (Google, Inc.)
From 2008-2010 we built an experimental personalized news system where readers subscribe to organized channels of topical information that are curated by experts. AI technology was employed to efficiently present the right information to each reader and to radically reduce the workload of curators. The system went through three implementation cycles and processed over 20 million news stories from about 12,000 RSS feeds on over 8000 topics organized by 160 curators for over 600 registered readers. This paper describes the approach, engineering and AI technology of the system.