Seguir
Sarah Sachs
Sarah Sachs
PostDoc at Bocconi University, Milan
Dirección de correo verificada de unibocconi.it - Página principal
Título
Citado por
Citado por
Año
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
202022
Accelerated rates between stochastic and adversarial online convex optimization
S Sachs, H Hadiji, T van Erven, C Guzman
arXiv preprint arXiv:2303.03272, 2023
62023
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
62021
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
52023
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
42024
Tracking solutions of time-varying variational inequalities
H Hadiji, S Sachs, C Guzmán
arXiv preprint arXiv:2406.14059, 2024
12024
An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems
S Sachs, H Hadiji, T van Erven, M Staudigl
arXiv preprint arXiv:2410.02400, 2024
2024
Optimization, games and generalization bounds
S Sachs
University of Amsterdam, 2024
2024
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–8