Research map / Bandits and online learning / Online convex optimization and games
Online Knapsack with Frequency Predictions
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Time Fairness in Online Knapsack Problems (ICLR 2024 · similarity 0.90)
- Augmenting Online Algorithms for Knapsack Problem with Total Weight Information (AAAI 2025 · similarity 0.90)
- Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems (ICML 2025 · similarity 0.90)
- Learning-Augmented Online Bidding in Stochastic Settings (NeurIPS 2025 · similarity 0.86)
- Bandits with Replenishable Knapsacks: the Best of both Worlds (ICLR 2024 · similarity 0.85)
- Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search (ICML 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.