An adaptive Mirror-Prox method for variational inequalities with singular operators. - Kimon Antonakopoulos; Elena Veronica Belmega; Panayotis Mertikopoulos (NeurIPS, 2019)

Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach. - Kimon Antonakopoulos; Elena Veronica Belmega; Panayotis Mertikopoulos (ICLR, 2020)

Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium. - Yu-Guan Hsieh; Kimon Antonakopoulos; Panayotis Mertikopoulos (COLT, 2021)

Adaptive Extra-Gradient Methods for Min-Max Optimization and Games. - Kimon Antonakopoulos; Elena Veronica Belmega; Panayotis Mertikopoulos (ICLR, 2021)

Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements. - Kimon Antonakopoulos; Panayotis Mertikopoulos (NeurIPS, 2021)

Sifting through the noise: Universal first-order methods for stochastic variational inequalities. - Kimon Antonakopoulos; Thomas Pethick; Ali Kavis; Panayotis Mertikopoulos; Volkan Cevher (NeurIPS, 2021)

Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights. - Dong Quan Vu; Kimon Antonakopoulos; Panayotis Mertikopoulos (NeurIPS, 2021)

Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements. - Kimon Antonakopoulos; Panayotis Mertikopoulos (CoRR, 2021)

AdaGrad Avoids Saddle Points. - Kimon Antonakopoulos; Panayotis Mertikopoulos; Georgios Piliouras; Xiao Wang 036 (ICML, 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 (ICML, 2022)

Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods. - Kimon Antonakopoulos; Ali Kavis; Volkan Cevher (NeurIPS, 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 (NeurIPS, 2022)

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization. - Ali Kavis; Stratis Skoulakis; Kimon Antonakopoulos; Leello Tadesse Dadi; Volkan Cevher (NeurIPS, 2022)

Routing in an Uncertain World: Adaptivity, Efficiency, and Equilibrium. - Dong Quan Vu; Kimon Antonakopoulos; Panayotis Mertikopoulos (CoRR, 2022)

Distributed Extra-gradient with Optimal Complexity and Communication Guarantees. - Ali Ramezani-Kebrya; Kimon Antonakopoulos; Igor Krawczuk; Justin Deschenaux; Volkan Cevher (ICLR, 2023)

Advancing the Lower Bounds: an Accelerated, Stochastic, Second-order Method with Optimal Adaptation to Inexactness. - Artem Agafonov; Dmitry Kamzolov; Alexander V. Gasnikov; Ali Kavis; Kimon Antonakopoulos; Volkan Cevher; Martin Takác 001 (ICLR, 2024)

Universal Gradient Methods for Stochastic Convex Optimization. - Anton Rodomanov; Ali Kavis; Yongtao Wu; Kimon Antonakopoulos; Volkan Cevher (ICML, 2024)

Improving SAM Requires Rethinking its Optimization Formulation. - Wanyun Xie; Fabian Latorre; Kimon Antonakopoulos; Thomas Pethick; Volkan Cevher (ICML, 2024)

On the Generalization of Stochastic Gradient Descent with Momentum. - Ali Ramezani-Kebrya; Kimon Antonakopoulos; Volkan Cevher; Ashish Khisti; Ben Liang 001 (J. Mach. Learn. Res., 2024)

Training Deep Learning Models with Norm-Constrained LMOs. - Thomas Pethick; Wanyun Xie; Kimon Antonakopoulos; Zhenyu Zhu; Antonio Silveti-Falls; Volkan Cevher (CoRR, 2025)

Multi-Step Alignment as Markov Games: An Optimistic Online Gradient Descent Approach with Convergence Guarantees. - Yongtao Wu; Luca Viano; Yihang Chen; Zhenyu Zhu; Kimon Antonakopoulos; Quanquan Gu; Volkan Cevher (CoRR, 2025)

Layer-wise Quantization for Quantized Optimistic Dual Averaging. - Anh Duc Nguyen; Ilia Markov; Frank Zhengqing Wu; Ali Ramezani-Kebrya; Kimon Antonakopoulos; Dan Alistarh; Volkan Cevher (CoRR, 2025)

Generalized Gradient Norm Clipping & Non-Euclidean (L0,L1)-Smoothness. - Thomas Pethick; Wanyun Xie; Mete Erdogan; Kimon Antonakopoulos; Tony Silveti-Falls; Volkan Cevher (CoRR, 2025)