Radio and PodcastRadio and PodcastLive Radio & Podcasts
From probabilistic bisimulation to representation learning via metrics artwork
Education

From probabilistic bisimulation to representation learning via metrics

Computer Science by Oxford University

Dec 2, 202455:03Education

Strachey Lecture: From probabilistic bisimulation to representation learning via metrics - Professor Prakash Panangaden Bisimulation is a fundamental equivalence relation in process theory invented by Robin Milner and wi...

About This Episode

From probabilistic bisimulation to representation learning via metrics is an episode from Computer Science by Oxford University. Strachey Lecture: From probabilistic bisimulation to representation learning via metrics - Professor Prakash Pa...

Podcast

This episode belongs to Computer Science.

Listen Online

Use the player on this page to stream the episode online.

Episode Details

Published Dec 2, 2024, 55:03 long, audio available.

Questions About This Episode

What is From probabilistic bisimulation to representation learning via metrics about?

Strachey Lecture: From probabilistic bisimulation to representation learning via metrics - Professor Prakash Panangaden Bisimulation is a fundamental equivalence relation in process theory invented by Robin Milner and with an elegant fixed-point definition due to David Park. In this talk I will review the concept of bisimulation and then discuss its probabilistic analogue. This was extended to systems with continuous state spaces. Despite its origin in theoretical work, it has proved to be useful in fields like machine learning, especially reinforcement learning. Surprisingly, it turned out that one could prove a striking theorem: a theorem that pins down exactly what differences one can "see" in process behaviours when two systems are not bisimilar. However, it is questionable whether a concept like equivalence is the right one for quantitative systems. If two systems are almost, but not quite, the same, bisimulation would just say that they are not equivalent. One would like to say in some way that they are "almost" the same. Metric analogues of bisimulation were developed to capture a notion of behavioral similarity rather than outright equivalence. These ideas have been adopted by the machine learning community and a bisimulation-style metric was developed for Markov decision processes. Recent work has shown that variants of these bisimulation metrics can be useful in representation learning. I will tell the tale of this arc of ideas in as accessible a way as possible.

Where can I listen to From probabilistic bisimulation to representation learning via metrics?

You can listen to From probabilistic bisimulation to representation learning via metrics online on Radio and Podcast. Open the player on this page to stream the available audio.

Which podcast is From probabilistic bisimulation to representation learning via metrics from?

From probabilistic bisimulation to representation learning via metrics is an episode from Computer Science by Oxford University.

How long is this episode?

This episode is 55:03 long.

When was this episode published?

This episode was published on Dec 2, 2024.

Can I save From probabilistic bisimulation to representation learning via metrics for later?

Yes. Use the heart button on the episode page to add it to your favorite episodes list.

Are there related episodes from Computer Science?

Yes. This page shows related episodes from Computer Science when more episodes are available from the podcast feed.

Quick Answers About This Episode

Where can I listen to From probabilistic bisimulation to representation learning via metrics?

You can listen to From probabilistic bisimulation to representation learning via metrics on this page when the episode audio is available from the podcast feed.

Which podcast is this episode from?

From probabilistic bisimulation to representation learning via metrics is from Computer Science by Oxford University.

What are the episode details?

Published Dec 2, 2024 and 55:03 long