Report an accessibility problem
Efficient and Safe Learning of Probably Approximately Complete Action Models, January 21, 2021 - updated flyerEfficient and Safe Learning of Probably Approximately Complete Action Models, January 21, 2021 - updated flyer

Download the flyer.

Join us for the first School of Computing and Augmented Intelligence Spring ’22 Seminar Series event hosted by Assistant Professor Siddharth Srivastava in which Washington University, St. Louis Associate Professor Brendan Juba discusses algorithms for learning action models. 

Efficient and Safe Learning of Probably Approximately Complete Action Models
Presented by Brendan Juba, Washington University, St. Louis

Friday, January 21, 2022
11 a.m.–noon — ***new time!***
Attend on Zoom — ***updated from Brickyard!***

Abstract

In domain-independent planning, we must supply an action model that describes how the acting agent interacts with its environment. Specifying these action models can be a difficult knowledge engineering task. A natural alternative to knowledge engineering by hand is to use examples of how to solve problems in the domain to learn an action model. For example, such examples may be provided by a human operator. However, popular model learning approaches do not guarantee that the effects of an action in the model will match those in the actual environment; indeed, in some cases, the model may indicate that an action can be performed when in actuality it will fail. In this sense, the learned action model is not safe to use. In some settings, such failures are not acceptable. In this talk, Brendan Juba will propose algorithms for learning action models that do guarantee safety. Although the price of safety is that sometimes for a solvable problem, the model may be inadequate to express any successful plan, he shows that when given a number of demonstrations that scale linearly with the possible size of the action model, with high probability, new problems will be solvable in the learned model. Moreover, the algorithms are also guaranteed to run in polynomial time as well. This talk is based on joint work with Roni Stern and Hai Son Le.

About the speaker

Brendan Juba is an associate professor in the Department of Computer Science and Engineering at Washington University in St. Louis. His current research interests lie in theoretical approaches to artificial intelligence, founded on the theory of algorithms and computational complexity, and is also interested in theoretical computer science more broadly construed. He is the author of “Universal Semantic Communication,” concerning methods for communication without a common language. He was the recipient of a 2015 AFOSR Young Investigator Award and an NSF CAREER Award in 2020.

Comments are closed.

  • Features

  • Follow us on Twitter

  • Fulton Engineering on Social Media

  • In the Loop

    In the Loop is an online news site for the faculty and staff of the Fulton Schools of Engineering at ASU.
Site Unavailable

Sorry, there's a problem displaying your content right now.

We'll have your content up and running soon. For more details, visit ASU System Health.

In the meantime, please try any of the links below:

Bad gateway

The web server reported a bad gateway error.

  • Ray ID: 7244ee26496c2c2c
  • Your IP address: 167.82.237.147
  • Error reference number: 502
  • Cloudflare Location: Chicago