Learning Domain-Independent Planning Heuristics with Hypergraph Networks

The paper extends a deep learning model known as graph neural networks and uses it to learn generalised heuristics. We show that these heuristics generalise to problems with different goals, larger problems, and even problems from different domains than those we trained on. This is the first paper that successfully learns domain-independent heuristics.

Read More
COVIDSafe: 4 Weeks In Video

Watch the video of our webinar on COVIDSafe, 4 weeks in, here. Seth Lazar chaired a discussion with some of Australia’s leading experts in public health, privacy and cybersecurity, asking not only whether the app works and whether the risks posed to privacy are proportionate and necessary, but also about the politics of vesting authority to make major decisions about public health in unaccountable tech companies.

Read More
Submission to National Data Sharing and Release Discussion Paper

In the aggregate, advances in data analytics can now yield unexpected and highly beneficial insights into human behaviour, which the government can harness in the interests of the public. But those advances pose significant risks of harming the very people they are intended to benefit. Read more in our submission to the National Data Sharing Commission’s discussion paper on Data Sharing and Release.

Read More
How to be imprecise and yet immune to sure loss

This paper considers strategies for making decisions in the face of severe uncertainty, when one's beliefs are best represented by a set of probability functions over the possible states of the world (as opposed to a single precise probability function). The question is whether one can employ a decision strategy that does not have the disadvantage of making one vulnerable to sure loss in sequential-decision scenarios.

Read More
A Planning Framework to Solve Conformant Planning Problems through a Counterexample Guided Refinement

In this paper, published in Artificial Intelligence, Alban Grastien and co-author address the problem of conformant planning, which consists in finding a sequence of actions in a well-specified environment that achieves a specified goal despite uncertainty on the initial configuration and without using observations.

Read More