PofoliaShared via Pofolia

arXiv (Cornell University)· 2014· Preprint

SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives

Aaron Defazio, Francis Bach, Simon Lacoste-Julien

Short summary

SAGA is a new optimization method that achieves faster linear convergence rates than previous incremental gradient algorithms like SAG and SVRG, and directly supports non-strongly convex composite objectives.

AI-generated from the title and abstract; the full text is not read.

TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app

The rest is in the Pofolia app

Takeaways, key points and questions to the paper; new summaries every day for your field. Free.

Sign in on the web to open

Field: Computational Mechanics

Computational MechanicsEngineering