AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Bandit Online Linear Optimization with Hints and Queries

ICML 2023 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit 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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add good hints (⟨h_t,c_t⟩ ≥ 1/4 at every step) to bandit OLOBandit OLO in two dimensions with unit ball domain · Lower bound construction (Theorem 3.1)expected regretNo clear effect
Add query access (algorithm queries inner product with a uniformly random unit-sphere point) and use the response to build cost estimate and hintBandit OLO with queries (Algorithm 1) · all query responses good (B=0)expected regretHelped
Increase number of bad query responses B under Algorithm 1Bandit OLO with queries (Algorithm 1) · regret bound with B bad responsesexpected regretHurt
Add binary response feedback (gt) after playing, with hint weight learner and Dikin-ellipsoid explorationBandit OLO with queries and response feedback (Algorithm 2) · regret bound with B bad responsesexpected regretHelped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy