S. Hanzely

activity

20202025

most citedLower Bounds and Optimal Algorithms for Personalized Federated Learning

64 citations · 67 across the 12 of their papers we have counts for

collaborators

Showing 2023 · math.OCShow all

2 papers · 2 filters

math.OC2023

Sketch-and-Project Meets Newton Method: Global $O (k^{- 2})$ Convergence with Low-Rank Updates

Slavomír Hanzely

In this paper, we propose the first sketch-and-project Newton method with fast $O (k^{- 2})$ global convergence rate for self-concordant functions. Our method, SGN, can be v…

math.OC2023

Convergence of First-Order Algorithms for Meta-Learning with Moreau Envelopes

Konstantin Mishchenko, Slavomír Hanzely, Peter Richtárik

In this work, we consider the problem of minimizing the sum of Moreau envelopes of given functions, which has previously appeared in the context of meta-learning and personalized f…

Sketch-and-Project Meets Newton Method: Global O(k−2) Convergence with Low-Rank Updates

Convergence of First-Order Algorithms for Meta-Learning with Moreau Envelopes

Sketch-and-Project Meets Newton Method: Global $O (k^{- 2})$ Convergence with Low-Rank Updates