| Global convergence and variance reduction for a class of nonconvex-nonconcave minimax problems J Yang, N Kiyavash, N He Advances in Neural Information Processing Systems 33, 1153-1165, 2020 | 146* | 2020 |
| The complexity of nonconvex-strongly-concave minimax optimization S Zhang*, J Yang*, C Guzmán, N Kiyavash, N He Uncertainty in Artificial Intelligence, 482-492, 2021 | 54 | 2021 |
| A catalyst framework for minimax optimization J Yang, S Zhang, N Kiyavash, N He Advances in Neural Information Processing Systems 33, 5667-5678, 2020 | 47 | 2020 |
| Faster single-loop algorithms for minimax optimization without strong concavity J Yang, A Orvieto, A Lucchi, N He International Conference on Artificial Intelligence and Statistics, 5485-5517, 2022 | 38 | 2022 |
| Nest your adaptive algorithm for parameter-agnostic nonconvex minimax optimization J Yang*, X Li*, N He Advances in Neural Information Processing Systems, 2022 | 11 | 2022 |
| Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods J Yang*, X Li*, I Fatkhullin, N He Thirty-seventh Conference on Neural Information Processing Systems, 2023 | 2 | 2023 |
| TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization X Li, J Yang, N He International Conference on Learning Representations, 2023 | 2 | 2023 |
| Parameter-Agnostic Optimization under Relaxed Smoothness F Hübler, J Yang, X Li, N He arXiv preprint arXiv:2311.03252, 2023 | | 2023 |
| Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization L Zhang*, J Yang*, A Karbasi, N He arXiv preprint arXiv:2310.17759, 2023 | | 2023 |
Niao HeETH ZürichVerified email at inf.ethz.ch
