Search

Home
Team
Publications
Contact

Light Dark Automatic

Sanmi Koyejo

Stanford University

Personal website

Latest

One Policy is Enough: Parallel Exploration with a Single Policy is Minimax Optimal for Reward-Free Reinforcement Learning
Partially Linear Additive Gaussian Graphical Models

Cite