default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKimon Antonakopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Ali Ramezani-Kebrya, Kimon Antonakopoulos, Volkan Cevher, Ashish Khisti, Ben Liang:
On the Generalization of Stochastic Gradient Descent with Momentum. J. Mach. Learn. Res. 25: 22:1-22:56 (2024)- [c16]Artem Agafonov, Dmitry Kamzolov, Alexander V. Gasnikov, Ali Kavis, Kimon Antonakopoulos, Volkan Cevher, Martin Takác:
Advancing the Lower Bounds: an Accelerated, Stochastic, Second-order Method with Optimal Adaptation to Inexactness. ICLR 2024 - [c15]Anton Rodomanov, Ali Kavis, Yongtao Wu, Kimon Antonakopoulos, Volkan Cevher:
Universal Gradient Methods for Stochastic Convex Optimization. ICML 2024 - [c14]Wanyun Xie, Fabian Latorre, Kimon Antonakopoulos, Thomas Pethick, Volkan Cevher:
Improving SAM Requires Rethinking its Optimization Formulation. ICML 2024 - [i9]Wanyun Xie, Fabian Latorre, Kimon Antonakopoulos, Thomas Pethick, Volkan Cevher:
Improving SAM Requires Rethinking its Optimization Formulation. CoRR abs/2407.12993 (2024) - 2023
- [c13]Ali Ramezani-Kebrya, Kimon Antonakopoulos, Igor Krawczuk, Justin Deschenaux, Volkan Cevher:
Distributed Extra-gradient with Optimal Complexity and Communication Guarantees. ICLR 2023 - [i8]Ali Ramezani-Kebrya, Kimon Antonakopoulos, Igor Krawczuk, Justin Deschenaux, Volkan Cevher:
Distributed Extra-gradient with Optimal Complexity and Communication Guarantees. CoRR abs/2308.09187 (2023) - 2022
- [c12]Kimon Antonakopoulos, Panayotis Mertikopoulos, Georgios Piliouras, Xiao Wang:
AdaGrad Avoids Saddle Points. ICML 2022: 731-771 - [c11]Kimon Antonakopoulos, Dong Quan Vu, Volkan Cevher
, Kfir Y. Levy, Panayotis Mertikopoulos:
UnderGrad: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees. ICML 2022: 772-795 - [c10]Kimon Antonakopoulos, Ali Kavis, Volkan Cevher:
Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods. NeurIPS 2022 - [c9]Yu-Guan Hsieh, Kimon Antonakopoulos, Volkan Cevher, Panayotis Mertikopoulos:
No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation. NeurIPS 2022 - [c8]Ali Kavis, Stratis Skoulakis, Kimon Antonakopoulos, Leello Tadesse Dadi, Volkan Cevher:
Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization. NeurIPS 2022 - [i7]Dong Quan Vu, Kimon Antonakopoulos, Panayotis Mertikopoulos:
Routing in an Uncertain World: Adaptivity, Efficiency, and Equilibrium. CoRR abs/2201.02985 (2022) - [i6]Yu-Guan Hsieh, Kimon Antonakopoulos, Volkan Cevher, Panayotis Mertikopoulos:
No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separation. CoRR abs/2206.06015 (2022) - [i5]Kimon Antonakopoulos, Ali Kavis, Volkan Cevher:
Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods. CoRR abs/2211.01832 (2022) - [i4]Ali Kavis, Stratis Skoulakis, Kimon Antonakopoulos, Leello Tadesse Dadi, Volkan Cevher:
Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization. CoRR abs/2211.01851 (2022) - 2021
- [c7]Yu-Guan Hsieh, Kimon Antonakopoulos, Panayotis Mertikopoulos:
Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium. COLT 2021: 2388-2422 - [c6]Kimon Antonakopoulos, Elena Veronica Belmega, Panayotis Mertikopoulos:
Adaptive Extra-Gradient Methods for Min-Max Optimization and Games. ICLR 2021 - [c5]Kimon Antonakopoulos, Thomas Pethick, Ali Kavis, Panayotis Mertikopoulos, Volkan Cevher:
Sifting through the noise: Universal first-order methods for stochastic variational inequalities. NeurIPS 2021: 13099-13111 - [c4]Dong Quan Vu, Kimon Antonakopoulos, Panayotis Mertikopoulos:
Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights. NeurIPS 2021: 14708-14720 - [c3]Kimon Antonakopoulos, Panayotis Mertikopoulos:
Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements. NeurIPS 2021: 19056-19068 - [i3]Yu-Guan Hsieh, Kimon Antonakopoulos, Panayotis Mertikopoulos:
Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium. CoRR abs/2104.12761 (2021) - [i2]Kimon Antonakopoulos, Panayotis Mertikopoulos:
Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements. CoRR abs/2107.08011 (2021) - 2020
- [c2]Kimon Antonakopoulos, Elena Veronica Belmega, Panayotis Mertikopoulos:
Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach. ICLR 2020 - [i1]Kimon Antonakopoulos, Elena Veronica Belmega, Panayotis Mertikopoulos:
Adaptive extra-gradient methods for min-max optimization and games. CoRR abs/2010.12100 (2020)
2010 – 2019
- 2019
- [c1]Kimon Antonakopoulos, Elena Veronica Belmega, Panayotis Mertikopoulos:
An adaptive Mirror-Prox method for variational inequalities with singular operators. NeurIPS 2019: 8453-8463
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
