Reproduce “Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Raghav Bongole, Amaury Gouverneur, Borja Rodríguez-Gálvez, Tobias J. Oechtering, Mikael Skoglund
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.