Publication

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization

Publications associées (32)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization

Graph Chatbot

Chattez avec Graph Search

Optimal Convergence for Distributed Learning with Stochastic Gradient Methods and Spectral Algorithms

Convex Optimization using Sparsified Stochastic Gradient Descent with Memory

A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization

Stochastic Three-Composite Convex Minimization

Composite convex minimization involving self-concordant-like cost functions

Composite convex minimization involving self-concordant-like cost functions

Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences

A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions

Regularized Bundle Methods for Convex and Non-Convex Risks

Separation and Duality in Locally L0-Convex Modules

Convex Optimization using Sparsified Stochastic Gradient Descent with Memory

Composite convex minimization involving self-concordant-like cost functions

A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions

Regularized Bundle Methods for Convex and Non-Convex Risks

Separation and Duality in Locally L0-Convex Modules

Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences

A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization

Composite convex minimization involving self-concordant-like cost functions

Stochastic Three-Composite Convex Minimization

Optimal Convergence for Distributed Learning with Stochastic Gradient Methods and Spectral Algorithms