AI Paper Atlas

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

Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problem

Junyu Cao, Wei Sun

ICML 2019 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 0 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 the proposed simultaneous exploration-exploitation policy instead of explore-then-exploitSMNL Bandit · Synthetic, 12 productsaverage regret: 247.78 -> 14.39Improved
Place low-profit new products in the secondary tier instead of randomly assigning them to either tierSMNL Bandit · Synthetic, 15 new productsaverage regret: 178.00 -> 102.21Improved
Present the two products in tiers rather than together in one tierProduct recommendation in Example 1 · Two-product exampleexpected profit: 0.952 -> 1.36Improved
Increase the support of the product-valuation distribution from [0,0,1] through [0,0.5]SMNL Bandit · Synthetic robustness studyaverage regret: 129.87, 243.38, 348.31, and 620.14Hurt
Add a low-profit new product to the secondary tier rather than the priority tier during learningSMNL Bandit with minimum learning criterion · Single low-profit new productregret per epochImproved

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