2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.LG2021★ 1 cited
Efficient Online-Bandit Strategies for Minimax Learning Problems
Christophe Roux, Elias Wirth, Sebastian Pokutta +1
Several learning problems involve solving min-max problems, e.g., empirical distributional robust learning or learning with non-standard aggregated losses. More specifically, these…
cs.LG2021★ 2 cited
Linear Bandits on Uniformly Convex Sets
Thomas Kerdreux, Christophe Roux, Alexandre d'Aspremont +1
Linear bandit algorithms yield pseudo-regret bounds on compact convex action sets and two types of structural assu…