Diversified Multinomial Logit Contextual Bandits

arXiv:2607.11684 · stat.ML, cs.LG · Submitted 2026-07-13 · Read on arXiv

stat.ML, cs.LG

Submitted: 2026-07-13

Updated: 2026-09-28

License: http://creativecommons.org/licenses/by-sa/4.0/

The gist: Existing contextual multinomial logit (MNL) bandits model relevance-driven choice but ignore the potential benefits of within-assortment diversity, while submodular/combinatorial bandits encode

Terminology

Abstract

Existing contextual multinomial logit (MNL) bandits model relevance-driven choice but ignore the potential benefits of within-assortment diversity, while submodular/combinatorial bandits encode diversity in rewards but lack structured choice probabilities. We bridge this gap with the diversified multinomial logit (DMNL) contextual bandit, which augments MNL choice probabilities with a generally submodular diversity function, thereby formalizing the relevance--diversity trade-off within a single model. Incorporating diversity renders exact MNL assortment optimization intractable. We propose a white-box UCB-based algorithm, OFU-DMNL, that constructs assortments item-wise by maximizing optimistic marginal gains, avoids black-box optimization oracles. We show that OFU-DMNL achieves at least a (1-1 over e+1) - approximate regret bound (d sqrt T/K), where d is the context dimension, K the maximum assortment size, and T the horizon, and attains an improved approximation factor over standard submodular baselines. Experiments demonstrate consistent gains and, relative to exhaustive enumeration, comparable regret with substantially lower runtime. Overall, DMNL bandits provide a practical foundation for diversity-aware assortment optimization under uncertainty, and OFU-DMNL offers a statistically and computationally efficient solution.

Sources

Related papers