AI Paper Atlas

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

Efficient Online Portfolio with Logarithmic Regret

Haipeng Luo, Chen-Yu Wei, Kai Zheng

NeurIPS 2018 · Bandits and online learning › Online convex optimization and games · approach: Online allocation with constraints · 16 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 a lower-bounded simplex with x_i ≥ 1/(NT)BARRONS · Online portfolio managementregretImproved
Replace the adaptive beta tuning with a standard doubling scheduleBARRONS · Online portfolio managementregretMixed
Run a grid of BARRONS copies and select among them with HedgeBARRONS · Online portfolio managementtime per round: MN^{3.5}Hurt

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