Reproduce “Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem” 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

Junpei Komiyama, Junya Honda, Hisashi Kashima, Hiroshi Nakagawa

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.