Reproduce “Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems” 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
Mohammadreza Daneshvaramoli, Helia Karisani, Adam Lechowicz, Bo Sun, Cameron Musco, Mohammad Hajiesmaili
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.