atlas

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

Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms

NeurIPS 2020 · Bandits and online learning › Online convex optimization and games · approach: Learning-augmented online algorithms · 22 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
Require deterministic ski-rental consistency of (1+λ)Ski-rental algorithms with machine-learned prediction · Ski rentalrobustness: (1+1/λ) robustness is necessaryHurt
Require randomized ski-rental robustness γSki-rental algorithms with machine-learned prediction · Ski rentalconsistency: \beta\ge\gamma\log\left(1 + \frac{1}{\gamma - 1}\right)Hurt
Require consistency of (1+λ)Non-clairvoyant scheduling algorithms · Non-clairvoyant scheduling with n jobsrobustness: \gamma \geq \frac{n + n(n+1)\lambda}{1 + \lambda{(n+1)(n+2)}/{2}}Hurt
Use Two-Stage-Schedule: round-robin until the consistency allowance is tight, then process in predicted orderNon-clairvoyant scheduling · Non-clairvoyant scheduling with 2 jobsrobustness: 4/(3-3\lambda) -> (1+1/(1+6\lambda))Helped
Set consistency to (1+λ) using Two-Stage-ScheduleNon-clairvoyant scheduling · Non-clairvoyant scheduling with 2 jobsconsistency: (1+\lambda)Helped

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