Regret minimization and convergence to equilibria in general-sum markov games L Erez, T Lancewicki, U Sherman, T Koren, Y Mansour International Conference on Machine Learning, 9343-9373, 2023 | 29 | 2023 |
Improved regret for efficient online reinforcement learning with linear function approximation U Sherman, T Koren, Y Mansour International Conference on Machine Learning, 31117-31150, 2023 | 21 | 2023 |
Benign underfitting of stochastic gradient descent T Koren, R Livni, Y Mansour, U Sherman Advances in Neural Information Processing Systems 35, 19605-19617, 2022 | 18 | 2022 |
Lazy oco: Online convex optimization on a switching budget U Sherman, T Koren Conference on Learning Theory, 3972-3988, 2021 | 16 | 2021 |
Rate-optimal policy optimization for linear markov decision processes U Sherman, A Cohen, T Koren, Y Mansour arXiv preprint arXiv:2308.14642, 2023 | 11 | 2023 |
Optimal rates for random order online optimization U Sherman, T Koren, Y Mansour Advances in Neural Information Processing Systems 34, 2097-2108, 2021 | 10 | 2021 |
The dimension strikes back with gradients: Generalization of gradient methods in stochastic convex optimization M Schliserman, U Sherman, T Koren arXiv preprint arXiv:2401.12058, 2024 | 3 | 2024 |
Convergence of Policy Mirror Descent Beyond Compatible Function Approximation U Sherman, T Koren, Y Mansour arXiv preprint arXiv:2502.11033, 2025 | | 2025 |