Search Results - Antonakopoulos, Kimon

  • Showing 1 - 12 results of 12
Refine Results
  1. 1
    Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements

    Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements by Antonakopoulos, Kimon, Mertikopoulos, Panayotis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods

    Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods by Antonakopoulos, Kimon, Kavis, Ali, Cevher, Volkan

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Improving SAM Requires Rethinking its Optimization Formulation

    Improving SAM Requires Rethinking its Optimization Formulation by Xie, Wanyun, Latorre, Fabian, Antonakopoulos, Kimon, Pethick, Thomas, Cevher, Volkan

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Universal Gradient Methods for Stochastic Convex Optimization

    Universal Gradient Methods for Stochastic Convex Optimization by Rodomanov, Anton, Kavis, Ali, Wu, Yongtao, Antonakopoulos, Kimon, Cevher, Volkan

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Routing in an Uncertain World: Adaptivity, Efficiency, and Equilibrium

    Routing in an Uncertain World: Adaptivity, Efficiency, and Equilibrium by Dong Quan Vu, Antonakopoulos, Kimon, Mertikopoulos, Panayotis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium

    Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium by Yu-Guan, Hsieh, Antonakopoulos, Kimon, Mertikopoulos, Panayotis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separation

    No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separation by Yu-Guan, Hsieh, Antonakopoulos, Kimon, Cevher, Volkan, Mertikopoulos, Panayotis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Adaptive extra-gradient methods for min-max optimization and games

    Adaptive extra-gradient methods for min-max optimization and games by Antonakopoulos, Kimon, Belmega, E Veronica, Mertikopoulos, Panayotis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness

    Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness by Agafonov, Artem, Kamzolov, Dmitry, Gasnikov, Alexander, Kavis, Ali, Antonakopoulos, Kimon, Cevher, Volkan, Takáč, Martin

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Distributed Extra-gradient with Optimal Complexity and Communication Guarantees

    Distributed Extra-gradient with Optimal Complexity and Communication Guarantees by Ramezani-Kebrya, Ali, Antonakopoulos, Kimon, Krawczuk, Igor, Deschenaux, Justin, Cevher, Volkan

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization

    Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization by Kavis, Ali, Skoulakis, Stratis, Antonakopoulos, Kimon, Leello Tadesse Dadi, Cevher, Volkan

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A universal black-box optimization method with almost dimension-free convergence rate guarantees

    A universal black-box optimization method with almost dimension-free convergence rate guarantees by Antonakopoulos, Kimon, Dong Quan Vu, Cevher, Vokan, Levy, Kfir Y, Mertikopoulos, Panayotis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: