A Simple Linear Convergence Analysis of the Point-SAGA Algorithm
| Autor: | Condat, Laurent, Richtárik, Peter |
|---|---|
| Rok vydání: | 2024 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | Point-SAGA is a randomized algorithm for minimizing a sum of convex functions using their proximity operators (proxs), proposed by Defazio (2016). At every iteration, the prox of only one randomly chosen function is called. We generalize the algorithm to any number of prox calls per iteration, not only one, and propose a simple proof of linear convergence when the functions are smooth and strongly convex. |
| Databáze: | arXiv |
| Externí odkaz: |
|