Reproduce “Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.