11 citations · 44 across the 18 of their papers we have counts for
5 papers · 1 filter
Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods
Kimon Antonakopoulos, Ali Kavis, Volkan Cevher
This work proposes a universal and adaptive second-order method for minimizing second-order smooth, convex functions. Our algorithm achieves convergence when the o…
Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization
Ali Kavis, Stratis Skoulakis, Kimon Antonakopoulos +2
We propose an adaptive variance-reduction method, called AdaSpider, for minimization of -smooth, non-convex functions with a finite-sum structure. In essence, AdaSpider combines…
A universal black-box optimization method with almost dimension-free convergence rate guarantees
Kimon Antonakopoulos, Dong Quan Vu, Vokan Cevher +2
Universal methods for optimization are designed to achieve theoretically optimal convergence rates without any prior knowledge of the problem's regularity parameters or the accurar…
No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separation
Yu-Guan Hsieh, Kimon Antonakopoulos, Volkan Cevher +1
We examine the problem of regret minimization when the learner is involved in a continuous game with other optimizing agents: in this case, if all players follow a no-regret algori…
Routing in an Uncertain World: Adaptivity, Efficiency, and Equilibrium
Dong Quan Vu, Kimon Antonakopoulos, Panayotis Mertikopoulos
We consider the traffic assignment problem in nonatomic routing games where the players' cost functions may be subject to random fluctuations (e.g., weather disturbances, perturbat…