AI Paper Atlas

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

Optimal Design for Multinomial Logit Model with Applications to Best Assortment Identification

Joongkyu Lee, Min-hwan Oh

ICML 2026 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms · 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
replace brute-force LMO enumeration with polynomial-time Schur-complement lifted LMOBSI-MNL · LMO runtime, N=100, K=5avg LMO runtime (s): 9048.44 -> 0.17Improved
replace brute-force LMO enumeration with MILP reformulationBSI-MNL · LMO runtime, N=200, K=4avg LMO runtime (s): 7154.85 -> 271.88Improved
use MILP instead of brute-force LMO on small instancesBSI-MNL · LMO runtime, N=30, K=3avg LMO runtime (s): 0.38 -> 2.06Hurt
use MILP or lifted LMO in place of exact oracleBSI-MNL · stopping time, N from 10 to 50, K from 2 to 5stopping timeNo 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