AI Paper Atlas

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

Regret Bounds for Online Portfolio Selection with a Cardinality Constraint

Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-Ichi Kawarabayashi

NeurIPS 2018 · Bandits and online learning › Online convex optimization and games · approach: Online allocation with constraints

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 Algorithm 1 (full-feedback) instead of MWU_disconline portfolio selection with cardinality constraint · synthetic instance (d, T, C1, C2) = (20, 10000, -0.5, 0.5)average regretImproved
use Algorithm 2 (bandit-feedback) instead of Exp3_cont and Exp3_disconline portfolio selection with cardinality constraint · synthetic instance (d, T, C1, C2) = (20, 10000, -0.5, 0.5)average regretImproved
use Algorithms 1 and 2 instead of baselinesonline portfolio selection · S&P 500 stock data (d=470, T=1258)cumulative price relativeImproved
use Algorithms 1 and 2 instead of baselinesonline portfolio selection · crypto coin data (d=7, T=928)cumulative price relativeImproved

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