today local_bar

Richard Combes

Assistant Professor, CentraleSupelec

1 paper at NeurIPS 2025

OpenReview· Semantic Scholar· Google Scholar

Poster Session 4

Thursday, December 4, 2025 · 4:30 PM → 7:30 PM

Exhibit Hall C,D,E

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms

#406 · William Réveillard, Richard Combes

We develop a computationally tractable algorithm to solve the Graves-Lai problem for multimodal bandits.