Research map / Bandits and online learning / Online convex optimization and games
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback
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
- Efficient Online Linear Optimization with Approximation Algorithms (NeurIPS 2017 · similarity 0.93)
- Oracle-Efficient Combinatorial Semi-Bandits (NeurIPS 2025 · similarity 0.92)
- Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback (ICLR 2024 · similarity 0.89)
- Testing the Feasibility of Linear Programs with Bandit Feedback (ICML 2024 · similarity 0.89)
- Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting (AAAI 2025 · similarity 0.89)
- Best of Both Worlds: Regret Minimization versus Minimax Play (ICML 2025 · similarity 0.88)
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.