Between stochastic and adversarial online convex optimization: Improved regret bounds via smoothness S Sachs, H Hadiji, T van Erven, C Guzmán Advances in Neural Information Processing Systems 35, 691-702, 2022 | 11 | 2022 |
Robust online convex optimization in the presence of outliers T van Erven, S Sachs, WM Koolen, W Kotlowski Conference on Learning Theory, 4174-4194, 2021 | 5 | 2021 |
Generalization Guarantees via Algorithm-dependent Rademacher Complexity S Sachs, T van Erven, L Hodgkinson, R Khanna, U Şimşekli The Thirty Sixth Annual Conference on Learning Theory, 4863-4880, 2023 | 3 | 2023 |
Accelerated rates between stochastic and adversarial online convex optimization S Sachs, H Hadiji, T van Erven, C Guzman arXiv preprint arXiv:2303.03272, 2023 | 3 | 2023 |
Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games H Hadiji, S Sachs, T van Erven, WM Koolen Advances in Neural Information Processing Systems 36, 2024 | | 2024 |