Research map / Bandits and online learning / Online convex optimization and games
Online Learning with a Hint
Ofer Dekel, arthur flajolet, Nika Haghtalab, Patrick Jaillet
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| Add a weakly correlated directional hint (margin alpha) to online linear optimization over a strongly convex action set, with Algorithm Ahint built on AEXP over virtual losses | online linear optimization with hints on strongly convex K · theoretical regret analysis | worst-case regret | Improved |
| Add a directional hint on a (C,q)-uniformly convex action set with q in (2,3) and a finite hint set (Algorithm Aset) | online linear optimization with hints on (C,q)-uniformly convex K · theoretical regret analysis | worst-case regret | Improved |
| Provide a directional hint when the action set is a polyhedron (e.g., L1 or L-infinity ball) | online linear optimization with hints on polyhedral K · theoretical lower bound | worst-case regret | No clear effect |
| Use a naive strategy that moves the action to the extreme point in direction -v_t | online linear optimization with hints, strongly convex K example · illustrative example (ct=(1,1/2), vt=(0,1), Euclidean ball) | regret: linear regret, regret of (√5−1)/2 T | Hurt |
Closest papers by meaning
- Online Learning with Imperfect Hints (ICML 2020 · similarity 0.95)
- Online Linear Optimization with Many Hints (NeurIPS 2020 · similarity 0.93)
- Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound (NeurIPS 2025 · similarity 0.89)
- Optimal Algorithms for Online Convex Optimization with Adversarial Constraints (NeurIPS 2024 · similarity 0.87)
- Fully Unconstrained Online Learning (NeurIPS 2024 · similarity 0.87)
- Optimism Without Regularization: Constant Regret in Zero-Sum Games (NeurIPS 2025 · similarity 0.87)
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.
