video thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

On the Hardness of Finding Symmetries in Markov Decision Processes

Published on Feb 4, 20253515 Views

In this work we address the question of finding symmetries of a given MDP. We show that the problem is Isomorphism Complete, that is, the problem is polynomially equivalent to verifying whether two gr

Related categories

Presentation