When Exploration Comes for Free with Mixture-Greedy: Do we need UCB in Diversity-Aware Multi-Armed Bandits?
Bahar Dibaei Nia, Farzan Farnia

TL;DR
This paper challenges the necessity of UCB exploration bonuses in diversity-aware multi-armed bandits for generative AI, showing that a simple greedy approach often outperforms UCB-based methods due to implicit exploration.
Contribution
The paper demonstrates that in diversity-aware model selection, implicit exploration from the objective geometry can replace explicit UCB bonuses, leading to faster convergence and better performance.
Findings
Mixture-Greedy converges faster than UCB-based methods.
Implicit exploration arises from diversity-aware objectives.
Theoretical analysis explains conditions for implicit exploration.
Abstract
Efficient selection among multiple generative models is increasingly important in modern generative AI, where sampling from suboptimal models is costly. This problem can be formulated as a multi-armed bandit task. Under diversity-aware evaluation metrics, a non-degenerate mixture of generators can outperform any individual model, distinguishing this setting from classical best-arm identification. Prior approaches therefore incorporate an Upper Confidence Bound (UCB) exploration bonus into the mixture objective. However, across multiple datasets and evaluation metrics, we observe that the UCB term consistently slows convergence and often reduces sample efficiency. In contrast, a simple \emph{Mixture-Greedy} strategy without explicit UCB-type optimism converges faster and achieves even better performance, particularly for widely used metrics such as FID and Vendi where tight confidence…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Advanced Multi-Objective Optimization Algorithms · Machine Learning and Algorithms
