Kimon Antonakopoulos

According to our database, Kimon Antonakopoulos authored at least 15 papers between 2019 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Distributed Extra-gradient with Optimal Complexity and Communication Guarantees.

Ali Ramezani-Kebrya, Kimon Antonakopoulos, Igor Krawczuk, Justin Deschenaux, Volkan Cevher

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

Routing in an Uncertain World: Adaptivity, Efficiency, and Equilibrium.

Dong Quan Vu, Kimon Antonakopoulos, Panayotis Mertikopoulos

CoRR, 2022

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization.

Ali Kavis, Stratis Skoulakis, Kimon Antonakopoulos, Leello Tadesse Dadi, Volkan Cevher

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation.

Yu-Guan Hsieh, Kimon Antonakopoulos, Volkan Cevher, Panayotis Mertikopoulos

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods.

Kimon Antonakopoulos, Ali Kavis, Volkan Cevher

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

UnderGrad: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees.

Kimon Antonakopoulos, Dong Quan Vu, Volkan Cevher, Kfir Y. Levy, Panayotis Mertikopoulos

Proceedings of the International Conference on Machine Learning, 2022

AdaGrad Avoids Saddle Points.

Kimon Antonakopoulos, Panayotis Mertikopoulos, Georgios Piliouras, Xiao Wang

Proceedings of the International Conference on Machine Learning, 2022

2021

Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements.

Kimon Antonakopoulos, Panayotis Mertikopoulos

CoRR, 2021

Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights.

Dong Quan Vu, Kimon Antonakopoulos, Panayotis Mertikopoulos

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Sifting through the noise: Universal first-order methods for stochastic variational inequalities.

Kimon Antonakopoulos, Thomas Pethick, Ali Kavis, Panayotis Mertikopoulos, Volkan Cevher

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements.

Kimon Antonakopoulos, Panayotis Mertikopoulos

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Adaptive Extra-Gradient Methods for Min-Max Optimization and Games.

Kimon Antonakopoulos, Elena Veronica Belmega, Panayotis Mertikopoulos

Proceedings of the 9th International Conference on Learning Representations, 2021

Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium.

Yu-Guan Hsieh, Kimon Antonakopoulos, Panayotis Mertikopoulos

Proceedings of the Conference on Learning Theory, 2021

2020

Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach.

Kimon Antonakopoulos, Elena Veronica Belmega, Panayotis Mertikopoulos

Proceedings of the 8th International Conference on Learning Representations, 2020

2019

An adaptive Mirror-Prox method for variational inequalities with singular operators.

Kimon Antonakopoulos, Elena Veronica Belmega, Panayotis Mertikopoulos

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019