40 citations · 153 across the 24 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2016★ 4 cited
An efficient high-probability algorithm for Linear Bandits
Gábor Braun, Sebastian Pokutta
For the linear bandit problem, we extend the analysis of algorithm CombEXP from [R. Combes, M. S. Talebi Mazraeh Shahi, A. Proutiere, and M. Lelarge. Combinatorial bandits revisite…
cs.DS2016★ 5 cited
Lazifying Conditional Gradient Algorithms
Gábor Braun, Sebastian Pokutta, Daniel Zink
Conditional gradient algorithms (also often called Frank-Wolfe algorithms) are popular due to their simplicity of only requiring a linear optimization oracle and more recently they…