atlas

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

The Primal-Dual method for Learning Augmented Algorithms

NeurIPS 2020 · Bandits and online learning › Online convex optimization and games · approach: Learning-augmented online algorithms · 32 citations (OpenAlex)

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
Adjust primal update rates toward sets in the predicted coverPDLA for online weighted set cover · Online weighted set covercost relative to predicted solution: O(1/(1-λ))Helped
Use predicted vacation length to choose aggressive or cautious buying updatesPDLA for ski rental · Ski rentalcompetitive ratio to OPT: 1/(1-e(-λ))Helped
Use predicted Bahncard purchase times to choose aggressive or cautious updatesPDLA for Bahncard · Bahncardcompetitive ratio to OPT: (e^λ-β)/(e^λ-1)Helped
Use predicted acknowledgement times to guide update ratesPDLA for dynamic TCP acknowledgement · Dynamic TCP acknowledgementcompetitive ratio to OPT: 1/(1-e^{-λ})Helped
Lower λ when the prediction is perfectPDLA for dynamic TCP acknowledgement · Dynamic TCP acknowledgementcompetitive ratioHelped
Increase prediction replacement noisePDLA for dynamic TCP acknowledgement · Poisson, Pareto, and iterated Poisson packet arrivalscompetitive ratioMixed

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