1 citations · 1 across the 2 of their papers we have counts for
2 papers
stat.ML2022★ 1 cited
Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variance
Nuri Mert Vural, Lu Yu, Krishnakumar Balasubramanian +2
We study stochastic convex optimization under infinite noise variance. Specifically, when the stochastic gradient is unbiased and has uniformly bounded -th moment, for some…
cs.LG2019
Minimax Optimal Algorithms for Adversarial Bandit Problem with Multiple Plays
N. Mert Vural, Hakan Gokcesu, Kaan Gokcesu +1
We investigate the adversarial bandit problem with multiple plays under semi-bandit feedback. We introduce a highly efficient algorithm that asymptotically achieves the performance…