Research map / Bandits and online learning / Online convex optimization and games
Dual Mirror Descent for Online Allocation Problems
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use online dual mirror descent with step size eta ~ 1/sqrt(T) (dual sub-gradient descent reference function) | online proportional matching with high entropy · Proportional matching numerical experiment | regret growth with horizon T | Helped |
| Dual sub-gradient descent dual update with online dual mirror descent | online proportional matching with high entropy · Proportional matching numerical experiment | relative reward | Helped |
Closest papers by meaning
- Joint Online Learning and Decision-making via Dual Mirror Descent (ICML 2021 · similarity 0.91)
- Online Learning under Budget and ROI Constraints via Weak Adaptivity (ICML 2024 · similarity 0.91)
- Online Resource Allocation With General Constraints (NeurIPS 2026 · 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.87)
- Wait-Less Offline Tuning and Re-solving for Online Decision Making (ICML 2025 · similarity 0.87)
- No-Regret Online Autobidding Algorithms in First-price Auctions (NeurIPS 2025 · 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.