Research map / Bandits and online learning / Online convex optimization and games
Learning from a Sample in Online Algorithms
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
- Learning-Augmented Algorithms for Online Steiner Tree (AAAI 2022 · similarity 0.90)
- A Learning-Augmented Approach to Online Allocation Problems (NeurIPS 2025 · similarity 0.89)
- Decoupling Learning and Decision-Making: Breaking the $\mathcal{O}(\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods (ICML 2024 · similarity 0.85)
- Approximation algorithms for combinatorial optimization with predictions (ICLR 2025 · similarity 0.85)
- On the Universal Near Optimality of Hedge in Combinatorial Settings (NeurIPS 2025 · similarity 0.85)
- Improved Bounds for Online Facility Location with Predictions (AAAI 2025 · similarity 0.84)
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.