Search Results for author:
Found 1 papers, 0 papers with code
Analysing the Sample Complexity of Opponent Shaping
Providing theoretical guarantees for M-FOS is hard because A) there is little literature on theoretical sample complexity bounds for meta-reinforcement learning B) M-FOS operates in continuous state and action spaces, so theoretical analysis is challenging.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
