AI Paper Atlas

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

Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems

Bo Sun, Russell Lee, Mohammad Hajiesmaili, Adam Wierman, Danny Tsang

NeurIPS 2021 · Bandits and online learning › Online convex optimization and games · approach: Learning-augmented online algorithms · 2 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
use learning-augmented OTA with online-learned robustness parameter instead of the worst-case optimal algorithmOTA for BTC to USD conversion · BTC-USD one-week conversion, error level 1.0upper boxplot whisker of profit ratio: 1.35 -> 1.25Improved
raise crash probability to 0.45 for the worst-case optimized algorithmworst-case optimized online algorithm · BTC-USD, error level 1.0profit ratioHurt
raise crash probability for the learning-augmented OTA (online-learned and offline-best lambda)learning-augmented OTA · BTC-USD, error level 1.0profit ratioNo clear effect
online-learned lambda instead of offline-best lambdalearning-augmented OTA · BTC-USD one-week conversionupper boxplot whisker of profit ratioNo 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