Catalyst for Gradient-based Nonconvex Optimization - Archive ouverte HAL Access content directly
Conference Papers Year :

Catalyst for Gradient-based Nonconvex Optimization

(1) , (2) , (3) , (4) , (3)
1
2
3
4

Abstract

We introduce a generic scheme to solve non-convex optimization problems using gradient-based algorithms originally designed for minimizing convex functions. Even though these methods may originally require convexity to operate, the proposed approach allows one to use them without assuming any knowledge about the convexity of the objective. In general, the scheme is guaranteed to produce a stationary point with a worst-case efficiency typical of first-order methods, and when the objective turns out to be convex, it automatically accelerates in the sense of Nesterov and achieves near-optimal convergence rate in function values. We conclude the paper by showing promising experimental results obtained by applying our approach to incremental algorithms such as SVRG and SAGA for sparse matrix factorization and for learning neural networks.
Fichier principal
Vignette du fichier
paquette18a.pdf (633.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01773296 , version 1 (21-04-2018)

Identifiers

  • HAL Id : hal-01773296 , version 1

Cite

Courtney Paquette, Hongzhou Lin, Dmitriy Drusvyatskiy, Julien Mairal, Zaid Harchaoui. Catalyst for Gradient-based Nonconvex Optimization. AISTATS 2018 - 21st International Conference on Artificial Intelligence and Statistics, Apr 2018, Lanzarote, Spain. pp.613-622. ⟨hal-01773296⟩
673 View
376 Download

Share

Gmail Facebook Twitter LinkedIn More