AI Paper Atlas

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

Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case

Taihei Oki, Shinsaku Sakaue

NeurIPS 2023 · Bandits and online learning › Online convex optimization and games · approach: Learning-augmented online algorithms

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 changedWhereMeasuredEffect
initialize greedy algorithm with learned predictions (Learn) instead of cold startgreedy M-convex minimization on staff-assignment Laminar instances · Staff assignment, n=128, R=12800, sigma in {1,5,10,20}greedy iterationsImproved
initialize with Learn instead of Relax (continuous relaxation solved with Gurobi)greedy M-convex minimization · Staff assignment, sigma <= 10greedy iterationsImproved
initialize with Learn instead of Relax at high noisegreedy M-convex minimization · Staff assignment, sigma = 20greedy iterationsNo clear effect
increase noise strength sigma of instance coefficientsLearn initialization · Staff assignment, sigma 1 to 20greedy iterations advantage over baselinesHurt

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