Research map / Bandits and online learning / Online convex optimization and games
A Batch-to-Online Transformation under Random-Order Model
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
- From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model (NeurIPS 2026 · similarity 0.92)
- Efficient Online Linear Optimization with Approximation Algorithms (NeurIPS 2017 · similarity 0.88)
- Online Improper Learning with an Approximation Oracle (NeurIPS 2018 · similarity 0.87)
- Decoupling Learning and Decision-Making: Breaking the $\mathcal{O}(\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods (ICML 2024 · similarity 0.86)
- Dynamic Regret Reduces to Kernelized Static Regret (NeurIPS 2025 · similarity 0.86)
- Regret minimization in Linear Bandits with offline data via extended D-optimal exploration. (NeurIPS 2026 · similarity 0.86)
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.