AI Paper Atlas

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

Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster $\text{L}$-/$\text{L}^\natural$-Convex Function Minimization

Shinsaku Sakaue, Taihei Oki

ICML 2023 · Bandits and online learning › Online convex optimization and games · approach: Learning-augmented online algorithms · 0 citations (OpenAlex)

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
Learn predictions by OGD on μ̄ (distance to set of all optimal solutions) instead of distance to a fixed optimal solutionprediction learning for L-/L♮-convex minimization · small random bipartite matching instancesnumber of Hungarian method iterationsImproved
Time bound uses distance to set of all optimal solutions (μ̄) rather than ℓ∞ distance to a fixed optimal solutionsteepest descent warm-started by prediction · L-/L♮-convex minimizationtime complexity boundImproved
Online-to-batch sample complexity of learning predictions via OGD on μ̄ (regret C√(2nT))prediction learning · L-/L♮-convex function distributionregret boundNo clear effect

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