AI Paper Atlas

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

Faster Fundamental Graph Algorithms via Learned Predictions

Justin Chen, Sandeep Silwal, Ali Vakilian, Fred Zhang

ICML 2022 · Bandits and online learning › Online convex optimization and games · approach: Learning-augmented online algorithms · 4 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
Initialize matching with predicted duals rather than starting from scratchHungarian algorithm on foreign-exchange-derived matching instances · Foreign-exchange shortest-path-to-matching instances, 2020–2021Hungarian algorithm iterations: up to an order of magnitude reductionImproved
Use prior-month optimal duals rather than the training-set median dualsHungarian algorithm on foreign-exchange-derived matching instances · Foreign-exchange shortest-path-to-matching instances, 2020–2021Hungarian algorithm iterationsImproved
Use less accurate predicted dualsHungarian algorithm on foreign-exchange-derived matching instances · Foreign-exchange shortest-path-to-matching instances, batch settingHungarian iterations savedHurt

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