11 citations · 45 across the 21 of their papers we have counts for
4 papers · 1 filter
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…
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…
Local and Global Uniform Convexity Conditions
Thomas Kerdreux, Alexandre d'Aspremont, Sebastian Pokutta
We review various characterizations of uniform convexity and smoothness on norm balls in finite-dimensional spaces and connect results stemming from the geometry of Banach spaces w…
Generating Structured Adversarial Attacks Using Frank-Wolfe Method
Ehsan Kazemi, Thomas Kerdreux, Liquang Wang
White box adversarial perturbations are generated via iterative optimization algorithms most often by minimizing an adversarial loss on a neighborhood of the original imag…