AI Paper Atlas

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

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization

Massil HIHAT, Stéphane Gaïffas, Guillaume Garrigos, Simon Bussy

NeurIPS 2023 · Bandits and online learning › Online convex optimization and games · approach: Constrained and unconstrained OCO algorithms · 1 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 MaxCOSD instead of AIM on single-product lost sales inventory with i.i.d. Poisson(1) demandMaxCOSD · Setting 1 (T=1969)regretImproved
Use MaxCOSD instead of CUP on single-product perishable inventory (lifetime 2)MaxCOSD · Setting 2 (T=1969)regretImproved
Use MaxCOSD instead of DDM on multi-product (n=100) capacity-constrained problemMaxCOSD · Setting 3 (T=1969)regretImproved
Scale to n=3049 products with capacity constraints on M5 data versus DDMMaxCOSD · Setting 4 (M5, T=1969)regretHurt
Parallelized MaxCOSD (one instance per product) versus parallelized AIM under box constraintsMaxCOSD · Setting 5 (M5, n=3049)regretImproved
Sweep learning rate parameter gamma over 1e-5 to 1e1 (ablation)MaxCOSD · Settings 1-5regret after T=1969 periodsMixed

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