Optimization
SAGA
Introduced by Defazio et al. in SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite ObjectivesSAGA is a method in the spirit of SAG, SDCA, MISO and SVRG, a set of recently proposed incremental gradient algorithms with fast linear convergence rates. SAGA improves on the theory behind SAG and SVRG, with better theoretical convergence rates, and has support for composite objectives where a proximal operator is used on the regulariser. Unlike SDCA, SAGA supports non-strongly convex problems directly, and is adaptive to any inherent strong convexity of the problem.
Source: SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
Papers
| Paper | Code | Results | Date | Stars |
|---|
Tasks
| Task | Papers | Share |
|---|---|---|
| BIG-bench Machine Learning | 7 | 29.17% |
| Federated Learning | 3 | 12.50% |
| Interactive Segmentation | 1 | 4.17% |
| Scene Understanding | 1 | 4.17% |
| Entity Linking | 1 | 4.17% |
| Fact Verification | 1 | 4.17% |
| Knowledge Graph Embeddings | 1 | 4.17% |
| Knowledge Graphs | 1 | 4.17% |
| Adversarial Attack | 1 | 4.17% |
Usage Over Time
Components
| Component | Type |
|
|---|---|---|
| 🤖 No Components Found | You can add them if they exist; e.g. Mask R-CNN uses RoIAlign |
