AI Paper Atlas

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

Dynamic Assortment Optimization with Changing Contextual Information

Xi Chen, Yining Wang, Yuan Zhou

JMLR 2020 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 36 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
increase horizon T from 50 to 800 for the greedy swapping heuristicGreedy swapping heuristic · Greedy vs brute force (N=10, K=4, d=5)mean relative difference in objective value: 0.00207 -> 0.00024 -> 0.00004Improved
replace no-feature MNL-UCB with feature-based MLE-UCBMLE-UCB · N=1000, K=10, d=5, T up to 10000average regret: MLE-UCB performs much better than MNL-UCBImproved
increase feature dimension d from 5 to 25 (ablation)MLE-UCB · N=1000, K=10, T in {4000,6000,8000,10000}average regret: average regret increases approximately linearly with dHurt
increase number of items N from 1000 to 4000 (ablation)MLE-UCB · K=10, d=5, T=10000average regret: regret almost not affected by a bigger NNo 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